{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,13]],"date-time":"2026-10-13T16:19:09Z","timestamp":1791908349735,"version":"4.3.4"},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"21-23","license":[{"start":{"date-parts":[[2021,7,29]],"date-time":"2021-07-29T00:00:00Z","timestamp":1627516800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,7,29]],"date-time":"2021-07-29T00:00:00Z","timestamp":1627516800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Multimed Tools Appl"],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1007\/s11042-021-11171-w","type":"journal-article","created":{"date-parts":[[2021,7,28]],"date-time":"2021-07-28T23:04:12Z","timestamp":1627513452000},"page":"32379-32407","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["A neighborhood-based three-stage hierarchical clustering algorithm"],"prefix":"10.1007","volume":"80","author":[{"given":"Yan","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4626-1401","authenticated-orcid":false,"given":"Yan","family":"Ma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hui","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,7,29]]},"reference":[{"key":"11171_CR1","doi-asserted-by":"publisher","first-page":"107589","DOI":"10.1016\/j.patcog.2020.107589","volume":"109","author":"M Abbas","year":"2021","unstructured":"Abbas M, El-Zoghabi A, Shoukry A (2021) DenMune: density peak based clustering using mutual nearest neighbors. Pattern Recogn 109:107589","journal-title":"Pattern Recogn"},{"key":"11171_CR2","doi-asserted-by":"crossref","unstructured":"Ali A, Zhu Y, Chen Q, Yu J, Cai H (2019) Leveraging spatio-temporal patterns for predicting citywide traffic crowd flows using deep hybrid neural networks. In Proceedings of the 2019 IEEE 25th International Conference on Parallel and Distributed Systems, pp. 125\u2013132.","DOI":"10.1109\/ICPADS47876.2019.00025"},{"key":"11171_CR3","first-page":"1","volume":"2","author":"A Ali","year":"2021","unstructured":"Ali A, Zhu Y, Zakarya M (2021) A data aggregation based approach to exploit dynamic spatio-temporal correlations for citywide crowd flows prediction in fog computing. Multimed Tools Appl 2:1\u201333","journal-title":"Multimed Tools Appl"},{"issue":"2","key":"11171_CR4","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1145\/304181.304187","volume":"28","author":"M Ankerst","year":"1999","unstructured":"Ankerst M, Breunig MM, Kriegel H-P, Sander J (1999) OPTICS: ordering points to identify the clustering structure. ACM SIGMOD Rec 28(2):49\u201360","journal-title":"ACM SIGMOD Rec"},{"key":"11171_CR5","unstructured":"Asuncion A, Newman D (2007) UCI machine learning repository"},{"key":"11171_CR6","doi-asserted-by":"crossref","unstructured":"Beckmann N, Kriegel H-P, Schneider R, Seeger B (1990) The R*-tree: an efficient and robust access method for points and rectangles, in Proceedings of the 1990 ACM SIGMOD international conference on Management of data, 322\u2013331","DOI":"10.1145\/93605.98741"},{"key":"11171_CR7","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-319-49487-6_3","volume":"9220","author":"J Bl\u00f6mer","year":"2016","unstructured":"Bl\u00f6mer J, Lammersen C, Schmidt M, Sohler C (2016) Theoretical analysis of the k-means algorithm\u2013a survey. Algorithm Eng 9220:81\u2013116","journal-title":"Algorithm Eng"},{"issue":"5","key":"11171_CR8","doi-asserted-by":"publisher","first-page":"2785","DOI":"10.1016\/j.eswa.2014.09.054","volume":"42","author":"A Bouguettaya","year":"2015","unstructured":"Bouguettaya A, Yu Q, Liu X, Zhou X, Song A (2015) Efficient agglomerative hierarchical clustering. Expert Syst Appl 42(5):2785\u20132797","journal-title":"Expert Syst Appl"},{"issue":"6","key":"11171_CR9","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1109\/TKDE.2017.2787640","volume":"30","author":"A Bryant","year":"2018","unstructured":"Bryant A, Cios K (2018) RNN-DBSCAN: a density-based clustering algorithm using reverse nearest neighbor density estimates. IEEE Trans Knowl Data Eng 30(6):1109\u20131121","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"3","key":"11171_CR10","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/j.is.2012.09.001","volume":"38","author":"C Cassisi","year":"2013","unstructured":"Cassisi C, Ferro A, Giugno R, Pigola G, Pulvirenti A (2013) Enhancing density-based clustering: parameter reduction and outlier detection. Inf Syst 38(3):317\u2013330","journal-title":"Inf Syst"},{"issue":"1","key":"11171_CR11","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.patcog.2007.04.010","volume":"41","author":"H Chang","year":"2008","unstructured":"Chang H, Yeung D-Y (2008) Robust path-based spectral clustering. Pattern Recogn 41(1):191\u2013203","journal-title":"Pattern Recogn"},{"key":"11171_CR12","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.ins.2018.09.012","volume":"472","author":"Y Chen","year":"2019","unstructured":"Chen Y, Zhou L, Tang Y, Singh JP, Bouguila N, Wang C, Wang H, Du J (2019) Fast neighbor search by using revised kd tree. Inf Sci 472:145\u2013162","journal-title":"Inf Sci"},{"issue":"2","key":"11171_CR13","doi-asserted-by":"publisher","first-page":"38","DOI":"10.4018\/IJHISI.2016040103","volume":"11","author":"CL Chowdhary","year":"2016","unstructured":"Chowdhary CL, Acharjya D (2016) A hybrid scheme for breast cancer detection using intuitionistic fuzzy rough set technique. Intl J Healthcare Inf Syst Inf (IJHISI) 11(2):38\u201361","journal-title":"Intl J Healthcare Inf Syst Inf (IJHISI)"},{"key":"11171_CR14","first-page":"12","volume":"30","author":"CL Chowdhary","year":"2017","unstructured":"Chowdhary CL, Acharjya D (2017) Clustering algorithm in possibilistic exponential fuzzy c-mean segmenting medical images. J Biomim, Biomater Biomed Eng 30:12\u201323","journal-title":"J Biomim, Biomater Biomed Eng"},{"key":"11171_CR15","doi-asserted-by":"crossref","unstructured":"Chowdhary CL, Acharjya D (2017) Segmentation of mammograms using a novel intuitionistic possibilistic fuzzy c-mean clustering algorithm, Nature Inspired Computing, vol. 652, pp. 75\u201382: Springer","DOI":"10.1007\/978-981-10-6747-1_9"},{"key":"11171_CR16","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.procs.2020.03.179","volume":"167","author":"CL Chowdhary","year":"2020","unstructured":"Chowdhary CL, Acharjya D (2020) Segmentation and feature extraction in medical imaging: a systematic review. Procedia Computer Science 167:26\u201336","journal-title":"Procedia Computer Science"},{"key":"11171_CR17","doi-asserted-by":"crossref","unstructured":"Chowdhary CL, Sai GVK, Acharjya D (2016) Decrease in false assumption for detection using digital mammography, Computational Intelligence in Data Mining\u2014Volume 2, pp. 325\u2013333: Springer","DOI":"10.1007\/978-81-322-2731-1_30"},{"key":"11171_CR18","unstructured":"Dahal S (2015) Effect of different distance measures in result of cluster analysis"},{"issue":"1","key":"11171_CR19","first-page":"1","volume":"7","author":"J Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar J (2006) Statistical comparisons of classifiers over multiple data sets. J Mach Learn Res 7(1):1\u201330","journal-title":"J Mach Learn Res"},{"issue":"14","key":"11171_CR20","doi-asserted-by":"publisher","first-page":"4573","DOI":"10.1007\/s00500-017-2640-5","volume":"22","author":"S Ding","year":"2018","unstructured":"Ding S, Xu X, Fan S, Xue Y (2018) Locally adaptive multiple kernel k-means algorithm based on shared nearest neighbors. Soft Comput 22(14):4573\u20134583","journal-title":"Soft Comput"},{"key":"11171_CR21","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/j.knosys.2018.11.007","volume":"164","author":"S Ding","year":"2019","unstructured":"Ding S, Cong L, Hu Q, Jia H, Shi Z (2019) A multiway p-spectral clustering algorithm. Knowl-Based Syst 164:371\u2013377","journal-title":"Knowl-Based Syst"},{"key":"11171_CR22","unstructured":"Dolatshah M, Hadian A, Minaei-Bidgoli B (2015) Ball*-tree: Efficient spatial indexing for constrained nearest-neighbor search in metric spaces, Computer Science, arXiv preprint arXiv:1511.00628"},{"key":"11171_CR23","doi-asserted-by":"publisher","first-page":"114885","DOI":"10.1016\/j.eswa.2021.114885","volume":"176","author":"S Dong","year":"2021","unstructured":"Dong S (2021) Multi class SVM algorithm with active learning for network traffic classification. Expert Syst Appl 176:114885","journal-title":"Expert Syst Appl"},{"issue":"4","key":"11171_CR24","doi-asserted-by":"publisher","first-page":"326","DOI":"10.4103\/0377-2063.118021","volume":"59","author":"S Dong","year":"2013","unstructured":"Dong S, Zhou D, Ding W, Gong J (2013) Flow cluster algorithm based on improved K-means method. IETE J Res 59(4):326\u2013333","journal-title":"IETE J Res"},{"issue":"3","key":"11171_CR25","first-page":"727","volume":"14","author":"S Dong","year":"2018","unstructured":"Dong S, Zhang X, Li Y (2018) Microblog sentiment analysis method based on spectral clustering. J Inf Process Syst 14(3):727\u2013739","journal-title":"J Inf Process Syst"},{"key":"11171_CR26","doi-asserted-by":"publisher","first-page":"100379","DOI":"10.1016\/j.cosrev.2021.100379","volume":"40","author":"S Dong","year":"2021","unstructured":"Dong S, Wang P, Abbas K (2021) A survey on deep learning and its applications. Comput Sci Rev 40:100379","journal-title":"Comput Sci Rev"},{"key":"11171_CR27","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.knosys.2016.02.001","volume":"99","author":"M Du","year":"2016","unstructured":"Du M, Ding S, Jia H (2016) Study on density peaks clustering based on k-nearest neighbors and principal component analysis. Knowl-Based Syst 99:135\u2013145","journal-title":"Knowl-Based Syst"},{"key":"11171_CR28","doi-asserted-by":"crossref","unstructured":"Ert\u00f6z L, Steinbach M, Kumar V (2003) Finding clusters of different sizes, shapes, and densities in noisy, high dimensional data, in Proceedings of the 2003 SIAM international conference on data mining, 47\u201358","DOI":"10.1137\/1.9781611972733.5"},{"key":"11171_CR29","unstructured":"Ester M, Kriegel H-P, Sander J, Xu X (1996) A density-based algorithm for discovering clusters in large spatial databases with noise, AAAI press"},{"issue":"6","key":"11171_CR30","first-page":"1","volume":"11","author":"J-c Fan","year":"2019","unstructured":"Fan J-c, Jia P-l, Ge L (2019) M k-NN G-DPC: density peaks clustering based on improved mutual K-nearest-neighbor graph. Int J Mach Learn Cybern 11(6):1\u201317","journal-title":"Int J Mach Learn Cybern"},{"issue":"11","key":"11171_CR31","doi-asserted-by":"publisher","first-page":"1875","DOI":"10.1109\/TPAMI.2006.227","volume":"28","author":"P Franti","year":"2006","unstructured":"Franti P, Virmajoki O, Hautamaki V (2006) Fast agglomerative clustering using a k-nearest neighbor graph. IEEE Trans Pattern Anal Mach Intell 28(11):1875\u20131881","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"2","key":"11171_CR32","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0031-3203(78)90018-3","volume":"10","author":"KC Gowda","year":"1978","unstructured":"Gowda KC, Krishna G (1978) Agglomerative clustering using the concept of mutual nearest neighbourhood. Pattern Recogn 10(2):105\u2013112","journal-title":"Pattern Recogn"},{"key":"11171_CR33","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.eswa.2016.10.022","volume":"69","author":"E G\u00fcng\u00f6r","year":"2017","unstructured":"G\u00fcng\u00f6r E, \u00d6zmen A (2017) Distance and density based clustering algorithm using Gaussian kernel. Expert Syst Appl 69:10\u201320","journal-title":"Expert Syst Appl"},{"issue":"1","key":"11171_CR34","first-page":"100","volume":"28","author":"JA Hartigan","year":"1979","unstructured":"Hartigan JA, Wong MA (1979) Algorithm AS 136: a k-means clustering algorithm. J R Stat Soc: Ser C: Appl Stat 28(1):100\u2013108","journal-title":"J R Stat Soc: Ser C: Appl Stat"},{"issue":"24","key":"11171_CR35","doi-asserted-by":"publisher","first-page":"9489","DOI":"10.1016\/j.eswa.2015.07.074","volume":"42","author":"T \u0130nkaya","year":"2015","unstructured":"\u0130nkaya T (2015) A parameter-free similarity graph for spectral clustering. Expert Syst Appl 42(24):9489\u20139498","journal-title":"Expert Syst Appl"},{"key":"11171_CR36","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.patrec.2014.09.007","volume":"52","author":"T \u0130nkaya","year":"2015","unstructured":"\u0130nkaya T, Kayal\u0131gil S, \u00d6zdemirel NE (2015) An adaptive neighbourhood construction algorithm based on density and connectivity. Pattern Recogn Lett 52:17\u201324","journal-title":"Pattern Recogn Lett"},{"issue":"11","key":"11171_CR37","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1109\/T-C.1973.223640","volume":"100","author":"RA Jarvis","year":"1973","unstructured":"Jarvis RA, Patrick EA (1973) Clustering using a similarity measure based on shared near neighbors. IEEE Trans Comput 100(11):1025\u20131034","journal-title":"IEEE Trans Comput"},{"key":"11171_CR38","first-page":"5594","volume":"5","author":"Y Jeon","year":"2017","unstructured":"Jeon Y, Yoo J, Lee J, Yoon S (2017) Nc-link: a new linkage method for efficient hierarchical clustering of large-scale data. IEEE Access 5:5594\u20135608","journal-title":"IEEE Access"},{"issue":"8","key":"11171_CR39","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/2.781637","volume":"32","author":"G Karypis","year":"1999","unstructured":"Karypis G, Han E-H, Kumar V (1999) Chameleon: hierarchical clustering using dynamic modeling. Computer 32(8):68\u201375","journal-title":"Computer"},{"issue":"9","key":"11171_CR40","doi-asserted-by":"publisher","first-page":"1722","DOI":"10.1016\/j.ins.2011.01.011","volume":"181","author":"JZ Lai","year":"2011","unstructured":"Lai JZ, Huang T-J (2011) An agglomerative clustering algorithm using a dynamic k-nearest-neighbor list. Inf Sci 181(9):1722\u20131734","journal-title":"Inf Sci"},{"key":"11171_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.patcog.2020.107206","volume":"102","author":"H Li","year":"2020","unstructured":"Li H, Liu X, Li T, Gan R (2020) A novel density-based clustering algorithm using nearest neighbor graph. Pattern Recogn 102:1\u201313","journal-title":"Pattern Recogn"},{"issue":"3","key":"11171_CR42","first-page":"718","volume":"16","author":"J Li","year":"2020","unstructured":"Li J, Huang G, Zhou Y (2020) A sentiment classification approach of sentences clustering in webcast barrages. J Inf Process Syst 16(3):718\u2013732","journal-title":"J Inf Process Syst"},{"issue":"5","key":"11171_CR43","doi-asserted-by":"publisher","first-page":"2302","DOI":"10.1109\/TCYB.2018.2876615","volume":"50","author":"X Li","year":"2018","unstructured":"Li X, Lv J, Yi Z (2018) Outlier detection using structural scores in a high-dimensional space. IEEE Trans Cyberne 50(5):2302\u20132310","journal-title":"IEEE Trans Cyberne"},{"key":"11171_CR44","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.ins.2018.03.031","volume":"450","author":"R Liu","year":"2018","unstructured":"Liu R, Wang H, Yu X (2018) Shared-nearest-neighbor-based clustering by fast search and find of density peaks. Inf Sci 450:200\u2013226","journal-title":"Inf Sci"},{"key":"11171_CR45","first-page":"1","volume":"2018","author":"X Lv","year":"2018","unstructured":"Lv X, Ma Y, He X, Huang H, Yang J (2018) CciMST: a clustering algorithm based on minimum spanning tree and cluster centers. Math Probl Eng 2018:1\u201314","journal-title":"Math Probl Eng"},{"key":"11171_CR46","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.neucom.2015.05.109","volume":"171","author":"Y Lv","year":"2016","unstructured":"Lv Y, Ma T, Tang M, Cao J, Tian Y, Al-Dhelaan A, Al-Rodhaan M (2016) An efficient and scalable density-based clustering algorithm for datasets with complex structures. Neurocomputing 171:9\u201322","journal-title":"Neurocomputing"},{"issue":"12","key":"11171_CR47","doi-asserted-by":"publisher","first-page":"2014","DOI":"10.3390\/sym12122014","volume":"12","author":"Y Lv","year":"2020","unstructured":"Lv Y, Liu M, Xiang Y (2020) Fast Searching Density Peak Clustering Algorithm Based on Shared Nearest Neighbor and Adaptive Clustering Center. Symmetry 12(12):2014","journal-title":"Symmetry"},{"key":"11171_CR48","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.ins.2020.12.016","volume":"557","author":"Y Ma","year":"2021","unstructured":"Ma Y, Lin H, Wang Y, Huang H, He X (2021) A multi-stage hierarchical clustering algorithm based on centroid of tree and cut edge constraint. Inf Sci 557:194\u2013219","journal-title":"Inf Sci"},{"issue":"19","key":"11171_CR49","doi-asserted-by":"publisher","first-page":"1749","DOI":"10.1016\/j.tcs.2009.01.009","volume":"410","author":"M Maier","year":"2009","unstructured":"Maier M, Hein M, Von Luxburg U (2009) Optimal construction of k-nearest-neighbor graphs for identifying noisy clusters. Theor Comput Sci 410(19):1749\u20131764","journal-title":"Theor Comput Sci"},{"key":"11171_CR50","doi-asserted-by":"crossref","unstructured":"Murtagh F, Contreras P (2017) Algorithms for hierarchical clustering: an overview, II, Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery, vol. 7, no. 6, pp. e1219","DOI":"10.1002\/widm.1219"},{"issue":"1","key":"11171_CR51","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.patcog.2017.09.008","volume":"74","author":"Y Qin","year":"2018","unstructured":"Qin Y, Yu ZL, Wang C-D, Gu Z, Li Y (2018) A novel clustering method based on hybrid K-nearest-neighbor graph. Pattern Recogn 74(1):1\u201314","journal-title":"Pattern Recogn"},{"issue":"6191","key":"11171_CR52","doi-asserted-by":"publisher","first-page":"1492","DOI":"10.1126\/science.1242072","volume":"344","author":"A Rodriguez","year":"2014","unstructured":"Rodriguez A, Laio A (2014) Clustering by fast search and find of density peaks. Science 344(6191):1492\u20131496","journal-title":"Science"},{"key":"11171_CR53","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.ins.2019.02.051","volume":"486","author":"F Ros","year":"2019","unstructured":"Ros F, Guillaume S (2019) Munec: a mutual neighbor-based clustering algorithm. Inf Sci 486:148\u2013170","journal-title":"Inf Sci"},{"key":"11171_CR54","doi-asserted-by":"publisher","first-page":"106220","DOI":"10.1016\/j.knosys.2020.106220","volume":"204","author":"F Ros","year":"2020","unstructured":"Ros F, Guillaume S, El Hajji M, Riad R (2020) KdMutual: a novel clustering algorithm combining mutual neighboring and hierarchical approaches using a new selection criterion. Knowl-Based Syst 204:106220","journal-title":"Knowl-Based Syst"},{"key":"11171_CR55","doi-asserted-by":"crossref","unstructured":"Sarfraz S, Sharma V, Stiefelhagen R (2019) Efficient parameter-free clustering using first neighbor relations, in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 8934\u20138943","DOI":"10.1109\/CVPR.2019.00914"},{"key":"11171_CR56","doi-asserted-by":"crossref","unstructured":"Vadapalli S, Valluri SR, Karlapalem K (2006) A simple yet effective data clustering algorithm, in Sixth International Conference on Data Mining (ICDM'06), 1108\u20131112","DOI":"10.1109\/ICDM.2006.9"},{"key":"11171_CR57","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/j.ins.2020.04.016","volume":"527","author":"W-B Xie","year":"2020","unstructured":"Xie W-B, Lee Y-L, Wang C, Chen D-B, Zhou T (2020) Hierarchical clustering supported by reciprocal nearest neighbors. Inf Sci 527:279\u2013292","journal-title":"Inf Sci"},{"issue":"11","key":"11171_CR58","doi-asserted-by":"publisher","first-page":"3094","DOI":"10.1162\/neco_a_01014","volume":"29","author":"J Yang","year":"2017","unstructured":"Yang J, Ma Y, Zhang X, Li S, Zhang Y (2017) An initialization method based on hybrid distance for k-means algorithm. Neural Comput 29(11):3094\u20133117","journal-title":"Neural Comput"},{"key":"11171_CR59","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/j.knosys.2017.07.010","volume":"133","author":"L Yaohui","year":"2017","unstructured":"Yaohui L, Zhengming M, Fang Y (2017) Adaptive density peak clustering based on K-nearest neighbors with aggregating strategy. Knowl-Based Syst 133:208\u2013220","journal-title":"Knowl-Based Syst"},{"key":"11171_CR60","doi-asserted-by":"crossref","unstructured":"Ye H, Lv H, Sun Q (2016) An improved clustering algorithm based on density and shared nearest neighbor, in 2016 IEEE Information Technology, Networking, Electronic and Automation Control Conference, pp. 37\u201340","DOI":"10.1109\/ITNEC.2016.7560314"},{"issue":"2","key":"11171_CR61","doi-asserted-by":"publisher","first-page":"023107","DOI":"10.1063\/1.4908014","volume":"25","author":"M Yu","year":"2015","unstructured":"Yu M, Hillebrand A, Tewarie P, Meier J, van Dijk B, Van Mieghem P, Stam CJ (2015) Hierarchical clustering in minimum spanning trees. Chaos: Interdisc J Nonlinear ScI 25(2):023107","journal-title":"Chaos: Interdisc J Nonlinear ScI"},{"issue":"3","key":"11171_CR62","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1016\/j.patcog.2009.07.010","volume":"43","author":"C Zhong","year":"2010","unstructured":"Zhong C, Miao D, Wang R (2010) A graph-theoretical clustering method based on two rounds of minimum spanning trees. Pattern Recogn 43(3):752\u2013766","journal-title":"Pattern Recogn"},{"issue":"16","key":"11171_CR63","doi-asserted-by":"publisher","first-page":"3397","DOI":"10.1016\/j.ins.2011.04.013","volume":"181","author":"C Zhong","year":"2011","unstructured":"Zhong C, Miao D, Fr\u00e4nti P (2011) Minimum spanning tree based split-and-merge: a hierarchical clustering method. Inf Sci 181(16):3397\u20133410","journal-title":"Inf Sci"},{"key":"11171_CR64","first-page":"101","volume":"3","author":"Q Zhou","year":"2018","unstructured":"Zhou Q (2018) Traffic flow data analysis and mining method based on clustering recognition algorithm. Adv Transport Stud 3:101\u2013108","journal-title":"Adv Transport Stud"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-021-11171-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11042-021-11171-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-021-11171-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T04:58:34Z","timestamp":1633841914000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11042-021-11171-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,29]]},"references-count":64,"journal-issue":{"issue":"21-23","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["11171"],"URL":"https:\/\/doi.org\/10.1007\/s11042-021-11171-w","relation":{},"ISSN":["1380-7501","1573-7721"],"issn-type":[{"value":"1380-7501","type":"print"},{"value":"1573-7721","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7,29]]},"assertion":[{"value":"22 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 May 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 June 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 July 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}