A Rough Set Theoretic Approach to Clustering

• Autorzy: De S. K.
• Języki publikacji: EN

Abstrakty

EN

In this paper, cluster analysis based on fuzzy relations is investigated. This paper starts with fuzzy proximity relations and cluster analysis based on fuzzy proximity relation is performed by using rough approximation. A clustering algorithm has been proposed and explained with an example.

Słowa kluczowe

EN

cluster analysis; fuzzy sets; fuzzy proximity relations; rough sets

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2004
• Tom: Vol. 62, nr 3,4
• Strony: 409--417
• Opis fizyczny: Bibliogr. 29 poz.

Twórcy

autor

De S. K.

• Operations Management and Information Systems Area, XLRl Jamshedpur, Jamshedpur-831001, INDIA,

Bibliografia

• [1] R.Bellman, R.Kalaba and L.A.Zadeh, Abstraction and pattern classification, Jl. Math. Anal. Appl. 2 (1966) 581-586.
• [2] J.C.Bezdek, A Convergence Theorem for the Fuzzy Isodata Clustering Algorithms, IEEE Trans. Pattern Anal. Machine Intel. PAMI-2(1) 1990,1-8.
• [3] S.K.De. R.Biswas and A.R.Roy, Finding dependency of attributes in information system, Jou. of Fuzzy Math, 7(2) 1999, 335 -344.
• [4] S.K.De and P.Radhakrishna, Clustering Web Transactions using Rough approximation, to appear in: Fuzzy Sets and Systems.
• [5] D.Dubois and H.Prade, Putting Rough Sets and Fuzzy Sets Together, Intelligent Decision Support-Handbook of Applications and Advances ofthe Rough Set Theory, R.Slowinski, ed., Kluwer Academic, 1992,203-232.
• [6] S.Greco, B.Matarazzo and R.Slowinski, Rough set processing of vague information using fuzzy similarity relations, in: C.S.Calude, G.Paun(Eds.), Finite versus Infinite Contributions to an Eternal Dilemma, Springer, London, 2000,149-173.
• [7] Shoji Hirano and Shusaku Tsumoto, An Indiscemibility-Based Clustering Method With Iterative Retinement of Equivalence Relations, In proceedings of the 7th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD), Cavtat-Dubrovnik, Croatia, September 22-26, 2003; Lecture Notes in Computer Science, Springer-Verlag Heidelberg, 2838 (2003), 192-203.
• [8] Shoji Hirano and Shusaku Tsumoto, Indiscemibility-Based Clustering : Rough Clustering, IFSA 2003, Lecture Notes in Computer Science, Springer-Verlag Heidelberg, 2715 (2003), 378-386.
• [9] Marzena Kryszkiewicz, Rough Set Approach to Incomplete Information Systems, Information Sciences 112(1-4), (1998), 39-49.
• [10] Pawan Lingras, R.Yan and A.Jain, Web Usage Mining: Comparison of Conventional, Fuzzy, and Rough Set Clustering, to appear in: Y. Zhang and Y. Yao (Eds.), Computational Web Intelligence: Intelligent Technology for Web Applicatios.
• [11] Pawan Lingras and C.West, Interval Set Clustering of Web Users with Rough K-means, Journal of Intelligent Information System, 23(1), (2004) 5-16.
• [12] Pawan Lingras and Y.Y.Yao, Time Complexity of Rough Clustering: GAs versus K-Means, In Proceedings of the Third International Conference on RSCTC, Malvem, PA, USA October 14-16, 2002; Lecture Notes in Computer Science, J.J.Alpigani, J.FPeters, A.Skowron and N.Zhong (Eds.) 2475 (2002) 263-270.
• [13] Sankar K. Pal and Pabitra Mitra, Case Generation Using Rough Sets With Fuzzy Representation, IEEE Trans, on Knowledge and Data Engineering, 16(3), 2004, 292-300.
• [14] S.K.Pal and A.Skowron, Eds., Rough Fuzzy Hybridization: New Trends in Decision Making, Springer Verlag, Singapore: 1999.
• [15] Z.Pawlak, Rough Sets, Int. Jl. Computer and Information Science, 11, (1982) 341-356.
• [16] Z.Pawlak, Rough Sets - Theoretical Aspects of Reasoning about data, Kluwer Academic, 1991.
• [17] L.Polkowski, A Skowron and J.Zytkow, Tolerance based rough sets. Soft Computing: Rough Sets, Fuzzy Logic, Neural Networks and Uncertainty Management, T.Y.Lin and A.M.Wildberger, eds., San Diego: Simulations Councils, Inc., 1995, 55-58.
• [18] E.H.Ruspini, A new approach to clustering. Inform, and Control, 15 (1969) 22-32.
• [19] M.Sarkar, Rough-fuzzy function in classification. Fuzzy Sets and Systems, 132, (2002), 353-369.
• [20] S.Shenoi and A.Melton, Proximity relations in the fuzzy relational database model. Fuzzy Sets and Systems, 31(1989), 285-296.
• [21] R.Slowinski and D.Vanderpooten, Similarity Relations as a basis for Rough Approximations, ICS Research Report 53/95, Warsaw University Technology, 1995.
• [22] R.Slowinski and D.Vanderpooten, A generalized definition of rough approximations based on similarity, IEEE Transactions on Knowledge and Data Engineering, Vol. 12(2), (2000) 331-333.
• [23] S.Tamura, S.Higuchi and K.Tanaka, Pattern classification based on fuzzy relations, IEEE Trans. Systems Man Cybernet. 1 (1978) 61-66,.
• [24] I.Tentush, On Minimal Absorbent Sets for Some Types of Tolerance Relations, Bulletin of Polish Academy of Sciences, Vol. 43( 1),(1995) 79-88,.
• [25] E.Trauwaert, L.Kaufman and P.Rousseeuw, Fuzzy clustering algorithms based on the maximum likelihood principle. Fuzzy Sets and Systems, 42 (1991) 213-227,.
• [26] M.S.Yang, A survey of fuzzy clustering. Math. Comput. Modelling, 18, (1993) 1-16.
• [27] M.S.Yang and H.M.Shih, Cluster analysis based on fuzzy relations, 120 (2001) 197-212,.
• [28] L.A.Zadeh, Similarity relations and fuzzy ordering. Inform. Science, 3 (1971) 177-20L
• [29] L.A Zadeh, Fuzzy Sets, Inform Control 8 (1965) 338-353.