{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:19:57Z","timestamp":1743027597769,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319182230"},{"type":"electronic","value":"9783319182247"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18224-7_29","type":"book-chapter","created":{"date-parts":[[2015,5,4]],"date-time":"2015-05-04T16:48:35Z","timestamp":1430758115000},"page":"292-301","source":"Crossref","is-referenced-by-count":6,"title":["Fast Minimum Spanning Tree Based Clustering Algorithms on Local Neighborhood Graph"],"prefix":"10.1007","author":[{"given":"R.","family":"Jothi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sraban Kumar","family":"Mohanty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aparajita","family":"Ojha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"29_CR1","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"A.K. Jain","year":"1999","unstructured":"Jain, A.K., Murty, M.N., Flynn, P.J.: Data clustering: a review. ACM Computing Surveys (CSUR)\u00a031(3), 264\u2013323 (1999)","journal-title":"ACM Computing Surveys (CSUR)"},{"issue":"1","key":"29_CR2","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","volume":"1","author":"S.E. Schaeffer","year":"2007","unstructured":"Schaeffer, S.E.: Graph clustering. Computer Science Review\u00a01(1), 27\u201364 (2007)","journal-title":"Computer Science Review"},{"issue":"1","key":"29_CR3","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/T-C.1971.223083","volume":"100","author":"C.T. Zahn","year":"1971","unstructured":"Zahn, C.T.: Graph-theoretical methods for detecting and describing gestalt clusters. IEEE Transactions on Computers\u00a0100(1), 68\u201386 (1971)","journal-title":"IEEE Transactions on Computers"},{"key":"29_CR4","unstructured":"Xu, Y., Olman, V., Xu, D.: Minimum spanning trees for gene expression data clustering. GENOME INFORMATICS SERIES, pp. 24\u201333 (2001)"},{"issue":"7","key":"29_CR5","doi-asserted-by":"publisher","first-page":"902","DOI":"10.1109\/TKDE.2005.112","volume":"17","author":"M. Laszlo","year":"2005","unstructured":"Laszlo, M., Mukherjee, S.: Minimum spanning tree partitioning algorithm for microaggregation. IEEE Transactions on Knowledge and Data Engineering\u00a017(7), 902\u2013911 (2005)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"29_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/978-3-642-16248-0_76","volume-title":"Rough Set and Knowledge Technology","author":"T. Luo","year":"2010","unstructured":"Luo, T., Zhong, C.: A neighborhood density estimation clustering algorithm based on minimum spanning tree. In: Yu, J., Greco, S., Lingras, P., Wang, G., Skowron, A. (eds.) RSKT 2010. LNCS, vol.\u00a06401, pp. 557\u2013565. Springer, Heidelberg (2010)"},{"issue":"16","key":"29_CR7","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.: Minimum spanning tree based split-and-merge: A hierarchical clustering method. Information Sciences\u00a0181(16), 3397\u20133410 (2011)","journal-title":"Information Sciences"},{"issue":"5","key":"29_CR8","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.: Enhancing minimum spanning tree-based clustering by removing density-based outliers. Digital Signal Processing\u00a023(5), 1523\u20131538 (2013)","journal-title":"Digital Signal Processing"},{"issue":"7","key":"29_CR9","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1109\/TKDE.2009.37","volume":"21","author":"X. Wang","year":"2009","unstructured":"Wang, X., Wang, X., Wilkes, D.M.: A divide-and-conquer approach for minimum spanning tree-based clustering. IEEE Transactions on Knowledge and Data Engineering\u00a021(7), 945\u2013958 (2009)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"4","key":"29_CR10","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1109\/TIP.2009.2038764","volume":"19","author":"B. Cheng","year":"2010","unstructured":"Cheng, B., Yang, J., Yan, S., Fu, Y., Huang, T.S.: Learning with L1-graph for image analysis. IEEE Transactions on Image Processing\u00a019(4), 858\u2013866 (2010)","journal-title":"IEEE Transactions on Image Processing"},{"key":"29_CR11","unstructured":"Liu, H., Yan, S.: Robust graph mode seeking by graph shift. In: Proceedings of the 27th International Conference on Machine Learning (ICML 2010), pp. 671\u2013678 (2010)"},{"key":"29_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-642-40261-6_31","volume-title":"Computer Analysis of Images and Patterns","author":"C. Zhong","year":"2013","unstructured":"Zhong, C., Malinen, M., Miao, D., Fr\u00e4nti, P.: Fast approximate minimum spanning tree algorithm based on K-means. In: Wilson, R., Hancock, E., Bors, A., Smith, W. (eds.) CAIP 2013, Part I. LNCS, vol.\u00a08047, pp. 262\u2013269. Springer, Heidelberg (2013)"},{"issue":"3","key":"29_CR13","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/s10844-013-0236-9","volume":"40","author":"X. Chen","year":"2013","unstructured":"Chen, X.: Clustering based on a near neighbor graph and a grid cell graph. Journal of Intelligent Information Systems\u00a040(3), 529\u2013554 (2013)","journal-title":"Journal of Intelligent Information Systems"},{"issue":"2","key":"29_CR14","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1016\/j.csda.2007.03.013","volume":"52","author":"M. Chavent","year":"2007","unstructured":"Chavent, M., Lechevallier, Y., Briant, O.: DIVCLUS-T: A monothetic divisive hierarchical clustering method. Computational Statistics and Data Analysis\u00a052(2), 687\u2013701 (2007)","journal-title":"Computational Statistics and Data Analysis"}],"container-title":["Lecture Notes in Computer Science","Graph-Based Representations in Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18224-7_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T15:27:07Z","timestamp":1674833227000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18224-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319182230","9783319182247"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18224-7_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}