On Rough Set Based Non Metric Model
Non metric model is a kind of clustering method in which belongingness or the membership grade of each object to each cluster is calculated directly from dissimilarities between objects and cluster centers are not used.
By the way, the concept of rough set is recently focused. Conventional clustering algorithms classify a set of objects into some clusters with clear boundaries, that is, one object must belong to one cluster. However, many objects belong to more than one cluster in real world, since the boundaries of clusters overlap with each other. Fuzzy set representation of clusters makes it possible for each object to belong to more than one cluster. On the other hand, the fuzzy degree sometimes may be too descriptive for interpreting clustering results. Rough set representation could handle such cases. Clustering based on rough set representation could provide a solution that is less restrictive than conventional clustering and less descriptive than fuzzy clustering.
This paper shows two type of Rough set based Non Metric model (RNM). One algorithm is Rough set based Hard Non Metric model (RHNM) and the other is Rough set based Fuzzy Non Metric model (RFNM). In the both algorithms, clusters are represented by rough sets and each cluster consists of lower and upper approximation. Second, the proposed methods are kernelized by introducing kernel functions which are a powerful tool to analize clusters with nonlinear boundaries
KeywordsKernel Function Cluster Center Lower Approximation High Dimensional Feature Space Membership Grade
Unable to display preview. Download preview PDF.
- 2.Bezdek, J.C., Keller, J., Krisnapuram, R., Pal, N.R.: Fuzzy Models and Algorithms for Pattern Recognition and Image Processing. The Handbooks of Fuzzy Sets Series (1999)Google Scholar
- 4.Bezdek, J.C., Davenport, J.W., Hathaway, R.J.: Clustering with the Relational c-Means Algorithms using Different Measures of Pairwise Distance. In: Juday, R.D. (ed.) Proceedings of the 1988 SPIE Technical Symposium on Optics, Electro-Optics, and Sensors, vol. 938, pp. 330–337 (1988)Google Scholar
- 6.Endo, Y.: On Entropy Based Fuzzy Non Metric Model –Proposal, Kernelization and Pairwise Constraints. Journal of Advanced Computational Intelligence and Intelligent Informatics 16(1), 169–173 (2012)Google Scholar
- 7.Lingras, P., Peters, G.: Rough clustering. In: Proceedings of the 17th International Conference on Machine Learning (ICML 2000), pp. 1207–1216 (2011)Google Scholar
- 11.Hirano, S., Tsumoto, S.: An Indiscernibility-Based Clustering Method with Iterative Refinement of Equivalence Relations. Journal of Advanced Computational Intelligence and Intelligent Informatics 7(2), 169–177 (2003)Google Scholar
- 17.Miyamoto, S., Mukaidono, M.: Fuzzy c-Means as a Regularization and Maximum Entropy Approach. In: Proc. of the 7th International Fuzzy Systems Association World Congress (IFSA 1997), vol. 2, pp. 86–92 (1997)Google Scholar
- 18.Miyamoto, S., Umayahara, K., Mukaidono, M.: Fuzzy Classification Functions in the Methods of Fuzzy c-Means and Regularization by Entropy. Journal of Japan Society for Fuzzy Theory and Systems 10(3), 548–557 (1998)Google Scholar
- 21.Endo, Y., Haruyama, H., Okubo, T.: On Some Hierarchical Clustering Algorithms Using Kernel Functions. In: IEEE International Conference on Fuzzy Systems, #1106 (2004)Google Scholar
- 23.Miyamoto, S., Kawasaki, Y., Sawazaki, K.: An Explicit Mapping for Fuzzy c-Means Using Kernel Function and Application to Text Analysis. In: IFSA/EUSFLAT 2009 (2009)Google Scholar