{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T08:52:51Z","timestamp":1777279971200,"version":"3.51.4"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,8,13]],"date-time":"2019-08-13T00:00:00Z","timestamp":1565654400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,13]],"date-time":"2019-08-13T00:00:00Z","timestamp":1565654400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61473220"],"award-info":[{"award-number":["61473220"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Intell Inf Syst"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s10844-019-00572-x","type":"journal-article","created":{"date-parts":[[2019,8,13]],"date-time":"2019-08-13T12:03:30Z","timestamp":1565697810000},"page":"501-525","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A scaled-MST-based clustering algorithm and application on image segmentation"],"prefix":"10.1007","volume":"54","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8842-1042","authenticated-orcid":false,"given":"Jia","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaochun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiali","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,13]]},"reference":[{"issue":"8","key":"572_CR1","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1109\/42.876306","volume":"19","author":"L An","year":"2000","unstructured":"An, L., Xiang, Q.S., Chavez, S. (2000). A fast implementation of the minimum spanning tree method for phase unwrapping. IEEE Transactions on Medical Imaging, 19(8), 805\u20138.","journal-title":"IEEE Transactions on Medical Imaging"},{"key":"572_CR2","doi-asserted-by":"crossref","unstructured":"Arya, S., & Mount, D.M. (2016). A fast and simple algorithm for computing approximate euclidean minimum spanning trees. In Twenty-seventh ACM-SIAM symposium on discrete algorithms (pp. 1220\u20131233).","DOI":"10.1137\/1.9781611974331.ch85"},{"key":"572_CR3","doi-asserted-by":"publisher","unstructured":"Beygelzimer, A.M., Kakade, S., Langford, J. (2000). Cover trees for nearest neighbor. In ICML 2006 - Proceedings of the 23rd international conference on machine learning 2006. \nhttps:\/\/doi.org\/10.1145\/1143844.1143857\n\n.","DOI":"10.1145\/1143844.1143857"},{"issue":"1926","key":"572_CR4","first-page":"37","volume":"3","author":"O Bor\u016fvka","year":"1926","unstructured":"Bor\u016fvka, O. (1926). O jist\u00e9m probl\u00e9mu minim\u00e1ln\u00edm. Pr\u00e1ce moravsk\u00e1 p\u0159irodov\u00e9deck\u00e9 spole\u010dnosti, 3(1926), 37\u201358.","journal-title":"Pr\u00e1ce moravsk\u00e1 p\u0159irodov\u00e9deck\u00e9 spole\u010dnosti"},{"key":"572_CR5","doi-asserted-by":"publisher","unstructured":"Boser, B., Guyon, I.N., Vapnik, V. (1996). A training algorithm for optimal margin classifier. In Proceedings of the fifth annual ACM workshop on computational learning theory, Vol. 5,\nhttps:\/\/doi.org\/10.1145\/130385.130401\n\n.","DOI":"10.1145\/130385.130401"},{"issue":"1","key":"572_CR6","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 Recognition, 41(1), 191\u2013203.","journal-title":"Pattern Recognition"},{"key":"572_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-24024-4_11","volume-title":"An optimal parallel algorithm for minimum spanning trees in planar graphs","author":"KW Chong","year":"2015","unstructured":"Chong, K.W., & Zaroliagis, C. (2015). An optimal parallel algorithm for minimum spanning trees in planar graphs. Berlin: Springer International Publishing."},{"issue":"9","key":"572_CR8","first-page":"14","volume":"1","author":"TT Cormen","year":"2009","unstructured":"Cormen, T.T., Leiserson, C.E., Rivest, R.L. (2009). Introduction to algorithms. Resonance, 1(9), 14\u201324.","journal-title":"Resonance"},{"key":"572_CR9","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1016\/j.procs.2015.06.090","volume":"54","author":"N Dhanachandra","year":"2015","unstructured":"Dhanachandra, N., Manglem, K., Chanu, Y.J. (2015). Image segmentation using k -means clustering algorithm and subtractive clustering algorithm. Procedia Computer Science, 54, 764\u2013771. 10.1016\/j.procs.2015.06.090. \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/S1877050915014143\n\n.","journal-title":"Procedia Computer Science"},{"key":"572_CR10","unstructured":"Dua, D., & Graff, C. (2017). UCI machine learning repository. \nhttp:\/\/archive.ics.uci.edu\/ml\n\n."},{"key":"572_CR11","unstructured":"Economou, G., Pothos, V., Ifantis, A. (2004). Geodesic distance and mst based image segmentation. In 2004 12th European Signal Processing Conference (pp. 941\u2013944)."},{"issue":"16","key":"572_CR12","doi-asserted-by":"publisher","first-page":"12564","DOI":"10.1016\/j.eswa.2012.05.028","volume":"39","author":"D Gil","year":"2012","unstructured":"Gil, D., Girela, J.L., Juan, J.D., Gomez-Torres, M.J., Johnsson, M. (2012). Predicting seminal quality with artificial intelligence methods. Expert Systems with Applications, 39(16), 12564\u201312573.","journal-title":"Expert Systems with Applications"},{"key":"572_CR13","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.eswa.2016.10.022","volume":"69","author":"E G\u00fcng\u00f6r","year":"2016","unstructured":"G\u00fcng\u00f6r, E, & \u00d6zmen, A. (2016). Distance and density based clustering algorithm using gaussian kernel. Expert Systems with Applications, 69, 10\u201320.","journal-title":"Expert Systems with Applications"},{"issue":"2-3","key":"572_CR14","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"},{"key":"572_CR15","doi-asserted-by":"publisher","unstructured":"He, Y., & Chen, L. (2004). Minclue: a mst-based clustering method with auto-threshold-detection. In IEEE conference on cybernetics and intelligent systems, (Vol. 1 pp. 229\u2013233), \nhttps:\/\/doi.org\/10.1109\/ICCIS.2004.1460417\n\n.","DOI":"10.1109\/ICCIS.2004.1460417"},{"issue":"1","key":"572_CR16","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01908075","volume":"2","author":"L Hubert","year":"1985","unstructured":"Hubert, L., & Arabie, P. (1985). Comparing partitions. Journal of Classification, 2(1), 193\u2013218.","journal-title":"Journal of Classification"},{"key":"572_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18224-7_29","volume-title":"Fast minimum spanning tree based clustering algorithms on local neighborhood graph","author":"R Jothi","year":"2015","unstructured":"Jothi, R., Mohanty, S.K., Ojha, A. (2015). Fast minimum spanning tree based clustering algorithms on local neighborhood graph. Berlin: Springer International Publishing."},{"key":"572_CR18","unstructured":"Jothi, R., Mohanty, S.K., Ojha, A. (2017). Fast approximate minimum spanning tree based clustering algorithm. Neurocomputing 272."},{"issue":"7\u20139","key":"572_CR19","doi-asserted-by":"publisher","first-page":"1859","DOI":"10.1016\/j.neucom.2008.05.003","volume":"72","author":"P Juszczak","year":"2009","unstructured":"Juszczak, P., Tax, D.M.J., Pe\u0137alska, E, Duin, R.P.W. (2009). Minimum spanning tree based one-class classifier. Neurocomputing, 72(7\u20139), 1859\u20131869.","journal-title":"Neurocomputing"},{"issue":"8","key":"572_CR20","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/2.781637","volume":"32","author":"G Karypis","year":"2008","unstructured":"Karypis, G., Han, E.H., Kumar, V. (2008). Chameleon a hierarchical clustering algorithm using dynamic modeling. Computer, 32(8), 68\u201375.","journal-title":"Computer"},{"key":"572_CR21","doi-asserted-by":"crossref","unstructured":"Larsen, B., & Aone, C. (1999). Fast and effective text mining using linear-time document clustering. In ACM SIGKDD international conference on knowledge discovery and data mining (pp. 16\u201322).","DOI":"10.1145\/312129.312186"},{"issue":"1","key":"572_CR22","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1109\/TIP.2016.2624140","volume":"26","author":"Z Li","year":"2017","unstructured":"Li, Z., & Tang, J. (2017). Weakly supervised deep matrix factorization for social image understanding. IEEE Transactions on Image Processing, 26(1), 276\u2013288. \nhttps:\/\/doi.org\/10.1109\/TIP.2016.2624140\n\n.","journal-title":"IEEE Transactions on Image Processing"},{"key":"572_CR23","doi-asserted-by":"crossref","unstructured":"Luo, T., & Zhong, C. (2010). A neighborhood density estimation clustering algorithm based on minimum spanning tree. In International conference on rough set and knowledge technology.","DOI":"10.1007\/978-3-642-16248-0_76"},{"key":"572_CR24","doi-asserted-by":"publisher","unstructured":"Lv, X., Ma, Y., He, X., Huang, H., Yang, J. (2018). CciMST: a clustering algorithm based on minimum spanning tree and cluster centers. Mathematical Problems in Engineering 2018. \nhttps:\/\/doi.org\/10.1155\/2018\/8451796\n\n.","DOI":"10.1155\/2018\/8451796"},{"issue":"3","key":"572_CR25","doi-asserted-by":"publisher","first-page":"1020","DOI":"10.1016\/j.patcog.2012.09.015","volume":"46","author":"B Peng","year":"2013","unstructured":"Peng, B., Zhang, L., Zhang, D. (2013). A survey of graph theoretical approaches to image segmentation. Pattern Recognition, 46(3), 1020\u20131038. \nhttps:\/\/doi.org\/10.1016\/j.patcog.2012.09.015\n\n. \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/S0031320312004219\n\n.","journal-title":"Pattern Recognition"},{"issue":"336","key":"572_CR26","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. Publications of the American Statistical Association, 66(336), 846\u2013850.","journal-title":"Publications of the American Statistical Association"},{"key":"572_CR27","doi-asserted-by":"publisher","unstructured":"Saglam, A., & Baykan, N.A. (2017). Sequential image segmentation based on minimum spanning tree representation. \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/S0167865516301192\n\n, advances in Graph-based Pattern Recognition, (Vol. 87 pp. 155\u2013162),  \nhttps:\/\/doi.org\/10.1016\/j.patrec.2016.06.001\n\n.","DOI":"10.1016\/j.patrec.2016.06.001"},{"issue":"49","key":"572_CR28","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1016\/j.enbuild.2012.03.003","volume":"49","author":"A Tsanas","year":"2012","unstructured":"Tsanas, A., & Xifara, A. (2012). Accurate quantitative estimation of energy performance of residential buildings using statistical machine learning tools. Energy and Buildings, 49(49), 560\u2013567.","journal-title":"Energy and Buildings"},{"key":"572_CR29","doi-asserted-by":"publisher","unstructured":"Vella, F., Infantino, I., Gaglio, S., Vetrano, G. (2012). Image segmentation through a hierarchy of minimum spanning trees. In 2012 Eighth international conference on signal image technology and internet based systems. \nhttps:\/\/doi.org\/10.1109\/SITIS.2012.62\n\n (pp. 381\u2013388).","DOI":"10.1109\/SITIS.2012.62"},{"key":"572_CR30","unstructured":"Wang, X.L., & Wang, X. (2018). An efficient approximate emst algorithm for color image segmentation. In Perner, P. (Ed.) Machine learning and data mining in pattern recognition (pp. 147\u2013159). Cham: Springer International Publishing."},{"key":"572_CR31","unstructured":"Wang, X., Wang, X.L., Wilkes, D.M. (2012). A minimum spanning tree-inspired clustering-based outlier detection technique. In Industrial conference on advances in data mining: applications and theoretical aspects (pp. 209\u2013223)."},{"issue":"5","key":"572_CR32","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":"572_CR33","unstructured":"Wang, X.L., Wang, X., Li, X. Perner, P. (Ed.). (2018). A fast two-level approximate euclidean minimum spanning tree algorithm for high-dimensional data. Cham: Springer International Publishing."},{"issue":"1","key":"572_CR34","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0262-8856(96)01105-5","volume":"15","author":"Y Xu","year":"1997","unstructured":"Xu, Y., & Uberbacher, E.C. (1997). 2d image segmentation using minimum spanning trees. Image and Vision Computing, 15(1), 47\u201357.","journal-title":"Image and Vision Computing"},{"issue":"4","key":"572_CR35","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1093\/bioinformatics\/18.4.536","volume":"18","author":"Y Xu","year":"2002","unstructured":"Xu, Y., Olman, V., Xu, D. (2002). Clustering gene expression data using a graph-theoretic approach: an application of minimum spanning trees. Bioinformatics, 18(4), 536\u2013545.","journal-title":"Bioinformatics"},{"key":"572_CR36","doi-asserted-by":"crossref","unstructured":"Zahn, C.T. (1971). Graph-theoretical methods for detecting and describing gestalt clusters. In IEEE Trans. on Computers (pp. 68\u201386).","DOI":"10.1109\/T-C.1971.223083"},{"issue":"2","key":"572_CR37","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/j.cviu.2007.08.003","volume":"110","author":"H Zhang","year":"2008","unstructured":"Zhang, H., Fritts, J.E., Goldman, S.A. (2008). Image segmentation evaluation: a survey of unsupervised methods. Computer Vision and Image Understanding, 110 (2), 260\u2013280. \nhttps:\/\/doi.org\/10.1016\/j.cviu.2007.08.003\n\n. \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/S1077314207001294\n\n.","journal-title":"Computer Vision and Image Understanding"},{"issue":"3","key":"572_CR38","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 Recognition, 43(3), 752\u2013766.","journal-title":"Pattern Recognition"},{"issue":"16","key":"572_CR39","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., Nti, P. (2011). Minimum spanning tree based split-and-merge: a hierarchical clustering method. Information Sciences, 181(16), 3397\u20133410.","journal-title":"Information Sciences"},{"key":"572_CR40","volume-title":"A fast minimum spanning tree algorithm based on k-means. Information Sciences","author":"C Zhong","year":"2015","unstructured":"Zhong, C., Malinen, M., Miao, D., Fr\u00e4nti, P. (2015). A fast minimum spanning tree algorithm based on k-means. Information Sciences."}],"container-title":["Journal of Intelligent Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-019-00572-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10844-019-00572-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-019-00572-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,11]],"date-time":"2020-08-11T23:32:24Z","timestamp":1597188744000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10844-019-00572-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,13]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["572"],"URL":"https:\/\/doi.org\/10.1007\/s10844-019-00572-x","relation":{},"ISSN":["0925-9902","1573-7675"],"issn-type":[{"value":"0925-9902","type":"print"},{"value":"1573-7675","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,13]]},"assertion":[{"value":"9 April 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 July 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 July 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 August 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}