Abstract
Soft clustering can be regarded as a cognitive computing method that seeks to deal with the clustering with fuzzy boundary. As a classical soft clustering algorithm, rough k-means (RKM) has yielded various extensions. However, some challenges remain in existing RKM extensions. On the one hand, the user-defined cutoff threshold is subjective and cannot be changed during iteration. On the other hand, the weight of the object to the cluster center is calculated by membership grade and a subjective parameter, that is, the fuzzifier, which complicates the issue and reduces the robustness of the algorithm. In this paper, inspired by human cognition of distance stability, an adaptive three-way c-means algorithm is proposed. First, in human cognition, objects are clustered according to the stability of their distance to the clusters, and variance is an effective way to measure the stability of data. Based on this, an adaptive cutoff threshold is introduced by determining the maximum increment between the variances of distance. Second, based on the cognition that distance is inversely proportional to weight, the weight equation is defined by distance without introducing any subjective parameters. Then, combined with the adaptive cutoff threshold and weight equation, A-3WCM is proposed. The experimental results show that A-3WCM exhibits excellent performance and outperforms five representative algorithms related to RKM on nine popular datasets.
Similar content being viewed by others
References
Squartini S, Schuller B, Hussain A. Cognitive and emotional information processing for human-machine interaction. Cogn Comput. 2012;4(4):383–5.
Hussain A. Cognitive computation: an introduction. Cogn Comput. 2009;1(1):1–3.
Anna E, Alessandro V, Simon H, Amir H, Marcos FZ. Cognitive computation special issue on cognitive behavioural systems. Cogn Comput. 2011;3(3):417–8.
Wu XD, Zhu XQ, Wu GQ. Data mining with big data. IEEE Trans Knowl Data Eng. 2014;26(1):97–107.
Jain AK. Data clustering: 50 years beyond k-means. Pattern Recognit Lett. 2010;31(8):651–66.
Abdullah A, Hussain A. A cognitively inspired approach to two-way cluster extraction from one-way clustered data. Cogn Comput. 2015;7(1):161–82.
Huang JJ, Chen W, Liu A, Wang WQ, Yin HZ, Zhao L. Cluster query: a new query pattern on temporal knowledge graph. World Wide Web. 2020;23(2):755–79.
Bian XY, Zhang TX, Zhang XL, Yan LX, Li B. Clustering-based extraction of near border data samples for remote sensing image classification. Cogn Comput. 2013;23(5):19–31.
Shama A, Phadikar S. Automatic color image segmentation using spatial constraint based clustering. Lecture Notes in Electrical Engineering. 2014;298:113–21.
Thanh ND, Ali M, Son LH. A novel clustering algorithm in a neutrosophic recommender system for medical diagnosis. Cogn Comput. 2017;9(4):526–44.
Zadeh LA. Fuzzy sets. Int J Innov Comp Inf Control. 1965;8(3):338–53.
Pawlak Z. Rough sets. Int J Comput Inf Sci. 1982;11(5):341–56.
Dou HL, Yang XB, Song XN, Yu HL, Wu WZ, Yang JY. Decision-theoretic rough set: A multicost strategy. Knowledge-Based Syst. 2016;91:71–83.
Yao YY. Three-way decisions with probabilistic rough sets. Inf Sci. 2010;180(3):341–53.
Yao YY. The superiority of three-way decisions in probabilistic rough set models. Inf Sci. 2011;181(6):1080–96.
Yao YY. An outline of a theory of three-way decisions. In: Rough Sets and Current Trends in Computing-8th International Conference. 2012;1-17.
Yao YY. Rough sets and three-way decisions. In: Proceeding of the 10th International Conference on Rough Sets and Knowledge Technology. 2015;62-73.
Yao YY. Three-way decisions and cognitive computing. Cogn Comput. 2016;8(4):543–54.
Yang X, Liu D, Yang XB, Liu Ky, Li TR. Incremental fuzzy probability decision-theoretic approaches to dynamic three-way approximations. Inf. Sci. 2021;550:71-90.
Ju HR, Ding WP, Yang XB, Fujita H, Xu SP. Robust supervised rough granular description model with the principle of justifiable granularity. Appl Soft Comput. 2021;110.
Ju HR, Pedrycz W, Li HX, Ding WP, Yang XB, Zhou XZ. Sequential three-way classifier with justifiable granularity. Knowledge-Based Syst. 2019;163:103–19.
Pierpaolo D, Urso. Informational Paradigm, management of uncertainty and theoretical formalisms in the clustering framework: A review. Inf. Sci. 2017;400:30-62.
Peters G, Crespo F, Lingras P, Weber R. Soft clustering - Fuzzy and rough approaches and their extensions and derivatives. Int J Approx Reasoning. 2013;54(2):307–22.
Yu H, Chen LY, Yao JT, Wang XN. A three-way clustering method based on an improved DBSCAN algorithm. Physica A. 2019;535.
Yu H, Chen LY, Yao JT. A three-way density peak clustering method based on evidence theory. Knowledge-Based Syst. 2021;211.
Evangelos S, Han JW, Usama M. A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceeding of 2nd International Conference on Knowledge Discovery and Data Mining. 1996;226-231.
Rodriguez A, Alessandro L. Clustering by fast search and find of density peaks. Science. 2014;344(6191):1492–6.
Liu R, Wang H, Yu XM. Shared-nearest-neighbor-based clustering by fast search and find of density peaks. Inf Sci. 2018;450:200–26.
Steinley D. K-means clustering: a half-century synthesis. Br J Math Stat Psychol. 2006;59(1):1–34.
MacQueen J. Some methods for classification and analysis of multivariate observations. In: Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability. 1967;281-297.
Lloyd S. Least squares quantization in PCM. IEEE Trans Inf Theory. 1982;28(2):129–37.
Bezdek JC. Pattern Recognition with Fuzzy Objective Function Algorithm. New York: Plenum; 1981.
Lingras P, West C. Interval set clustering of web users with rough k-means. J Intell Inf Syst. 2004;23(1):5–16.
Zhang TF, Ma FM. Improved rough k-means clustering algorithm based on weighted distance measure with Gaussian function. Int J Comput Math. 2017;94(4):663–75.
Mitra S, Banka H, Pedrycz W. Rough-Fuzzy collaborative clustering. IEEE Trans Syst Man Cybern -Syst. 2006;36(4):795–805.
Peters G. Rough clustering utilizing the principle of indifference. Inf Sci. 2014;277:358–74.
Zhang K. A three-way c-means algorithm. Appl Soft Comput. 2019;82.
Peters G. Some refinements of rough k-means clustering. Patt Recogn. 2006;39(8):1481–91.
Afridi MK, Azam N, Yao JT. Variance based three-way clustering approaches for handling overlapping clustering. Int J Approx Reasoning. 2020;118:47–63.
Lingras P, Peters G. Rough clustering. Wiley Interdiscip. Rev.-Data Mining Knowl. Discov. 2011;1(1):64-72.
Lingras P, Peters G. Applying Rough Set Concepts to Clustering. In: Peters G, Lingras P, Slezak D, Yao Y, editors. Rough Sets: Selected Methods and Applications in Management and Engineering. London: Springer; 2012. p. 23–37.
Maji P, Pal SK. RFCM: a hybrid clustering algorithm using rough and fuzzy sets. Fundam Inform. 2007;80(4):475–96.
Yu H. A framework of three-way cluster analysis. In: Rough Sets-International Joint Conference. 2017;300-312.
Yu H, Jiao P, Yao YY, Wang GY. Detecting and refining overlapping regions in complex networks with three-way decisions. Inf Sci. 2016;373:21–41.
Yu H, Zhang C, Wang GY. A tree-based incremental overlapping clustering method using the three-way decision theory. Knowledge-Based Syst. 2016;91:189–203.
Munusamy S, Murugesan P. Performance-enhanced rough k-means clustering algorithm. Soft Comput. 2021;25:1595–616.
Yu H, Wang XC, Wang GY, Zeng X. An active three-way clustering method via low-rank matrices for multi-view data. Inf Sci. 2020;507:823–39.
Wang PX, Shi H, Yang XB, Mi JS. Three-way k-means: integrating k-means and three-way decision. Int J Mach Learn Cybern. 2019;10(10):2767–77.
Wang PX, Yao YY. CE3: A three-way clustering method based on mathematical morphology. Knowledge-Based Syst. 2018;155:54–65.
Wang M, Min F, Zhang ZH, Wu YX. Active learning through density clustering. Expert Syst Appl. 2017;85:305–17.
Gionis A, Mannila H, Tsaparas P. Clustering aggregation. ACM Trans Knowl Discov Dat. 2007;1(1):1–30.
Veenman CJ, Reinders MJT, Backer E. A maximum variance cluster algorithm. IEEE Trans Pattern Anal Mach Intell. 2002;24(9):1273–80.
Acknowledgements
This work was supported by the National Key Research and Development Program of China (No. 2020YFC2003502), the National Natural Science Foundation of China (No. 61876201), Natural Science Foundation of Chongqing (No. cstc2019jcyj-cxttX0002, No. cstc2021ycjh-bgzxm0013), the Doctoral Talent Training Program of Chongqing University of Posts and Telecommunications (No. BYJS201907), and the key cooperation project of chongqing municipal education commission (No. HZ2021008).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Ethical Approval
This article does not contain any studies with human participants or animals performed by any of the authors.
Conflict of Interest
The authors declare that they have no conflict of interest.
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Shen, Q., Zhang, Q., Zhao, F. et al. Adaptive Three-Way C-Means Clustering Based on the Cognition of Distance Stability. Cogn Comput 14, 563–580 (2022). https://doi.org/10.1007/s12559-021-09965-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12559-021-09965-z