Objective function-based rough membership C-means clustering

Abstract Hard C-means (HCM) is one of the most widely used partitive clustering methods and was extended to rough C-means (RCM) by referencing to the perspective of rough set theory to deal with the certain, possible, and uncertain belonging of object to clusters. Furthermore, rough set C-means (RSCM) and rough membership C-means (RMCM) have been proposed as clustering models on an approximation space considering the granularity of the universe (object space) based on binary relations. Although these rough set-based C-means methods are practical, they are not formulated based on objective functions, but are built on heuristic schemes. Objective function-based methods can be a basis for discussion of the validity of clustering and further theoretical developments. In this paper, we propose a novel RMCM framework, which is called RMCM version 2 (RMCM2), based on an objective function. The objective function is designed to derive the same updating rule for cluster centers as in RMCM. We demonstrate the characteristics of RMCM2 by visualizing cluster boundaries on a grid point dataset. Furthermore, we verify the clustering performance of RMCM2 through numerical experiments by using real-world datasets.

[1]  Supriya Kumar De.  A Rough Set Theoretic Approach to Clustering , 2004, Fundam. Informaticae.

[2]  C.-C. Jay Kuo,et al.  A new initialization technique for generalized Lloyd iteration , 1994, IEEE Signal Processing Letters.

[3]  Sankar K. Pal,et al.  RFCM: A Hybrid Clustering Algorithm Using Rough and Fuzzy Sets , 2007, Fundam. Informaticae.

[4]  Pradipta Maji,et al.  Rough-probabilistic clustering and hidden Markov random field model for segmentation of HEp-2 cell and brain MR images , 2016, Appl. Soft Comput..

[5]  J. C. Dunn,et al.  A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters , 1973 .

[6]  Seiki Ubukata,et al.  A unified approach for cluster-wise and general noise rejection approaches for k-means clustering , 2019, PeerJ Comput. Sci..

[7]  Richard Weber,et al.  Soft clustering - Fuzzy and rough approaches and their extensions and derivatives , 2013, Int. J. Approx. Reason..

[8]  Thomas H. Davenport,et al.  Book review:Working knowledge: How organizations manage what they know. Thomas H. Davenport and Laurence Prusak. Harvard Business School Press, 1998. $29.95US. ISBN 0‐87584‐655‐6 , 1998 .

[9]  James C. Bezdek,et al.  Pattern Recognition with Fuzzy Objective Function Algorithms , 1981, Advanced Applications in Pattern Recognition.

[10]  Sankar K. Pal,et al.  Rough Set Based Generalized Fuzzy $C$ -Means Algorithm and Quantitative Indices , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[11]  Qinghua Hu,et al.  Neighborhood classifiers , 2008, Expert Syst. Appl..

[12]  Witold Pedrycz,et al.  Rough–Fuzzy Collaborative Clustering , 2006, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[13]  Georg Peters,et al.  Some refinements of rough k-means clustering , 2006, Pattern Recognit..

[14]  J. Keynes.  A Treatise on Probability. , 1923 .

[15]  Sankar K. Pal,et al.  Rough-Fuzzy C-Medoids Algorithm and Selection of Bio-Basis for Amino Acid Sequence Analysis , 2007, IEEE Transactions on Knowledge and Data Engineering.

[16]  Pawan Lingras,et al.  Interval Set Clustering of Web Users with Rough K-Means , 2004, Journal of Intelligent Information Systems.

[17]  Georg Peters,et al.  Rough clustering utilizing the principle of indifference , 2014, Inf. Sci..

[18]  Qinghua Hu,et al.  Neighborhood rough set based heterogeneous feature subset selection , 2008, Inf. Sci..

[19]  Shusaku Tsumoto,et al.  An Indiscernibility-Based Clustering Method with Iterative Refinement of Equivalence Relations -Rough Clustering- , 2003, Journal of Advanced Computational Intelligence and Intelligent Informatics.

[20]  Z. Pawlak,et al.  Rough membership functions , 1994 .

[21]  Zdzislaw Pawlak,et al.  Rough classification , 1984, Int. J. Hum. Comput. Stud..

[22]  Katsuhiro Honda,et al.  Rough Set-Based Clustering Utilizing Probabilistic Memberships , 2018, J. Adv. Comput. Intell. Intell. Informatics.

[23]  P. Laplace.  A Philosophical Essay On Probabilities , 1902 .

[24]  J. MacQueen.  Some methods for classification and analysis of multivariate observations , 1967 .

[25]  Sergei Vassilvitskii,et al.  k-means++: the advantages of careful seeding , 2007, SODA '07.

[26]  Zdzis?aw Pawlak,et al.  Rough sets , 2005, International Journal of Computer & Information Sciences.

[27]  Georg Peters,et al.  Is there any need for rough clustering? , 2015, Pattern Recognit. Lett..

[28]  Pradipta Maji,et al.  Circular Clustering in Fuzzy Approximation Spaces for Color Normalization of Histological Images , 2019, IEEE Transactions on Medical Imaging.

[29]  Z. Pawlak,et al.  Rough membership functions: a tool for reasoning with uncertainty , 1993 .

[30]  Z. Pawlak.  Rough set approach to knowledge-based decision support , 1997 .

[31]  Katsuhiro Honda,et al.  Characteristics of Rough Set C-Means Clustering , 2018, J. Adv. Comput. Intell. Intell. Informatics.

[32]  Katsuhiro Honda,et al.  The Rough Membership k-Means Clustering , 2016, IUKM.

[33]  Katsuhiro Honda,et al.  The Rough Set k-Means Clustering , 2016, 2016 Joint 8th International Conference on Soft Computing and Intelligent Systems (SCIS) and 17th International Symposium on Advanced Intelligent Systems (ISIS).