{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:15:07Z","timestamp":1760242507281,"version":"build-2065373602"},"reference-count":57,"publisher":"MDPI AG","issue":"10","license":[{"start":{"date-parts":[[2017,9,28]],"date-time":"2017-09-28T00:00:00Z","timestamp":1506556800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>Closeness measures are crucial to clustering methods. In most traditional clustering methods, the closeness between data points or clusters is measured by the geometric distance alone. These metrics quantify the closeness only based on the concerned data points\u2019 positions in the feature space, and they might cause problems when dealing with clustering tasks having arbitrary clusters shapes and different clusters densities. In this paper, we first propose a novel Closeness Measure between data points based on the Neighborhood Chain  (CMNC). Instead of using geometric distances alone, CMNC measures the closeness between data points by quantifying the difficulty for one data point to reach another through a chain of neighbors. Furthermore, based on CMNC, we also propose a clustering ensemble framework that combines CMNC and geometric-distance-based closeness measures together in order to utilize both of their advantages. In this framework, the \u201cbad data points\u201d that are hard to cluster correctly are identified; then different closeness measures are applied to different types of data points to get the unified clustering results. With the fusion of different closeness measures, the framework can get not only better clustering results in complicated clustering tasks, but also higher efficiency.<\/jats:p>","DOI":"10.3390\/s17102226","type":"journal-article","created":{"date-parts":[[2017,9,28]],"date-time":"2017-09-28T11:22:44Z","timestamp":1506597764000},"page":"2226","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Clustering-Oriented Closeness Measure Based on Neighborhood Chain and Its Application in the Clustering Ensemble Framework Based on the Fusion of Different Closeness Measures"],"prefix":"10.3390","volume":"17","author":[{"given":"Shaoyi","family":"Liang","sequence":"first","affiliation":[{"name":"MOE KLINNS Lab, Institute of Integrated Automation, School of Electronic and Information Engineering, Xi\u2019an Jiaotong University, Xi\u2019an 710049, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5603-796X","authenticated-orcid":false,"given":"Deqiang","family":"Han","sequence":"additional","affiliation":[{"name":"MOE KLINNS Lab, Institute of Integrated Automation, School of Electronic and Information Engineering, Xi\u2019an Jiaotong University, Xi\u2019an 710049, China"}]}],"member":"1968","published-online":{"date-parts":[[2017,9,28]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Bhatti, D.M.S., Saeed, N., and Nam, H. (2016). Fuzzy C-Means Clustering and Energy Efficient Cluster Head Selection for Cooperative Sensor Network. Sensors, 16.","DOI":"10.3390\/s16091459"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Tang, C., Shokla, S.K., Modhawar, G., and Wang, Q. (2016). An Effective Collaborative Mobile Weighted Clustering Schemes for Energy Balancing in Wireless Sensor Networks. Sensors, 16.","DOI":"10.3390\/s16020261"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"8314","DOI":"10.3390\/s150408314","article-title":"Cross-Layer Cluster-Based Energy-Efficient Protocol for Wireless Sensor Networks","volume":"15","author":"Mammu","year":"2015","journal-title":"Sensors"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"29997","DOI":"10.3390\/s151229786","article-title":"Node Non-Uniform Deployment Based on Clustering Algorithm for Underwater Sensor Networks","volume":"15","author":"Jiang","year":"2015","journal-title":"Sensors"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"3990","DOI":"10.1109\/TIP.2015.2456505","article-title":"Incorporating Adaptive Local Information Into Fuzzy Clustering for Image Segmentation","volume":"24","author":"Liu","year":"2015","journal-title":"IEEE Trans. Image Proc."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1917","DOI":"10.1016\/j.patcog.2013.11.014","article-title":"Robust level set image segmentation via a local correntropy-based K-means clustering","volume":"47","author":"Wang","year":"2014","journal-title":"Pattern Recognit."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"2454","DOI":"10.1016\/j.patcog.2014.01.017","article-title":"Robust spatially constrained fuzzy c-means algorithm for brain MR image segmentation","volume":"47","author":"Ji","year":"2014","journal-title":"Pattern Recognit."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1144","DOI":"10.1109\/TSMCA.2011.2113334","article-title":"Analyzing and Visualizing Web Opinion Development and Social Interactions With Density-Based Clustering","volume":"41","author":"Yang","year":"2011","journal-title":"IEEE Trans. Syst. Man Cybern. Part A"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"2287","DOI":"10.1109\/TCYB.2014.2370063","article-title":"Biclustering Learning of Trading Rules","volume":"45","author":"Huang","year":"2015","journal-title":"IEEE Trans. Cybern."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1109\/TKDE.2015.2496345","article-title":"Subspace Based Network Community Detection Using Sparse Linear Coding","volume":"28","author":"Mahmood","year":"2016","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1424","DOI":"10.1109\/TASL.2013.2253098","article-title":"Ranking Through Clustering: An Integrated Approach to Multi-Document Summarization","volume":"21","author":"Cai","year":"2013","journal-title":"IEEE Trans. Audio Speech Language Proc."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"1575","DOI":"10.1109\/TKDE.2013.19","article-title":"A Similarity Measure for Text Classification and Clustering","volume":"26","author":"Lin","year":"2014","journal-title":"IEEE Trans. Knowl. and Data Eng."},{"key":"ref_13","first-page":"281","article-title":"Some methods for classification and analysis of multivariate observations","volume":"1","author":"MacQueen","year":"1967","journal-title":"Proc. 5th Berkeley Symp. Math. Statist. Probabil."},{"key":"ref_14","unstructured":"Ester, M., Kriegel, H.P., and Xu, X. (1996, January 2\u20134). A density-based algorithm for discovering clusters in large spatial databases with noise. Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, Portland, Oregon."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0306-4379(01)00008-4","article-title":"Cure: An Efficient Clustering Algorithm for Large Databases","volume":"26","author":"Guha","year":"2001","journal-title":"Inf. Syst."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"2505","DOI":"10.1016\/j.patcog.2014.01.015","article-title":"The MinMax k-Means clusteringalgorithm","volume":"47","author":"Tzortzis","year":"2014","journal-title":"Pattern Recognit."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"3376","DOI":"10.1016\/j.patcog.2014.03.034","article-title":"K-means*: Clustering by gradual data transformation","volume":"47","author":"Malinen","year":"2014","journal-title":"Pattern Recognit."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.patcog.2016.03.008","article-title":"A fast DBSCAN clustering algorithm by accelerating neighbor searching using Groups method","volume":"58","author":"Kumar","year":"2016","journal-title":"Pattern Recognit."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"1478","DOI":"10.1016\/j.patcog.2014.10.003","article-title":"Cluster validity measure and merging system for hierarchical clustering considering outliers","volume":"48","author":"Morsier","year":"2015","journal-title":"Pattern Recognit."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"2031","DOI":"10.1016\/j.patcog.2013.11.019","article-title":"Asymmetric clustering using the alpha-beta divergence","volume":"47","author":"Olszewski","year":"2014","journal-title":"Pattern Recognit."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"3046","DOI":"10.1016\/j.patcog.2014.03.006","article-title":"Cross-entropy clustering","volume":"47","author":"Tabor","year":"2014","journal-title":"Pattern Recognit."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1227","DOI":"10.1016\/j.patcog.2012.11.017","article-title":"PHA: A fast potential-based hierarchical agglomerative clustering method","volume":"46","author":"Lu","year":"2013","journal-title":"Pattern Recognit."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1016\/j.patcog.2015.09.027","article-title":"Soft subspace clustering of categorical data with probabilistic distance","volume":"51","author":"Chen","year":"2016","journal-title":"Pattern Recognit."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/2.781637","article-title":"Chameleon: A Hierarchical Clustering Using Dynamic Modeling","volume":"32","author":"Karypis","year":"1999","journal-title":"Computer"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1109\/TKDE.2011.221","article-title":"Clustering Uncertain Data Based on Probability Distribution Similarity","volume":"25","author":"Jiang","year":"2013","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_26","unstructured":"Jain, A.K., and Dubes, R.C. (1988). Algorithms for Clustering Data, Prentice Hall."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"583","DOI":"10.3233\/IDA-2007-11602","article-title":"An overview of clustering methods","volume":"11","author":"Omran","year":"2007","journal-title":"Intell. Data Anal."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1109\/TKDE.2005.21","article-title":"Combining Partitional and Hierarchical Algorithms for Robust and Efficient Data Clustering with Cohesion Self-Merging","volume":"17","author":"Lin","year":"2005","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Dhillon, I.S., Maella, S., and Kumar, R. (2002, January 23\u201326). Enhanced word clustering for hierarchical text classification. Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Edmonton, AB, Canada.","DOI":"10.1145\/775047.775076"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1214\/aoms\/1177729694","article-title":"On Information and Sufficiency","volume":"22","author":"Kullback","year":"1951","journal-title":"Ann. Math. Stat."},{"key":"ref_31","first-page":"1265","article-title":"A divisive information-theoretic feature clustering algorithm for text classification","volume":"3","author":"Dhillon","year":"2003","journal-title":"J. Mach. Learn. Res."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Dhillon, I.S., Maella, S., and Kumar, R. (2003, January 24\u201327). Information-theoretic co-clustering. Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA.","DOI":"10.1145\/956750.956764"},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Heller, K.A., and Ghahramani, Z. (2005, January 7\u201311). Bayesian hierarchical clustering. Proceedings of the 22nd International Conference on Machine Learning, Bonn, Germany.","DOI":"10.1145\/1102351.1102389"},{"key":"ref_34","unstructured":"Teh, Y.W., Lii, H.D., and Roy, D. (,  2007). Bayesian Agglomerative Clustering with Coalescents. Proceedings of the International Conference on Neural Information Processing Systems, Kitakyushu, Japan."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1109\/TPAMI.2006.57","article-title":"Isoperimetric graph partitioning for image segmentation","volume":"28","author":"Grady","year":"2006","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1109\/TPAMI.2007.250608","article-title":"Dominant sets and pairwise clustering","volume":"29","author":"Pavan","year":"2007","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"3056","DOI":"10.1016\/j.patcog.2013.04.013","article-title":"Agglomerative clustering via maximum incremental path integral","volume":"46","author":"Zhang","year":"2013","journal-title":"Pattern Recognit."},{"key":"ref_38","first-page":"208","article-title":"Adaptive density peak clustering based on K-nearest neighbors with aggregating strategy","volume":"113","author":"Liu","year":"2017","journal-title":"Knowl.-Based Syst."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"1492","DOI":"10.1126\/science.1242072","article-title":"Clustering by fast search and find of density peaks","volume":"344","author":"Rodriguez","year":"2014","journal-title":"Science"},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Sur, A., Chowdhury, A., Chowdhury, J.G., and Das, S. (,  2013). Automatic Clustering Based on Cluster Nearest Neighbor Distance (CNND) Algorithm. Proceedings of the International Conference on Frontiers of Intelligent Computing: Theory and Applications (FICTA), Bhubaneswar, India.","DOI":"10.1007\/978-3-642-35314-7_22"},{"key":"ref_41","unstructured":"Qiu, T., Yang, K., Li, C., and Li, Y. (2017, September 25). A Physically Inspired Clustering Algorithm: To Evolve Like Particles. Available online: https:\/\/arxiv.org\/abs\/1412.5902."},{"key":"ref_42","unstructured":"Qiu, T., and Li, Y. (2017, September 25). Clustering by Descending to the Nearest Neighbor in the Delaunay Graph Space. Available online: https:\/\/arxiv.org\/abs\/1502.04502."},{"key":"ref_43","unstructured":"Qiu, T., and Li, Y. (2017, September 25). IT-Dendrogram: A New Member of the In-Tree (IT) Clustering Family. Available online: https:\/\/arxiv.org\/abs\/1507.08155."},{"key":"ref_44","unstructured":"Qiu, T., and Li, Y. (2017, September 25). Clustering by Deep Nearest Neighbor Descent (D-NND): A Density-based Parameter-Insensitive Clustering Method. Available online: https:\/\/arxiv.org\/abs\/1512.02097."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"1271","DOI":"10.1016\/j.datak.2009.06.007","article-title":"Text document clustering based on neighbors","volume":"68","author":"Luo","year":"2009","journal-title":"Data Knowl. Eng."},{"key":"ref_46","doi-asserted-by":"crossref","unstructured":"Nie, F., Wang, X., and Huang, H. (2014, January 24\u201327). Clustering and projected clustering with adaptive neighbors. Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining, New York, NY, USA.","DOI":"10.1145\/2623330.2623726"},{"key":"ref_47","doi-asserted-by":"crossref","unstructured":"Liang, S.Y., Han, D.Q., Zhang, L., and Peng, Q.K. (2017, January 14\u201319). A Novel Clustering Oriented Closeness Measure Based on Neighborhood Chain. Proceedings of the 2017 International Joint Conference on Neural Networks, Anchorage, AK, USA.","DOI":"10.1109\/IJCNN.2017.7965961"},{"key":"ref_48","unstructured":"Kaufmann, L., and Rousseeuw, P.J. (1987). Clustering by Means of Medoids. Statistical Data Analysis Based on the L1-norm & Related Methods, Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co."},{"key":"ref_49","unstructured":"Sneath, P., and Sokal, R. (1973). Numerical Taxonomy, Freeman."},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1145\/304181.304187","article-title":"OPTICS: Ordering Points To Identify the Clustering Structure","volume":"28","author":"Ankerst","year":"1999","journal-title":"ACM Sigmod Rec."},{"key":"ref_51","first-page":"1","article-title":"Data clustering: A user\u2019s dilemma","volume":"3776","author":"Jain","year":"2005","journal-title":"Comput. Sci."},{"key":"ref_52","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/T-C.1971.223083","article-title":"Graph-theoretical methods for detecting and describing gestalt clusters","volume":"100","author":"Zahn","year":"1971","journal-title":"IEEE Trans. Comput."},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/j.patcog.2007.04.010","article-title":"Robust path-based spectral clustering","volume":"41","author":"Chang","year":"2008","journal-title":"Pattern Recognit."},{"key":"ref_54","unstructured":"Blake, C., and Merz, C.J. (2017, May 20). UCI Repository of Machine Learning Databases. Available online: http:\/\/www\/ics.uci.edu\/mlearn\/MLRepository.html."},{"key":"ref_55","first-page":"583","article-title":"Cluster Ensembles\u2014A Knowledge Reuse Framework for Combining Multiple Partitions","volume":"3","author":"Strehl","year":"2002","journal-title":"J. Mach. Learn. Res."},{"key":"ref_56","unstructured":"Wu, M.R., and Scholk\u00f6pf, B. (,  2006). A Local Learning Approach for Clustering. Proceedings of the 20th Annual Conference on Neural Information Processing Systems, Vancouver, BC, Canada."},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/2331554","article-title":"The Probable Error of a Mean","volume":"6","author":"Gosset","year":"1908","journal-title":"Biometrika"}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/17\/10\/2226\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T18:46:11Z","timestamp":1760208371000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/17\/10\/2226"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,28]]},"references-count":57,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2017,10]]}},"alternative-id":["s17102226"],"URL":"https:\/\/doi.org\/10.3390\/s17102226","relation":{},"ISSN":["1424-8220"],"issn-type":[{"type":"electronic","value":"1424-8220"}],"subject":[],"published":{"date-parts":[[2017,9,28]]}}}