{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T08:52:44Z","timestamp":1777279964913,"version":"3.51.4"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,4,22]],"date-time":"2020-04-22T00:00:00Z","timestamp":1587513600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,4,22]],"date-time":"2020-04-22T00:00:00Z","timestamp":1587513600000},"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":["J Intell Inf Syst"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s10844-020-00602-z","type":"journal-article","created":{"date-parts":[[2020,4,22]],"date-time":"2020-04-22T06:02:41Z","timestamp":1587535361000},"page":"587-606","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["A minimum spanning tree based partitioning and merging technique for clustering heterogeneous data sets"],"prefix":"10.1007","volume":"55","author":[{"given":"Gaurav","family":"Mishra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sraban Kumar","family":"Mohanty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,22]]},"reference":[{"issue":"3","key":"602_CR1","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1109\/3477.678624","volume":"28","author":"JC Bezdek","year":"1998","unstructured":"Bezdek, J.C., & Pal, N.R. (1998). Some new indexes of cluster validity. IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 28(3), 301\u2013315.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)"},{"key":"602_CR2","unstructured":"Blake, C., & Merz, C. (1998). Uci repository of machine learning databases [http:\/\/www.ics.uci.edu\/mlearn\/mlrepository.html], department of information and computer science, University of California, Irvine, CA, Vol. 55."},{"issue":"3","key":"602_CR3","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/s10844-013-0236-9","volume":"40","author":"X Chen","year":"2013","unstructured":"Chen, X. (2013). Clustering based on a near neighbor graph and a grid cell graph. Journal of Intelligent Information Systems, 40(3), 529\u2013554.","journal-title":"Journal of Intelligent Information Systems"},{"key":"602_CR4","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/j.amc.2015.12.039","volume":"276","author":"Q Cheng","year":"2016","unstructured":"Cheng, Q., Liu, Z., Huang, J., & Cheng, G. (2016a). Community detection in hypernetwork via density-ordered tree partition. Applied Mathematics and Computation, 276, 384\u2013393.","journal-title":"Applied Mathematics and Computation"},{"key":"602_CR5","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.physa.2016.05.041","volume":"460","author":"Q Cheng","year":"2016","unstructured":"Cheng, Q., Lu, X., Liu, Z., Huang, J., & Cheng, G. (2016b). Spatial clustering with density-ordered tree. Physica A:, Statistical Mechanics and its Applications, 460, 188\u2013200.","journal-title":"Physica A:, Statistical Mechanics and its Applications"},{"issue":"3","key":"602_CR6","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/s10115-013-0667-1","volume":"41","author":"CH Chung","year":"2014","unstructured":"Chung, C.H., & Dai, B.R. (2014). A fragment-based iterative consensus clustering algorithm with a robust similarity. Knowledge and information systems, 41(3), 591\u2013609.","journal-title":"Knowledge and information systems"},{"key":"602_CR7","unstructured":"Das, A.K., & Sil, J. (2007). Cluster validation using splitting and merging technique, International conference on computational intelligence and multimedia applications (ICCIMA 2007), vol. 2, pp. 56\u201360. IEEE."},{"issue":"2","key":"602_CR8","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s10115-018-1189-7","volume":"59","author":"M Du","year":"2019","unstructured":"Du, M., Ding, S., Xue, Y., & Shi, Z. (2019). A novel density peaks clustering with sensitivity of local density and density-adaptive metric. Knowledge and Information Systems, 59(2), 285\u2013309.","journal-title":"Knowledge and Information Systems"},{"key":"602_CR9","unstructured":"Ester, M., Kriegel, H.P., Sander, J., Xu, X., & et al. (1996). A density-based algorithm for discovering clusters in large spatial databases with noise. In Kdd, vol. 96, pp. 226\u2013231."},{"key":"602_CR10","doi-asserted-by":"crossref","unstructured":"Grygorash, O., Zhou, Y., & Jorgensen, Z. (2006). Minimum spanning tree based clustering algorithms. In 18Th IEEE international conference on tools with artificial intelligence (ICTAI\u201906), pp. 73\u201381. IEEE.","DOI":"10.1109\/ICTAI.2006.83"},{"issue":"2","key":"602_CR11","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1145\/276305.276312","volume":"27","author":"S Guha","year":"1998","unstructured":"Guha, S., Rastogi, R., & Shim, K. (1998). Cure: an efficient clustering algorithm for large databases. ACM Sigmod Record, 27(2), 73\u201384.","journal-title":"ACM Sigmod Record"},{"issue":"2-3","key":"602_CR12","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1023\/A:1012801612483","volume":"17","author":"M Halkidi","year":"2001","unstructured":"Halkidi, M., Batistakis, Y., & Vazirgiannis, M. (2001). On clustering validation techniques. Journal of intelligent information systems, 17(2-3), 107\u2013145.","journal-title":"Journal of intelligent information systems"},{"issue":"1","key":"602_CR13","first-page":"100","volume":"28","author":"JA Hartigan","year":"1979","unstructured":"Hartigan, J.A., & Wong, M.A. (1979). Algorithm as 136: a k-means clustering algorithm. Journal of the Royal Statistical Society. Series C (Applied Statistics), 28(1), 100\u2013108.","journal-title":"Journal of the Royal Statistical Society. Series C (Applied Statistics)"},{"issue":"19","key":"602_CR14","doi-asserted-by":"publisher","first-page":"8495","DOI":"10.1007\/s11042-013-1611-9","volume":"74","author":"W Hu","year":"2015","unstructured":"Hu, W., & he Pan, Q. (2015). Data clustering and analyzing techniques using hierarchical clustering method. Multimedia Tools and Applications, 74(19), 8495\u20138504.","journal-title":"Multimedia Tools and Applications"},{"key":"602_CR15","unstructured":"Hyde, R., & et al. (2015). Lancaster university clustering datasets. http:\/\/www.lancaster.ac.uk\/pg\/hyder\/Downloads\/downloads.html."},{"key":"602_CR16","unstructured":"Jain, A.K., & Dubes, R.C. (1988). Algorithms for clustering data, Prentice-Hall, Inc."},{"issue":"2","key":"602_CR17","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s10844-006-0250-2","volume":"26","author":"HC Jiau","year":"2006","unstructured":"Jiau, H.C., Su, Y.J., Lin, Y.M., & Tsai, S.R. (2006). Mpm: a hierarchical clustering algorithm using matrix partitioning method for non-numeric data. Journal of Intelligent Information Systems, 26(2), 185\u2013207.","journal-title":"Journal of Intelligent Information Systems"},{"key":"602_CR18","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.compbiomed.2016.02.007","volume":"71","author":"R Jothi","year":"2016","unstructured":"Jothi, R., Mohanty, S.K., & Ojha, A. (2016). Functional grouping of similar genes using eigenanalysis on minimum spanning tree based neighborhood graph. Computers in biology and medicine, 71, 135\u2013148.","journal-title":"Computers in biology and medicine"},{"key":"602_CR19","doi-asserted-by":"crossref","unstructured":"Jothi, R., Mohanty, S.K., & Ojha, A. (2016). On careful selection of initial centers for k-means algorithm. In Proceedings of 3rd International Conference on Advanced Computing, Networking and Informatics, pp. 435\u2013445. Springer.","DOI":"10.1007\/978-81-322-2538-6_45"},{"key":"602_CR20","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1016\/j.neucom.2017.07.038","volume":"272","author":"R Jothi","year":"2018","unstructured":"Jothi, R., Mohanty, S.K., & Ojha, A. (2018). Fast approximate minimum spanning tree based clustering algorithm. Neurocomputing, 272, 542\u2013557.","journal-title":"Neurocomputing"},{"issue":"8","key":"602_CR21","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"},{"key":"602_CR22","doi-asserted-by":"publisher","first-page":"9003","DOI":"10.1007\/s11042-018-7112-0","volume":"79","author":"E Kavitha","year":"2019","unstructured":"Kavitha, E., & Tamilarasan, R. (2019). Agglo-hi clustering algorithm for gene expression micro array data using proximity measures. Multimedia Tools and Applications, 79, 9003\u20139017.","journal-title":"Multimedia Tools and Applications"},{"issue":"1","key":"602_CR23","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10115-006-0027-5","volume":"12","author":"H Koga","year":"2007","unstructured":"Koga, H., Ishibashi, T., & Watanabe, T. (2007). Fast agglomerative hierarchical clustering algorithm using locality-sensitive hashing. Knowledge and Information Systems, 12(1), 25\u201353.","journal-title":"Knowledge and Information Systems"},{"issue":"3","key":"602_CR24","first-page":"231","volume":"1","author":"HP Kriegel","year":"2011","unstructured":"Kriegel, H.P., Kr\u00f6ger, P., Sander, J., & Zimek, A. (2011). Density-based clustering. Wiley Interdisciplinary Reviews:, Data Mining and Knowledge Discovery, 1 (3), 231\u2013240.","journal-title":"Wiley Interdisciplinary Reviews:, Data Mining and Knowledge Discovery"},{"key":"602_CR25","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.patcog.2016.03.008","volume":"58","author":"KM Kumar","year":"2016","unstructured":"Kumar, K.M., & Reddy, A.R.M. (2016). A fast dbscan clustering algorithm by accelerating neighbor searching using groups method. Pattern Recognition, 58, 39\u201348.","journal-title":"Pattern Recognition"},{"key":"602_CR26","doi-asserted-by":"publisher","unstructured":"Li, J., Wang, X., & Wang, X. (2019). A scaled-mst-based clustering algorithm and application on image segmentation, Journal of Intelligent Information Systems, pp 1\u201325. https:\/\/doi.org\/10.1007\/s10844-019-00572-x.","DOI":"10.1007\/s10844-019-00572-x"},{"key":"602_CR27","doi-asserted-by":"crossref","unstructured":"Li, X., Kao, B., Luo, S., & Ester, M. (2018). Rosc: Robust spectral clustering on multi-scale data. In Proceedings of the 2018 World Wide Web Conference, pp. 157\u2013166.","DOI":"10.1145\/3178876.3185993"},{"issue":"3","key":"602_CR28","doi-asserted-by":"publisher","first-page":"12204","DOI":"10.1111\/exsy.12204","volume":"34","author":"O Limwattanapibool","year":"2017","unstructured":"Limwattanapibool, O., & Arch-int, S. (2017). Determination of the appropriate parameters for k-means clustering using selection of region clusters based on density dbscan (srcd-dbscan). Expert Systems, 34(3), 12204.","journal-title":"Expert Systems"},{"issue":"2","key":"602_CR29","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1109\/TKDE.2005.21","volume":"17","author":"CR Lin","year":"2005","unstructured":"Lin, C.R., & Chen, M.S. (2005). Combining partitional and hierarchical algorithms for robust and efficient data clustering with cohesion self-merging. IEEE Transactions on Knowledge and Data Engineering, 17(2), 145\u2013159.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"602_CR30","doi-asserted-by":"publisher","unstructured":"Mishra, G., & Mohanty, S. (2020). Rdmn: a relative density measure based on mst neighborhood for clustering multi-scale datasets, IEEE Transactions on Knowledge and Data Engineering, pp 1\u20131, https:\/\/doi.org\/10.1109\/TKDE.2020.2982400.","DOI":"10.1109\/TKDE.2020.2982400"},{"key":"602_CR31","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.eswa.2019.04.048","volume":"132","author":"G Mishra","year":"2019","unstructured":"Mishra, G., & Mohanty, S.K. (2019). A fast hybrid clustering technique based on local nearest neighbor using minimum spanning tree. Expert Systems with Applications, 132, 28\u201343.","journal-title":"Expert Systems with Applications"},{"issue":"2-3","key":"602_CR32","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1023\/A:1012853629322","volume":"17","author":"EJ Otoo","year":"2001","unstructured":"Otoo, E.J., Shoshani, A., & Hwang, S.w. (2001). Clustering high dimensional massive scientific datasets. Journal of Intelligent Information Systems, 17(2-3), 147\u2013168.","journal-title":"Journal of Intelligent Information Systems"},{"key":"602_CR33","unstructured":"Pasi, F., & et al. (2015). Clustering datasets. http:\/\/cs.uef.fi\/sipu\/datasets\/."},{"issue":"336","key":"602_CR34","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1080\/01621459.1971.10482356","volume":"66","author":"WM Rand","year":"1971","unstructured":"Rand, W.M. (1971). Objective criteria for the evaluation of clustering methods. Journal of the American Statistical association, 66(336), 846\u2013850.","journal-title":"Journal of the American Statistical association"},{"issue":"5","key":"602_CR35","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1111\/exsy.12046","volume":"31","author":"N Schlitter","year":"2014","unstructured":"Schlitter, N., Falkowski, T., & L\u00e4ssig, J. (2014). Dengraph-ho: a density-based hierarchical graph clustering algorithm. Expert Systems, 31(5), 469\u2013479.","journal-title":"Expert Systems"},{"issue":"23","key":"602_CR36","doi-asserted-by":"publisher","first-page":"33247","DOI":"10.1007\/s11042-018-6643-8","volume":"78","author":"T Tong","year":"2019","unstructured":"Tong, T., Zhu, X., & Du, T. (2019). Connected graph decomposition for spectral clustering. Multimedia Tools and Applications, 78(23), 33247\u201333259.","journal-title":"Multimedia Tools and Applications"},{"key":"602_CR37","volume-title":"Comparing clusterings: an overview","author":"S Wagner","year":"2007","unstructured":"Wagner, S., & Wagner, D. (2007). Comparing clusterings: an overview. Universit\u00e4t Karlsruhe: Fakult\u00e4t f\u00fcr Informatik Karlsruhe."},{"key":"602_CR38","volume-title":"An asymmetrically modified boxplot for exploratory data analysis","author":"M Walker","year":"2013","unstructured":"Walker, M., & Chakraborti, S. (2013). An asymmetrically modified boxplot for exploratory data analysis. The University of Alabama: Department of Information Systems Statistics, and Management Science."},{"issue":"5","key":"602_CR39","doi-asserted-by":"publisher","first-page":"1523","DOI":"10.1016\/j.dsp.2013.03.009","volume":"23","author":"X Wang","year":"2013","unstructured":"Wang, X., Wang, X.L., Chen, C., & Wilkes, D.M. (2013). Enhancing minimum spanning tree-based clustering by removing density-based outliers. Digital Signal Processing, 23(5), 1523\u20131538.","journal-title":"Digital Signal Processing"},{"key":"602_CR40","unstructured":"Wickham, H., & Stryjewski, L. (2011). 40 years of boxplots. Am Statistician."},{"issue":"1","key":"602_CR41","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/T-C.1971.223083","volume":"100","author":"CT Zahn","year":"1971","unstructured":"Zahn, C.T. (1971). Graph-theoretical methods for detecting and describing gestalt clusters. IEEE Transactions on computers, 100(1), 68\u201386.","journal-title":"IEEE Transactions on computers"},{"issue":"16","key":"602_CR42","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. Information Sciences, 181(16), 3397\u20133410.","journal-title":"Information Sciences"}],"container-title":["Journal of Intelligent Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-020-00602-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10844-020-00602-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-020-00602-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,21]],"date-time":"2021-04-21T23:34:15Z","timestamp":1619048055000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10844-020-00602-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,22]]},"references-count":42,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["602"],"URL":"https:\/\/doi.org\/10.1007\/s10844-020-00602-z","relation":{},"ISSN":["0925-9902","1573-7675"],"issn-type":[{"value":"0925-9902","type":"print"},{"value":"1573-7675","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,22]]},"assertion":[{"value":"6 October 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 March 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 March 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 April 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}