{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T20:42:17Z","timestamp":1778272937894,"version":"3.51.4"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,3,13]],"date-time":"2013-03-13T00:00:00Z","timestamp":1363132800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Intell Inf Syst"],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1007\/s10844-013-0236-9","type":"journal-article","created":{"date-parts":[[2013,3,12]],"date-time":"2013-03-12T14:21:23Z","timestamp":1363098083000},"page":"529-554","source":"Crossref","is-referenced-by-count":15,"title":["Clustering based on a near neighbor graph and a grid cell graph"],"prefix":"10.1007","volume":"40","author":[{"given":"Xinquan","family":"Chen","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,3,13]]},"reference":[{"key":"236_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Gehrke, J., Gunopolos, D., et al. (1998). Automatic subspace clustering of high dimensional data for data mining application. In Proceeding of the ACM SIGMOD international conference on management of data (pp. 94\u2013105).","DOI":"10.1145\/276305.276314"},{"key":"236_CR2","unstructured":"Anders, K.H. (2003). A hierarchical graph-clustering approach to find groups of objects. In The 5th workshop on progress in automated map generalization (pp. 1\u20138)."},{"key":"236_CR3","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., et al. (2009). Introduction to algorithms (3rd ed.). Cambridge: The MIT Press.","edition":"3"},{"issue":"1","key":"236_CR4","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/s10844-012-0219-2","volume":"40","author":"AFBF Costa","year":"2013","unstructured":"Costa, A.F.B.F., Pimentel, B.A., de Souza, R.M.C.R. (2013). Clustering interval data through kernel-induced feature space. Journal of Intelligent Information Systems, 40(1), 109\u2013140.","journal-title":"Journal of Intelligent Information Systems"},{"key":"236_CR5","unstructured":"Ester, M., Kriegel, H.P., Sander, J., Xu, X. (1996). A density-based algorithm for discovering clusters in large spatial data sets with noise. In The 2th international conference on knowledge discovery and data mining (pp. 226\u2013231). Portland."},{"key":"236_CR6","unstructured":"Frank, A., & Asuncion, A. (2010). UCI machine learning repository. Irvine, CA: University of California, School of Information and Computer Science. http:\/\/archive.ics.uci.edu\/ml ."},{"issue":"16","key":"236_CR7","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1126\/science.1136800","volume":"315","author":"BJ Frey","year":"2007","unstructured":"Frey, B.J., & Dueck, D. (2007). Clustering by passing messages between data points. Science, 315(16), 972\u2013976.","journal-title":"Science"},{"key":"236_CR8","doi-asserted-by":"crossref","first-page":"259","DOI":"10.2307\/2412323","volume":"18","author":"K Gabriel","year":"1969","unstructured":"Gabriel, K., & Sokal, R. (1969). A new statistical approach to geographic variation analysis. Systematic Zoology, 18, 259\u2013278.","journal-title":"Systematic Zoology"},{"issue":"1","key":"236_CR9","doi-asserted-by":"crossref","first-page":"54","DOI":"10.2307\/2346439","volume":"18","author":"JC Gower","year":"1969","unstructured":"Gower, J.C., & Ross, G.J.S. (1969). Minimum spanning trees and single linkage cluster analysis. Applied Statistics, 18(1), 54\u201364.","journal-title":"Applied Statistics"},{"key":"236_CR10","first-page":"73","volume-title":"Proceeding of the ACM SIGMOD international conference on management of data","author":"S Guha","year":"1998","unstructured":"Guha, S., Rastogi, R., Shim, K. (1998). Cure: an efficient clustering algorithm for large databases. In Proceeding of the ACM SIGMOD international conference on management of data (pp. 73\u201384). Seattle: ACM Press."},{"issue":"8","key":"236_CR11","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1016\/j.patrec.2009.09.011","volume":"31","author":"AK Jain","year":"2010","unstructured":"Jain, A.K. (2010). Data clustering: 50 years beyond K-means. Pattern Recognition Letters, 31(8), 651\u2013666.","journal-title":"Pattern Recognition Letters"},{"issue":"3","key":"236_CR12","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"AK Jain","year":"1999","unstructured":"Jain, A.K., Murty, M.N., Flynn, P.J. (1999). Data clustering: a review. ACM Computing Surveys, 31(3), 264\u2013323.","journal-title":"ACM Computing Surveys"},{"issue":"9","key":"236_CR13","doi-asserted-by":"crossref","first-page":"1502","DOI":"10.1109\/5.163414","volume":"80","author":"JW Jaromczyk","year":"1992","unstructured":"Jaromczyk, J.W., Godfried, T. (1992). Relative neighborhood graphs and their relatives. Proceedings of the IEEE, 80(9), 1502\u20131517.","journal-title":"Proceedings of the IEEE"},{"issue":"8","key":"236_CR14","doi-asserted-by":"crossref","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: a hierarchical clustering algorithm using dynamic modeling. IEEE Computer, 32(8), 68\u201375.","journal-title":"IEEE Computer"},{"issue":"4","key":"236_CR15","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1145\/322217.322219","volume":"27","author":"DT Lee","year":"1980","unstructured":"Lee, D.T. (1980). Two dimensional voronoi diagram in the l p metric. Journal of ACM, 27(4), 604\u2013618.","journal-title":"Journal of ACM"},{"key":"236_CR16","volume-title":"Tutorial to data structures","author":"CB Li","year":"2009","unstructured":"Li, C.B., Yin, W.M., Li, R.R., et al. (2009). Tutorial to data structures (3rd ed.). Beijing: The Tsinghua University Press.","edition":"3"},{"issue":"1","key":"236_CR17","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","volume":"1","author":"SE Schaeffer","year":"2007","unstructured":"Schaeffer, S.E. (2007). Graph clustering. Computer Science Review, 1(1), 27\u201364.","journal-title":"Computer Science Review"},{"issue":"5","key":"236_CR18","doi-asserted-by":"crossref","first-page":"1299","DOI":"10.1162\/089976698300017467","volume":"10","author":"B Sch\u00f6lkopf","year":"1998","unstructured":"Sch\u00f6lkopf, B., Smola, A., M\u00fcller, K.R. (1998). Nonlinear component analysis as a kernel eigenvalue problem. Neural Computation, 10(5), 1299\u20131319.","journal-title":"Neural Computation"},{"key":"236_CR19","unstructured":"Tan, P.N., Steinbach, M., Kumar, V. (2005). Introduction to data mining. Addison Wesley."},{"key":"236_CR20","unstructured":"Theodoridis, S., & Koutroumbas, K. (2006). Pattern recognition (3rd ed.). Academic Press."},{"issue":"4","key":"236_CR21","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0031-3203(80)90066-7","volume":"12","author":"G Toussaint","year":"1980","unstructured":"Toussaint, G. (1980). The relative neighborhood graph of a finite planar set. Pattern Recognition, 12(4), 261\u2013268.","journal-title":"Pattern Recognition"},{"issue":"7","key":"236_CR22","doi-asserted-by":"crossref","first-page":"945","DOI":"10.1109\/TKDE.2009.37","volume":"21","author":"XC Wang","year":"2009","unstructured":"Wang, X.C., Wang, X.L., Wilkes, D.M. (2009). A divide-and-conquer approach for minimum spanning tree-based clustering. IEEE Transactions on Knowledge and Data Engineering, 21(7), 945\u2013958.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"236_CR23","unstructured":"Wang, W., Yang, J., Muntz, R.R. (1997). STING: a statistical information grid approach to spatial data mining. In Proceedings of the 23rd VLDB conference (pp. 186\u2013195). Athens, Greece."},{"issue":"1","key":"236_CR24","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0020-0190(75)90056-3","volume":"4","author":"AC Yao","year":"1975","unstructured":"Yao, A.C. (1975). An O(\u2223E\u2223\u2009\u00b7loglog\u2223V\u2223) algorithm for finding minimum spanning trees. Information Processing Letters, 4(1), 21\u201323.","journal-title":"Information Processing Letters"},{"issue":"5","key":"236_CR25","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1137\/0211059","volume":"11","author":"AC Yao","year":"1982","unstructured":"Yao, A.C. (1982). On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM Journal on Computing, 11(5), 721\u2013736.","journal-title":"SIAM Journal on Computing"},{"key":"236_CR26","doi-asserted-by":"crossref","unstructured":"Zahn, C.T. (1971). Graph-theoretical methods for detecting and describing gestalt clusters. IEEE Transactions on Computers, C-20(1), 68\u201386.","DOI":"10.1109\/T-C.1971.223083"},{"key":"236_CR27","volume-title":"Algorithms and data structures: Described in C language","author":"NX Zhang","year":"2006","unstructured":"Zhang, N.X. (2006). Algorithms and data structures: Described in C language (2nd ed.). Beijing: The Higher Education Press.","edition":"2"},{"issue":"2","key":"236_CR28","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1023\/A:1009783824328","volume":"1","author":"T Zhang","year":"1997","unstructured":"Zhang, T., Ramakrishnan, R., Linvy, M. (1997). BIRCH: an efficient data clustering method for very large data sets. Data Mining and Knowledge Discovery, 1(2), 141\u2013182.","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"3","key":"236_CR29","doi-asserted-by":"crossref","first-page":"752","DOI":"10.1016\/j.patcog.2009.07.010","volume":"43","author":"CM Zhou","year":"2010","unstructured":"Zhou, C.M., Miao, D.Q., Wang, R.Z. (2010). A graph-theoretical clustering method based on two rounds of minimum spanning trees. Pattern Recognition, 43(3), 752\u2013766.","journal-title":"Pattern Recognition"}],"container-title":["Journal of Intelligent Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-013-0236-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10844-013-0236-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-013-0236-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T02:10:51Z","timestamp":1559268651000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10844-013-0236-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,13]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["236"],"URL":"https:\/\/doi.org\/10.1007\/s10844-013-0236-9","relation":{},"ISSN":["0925-9902","1573-7675"],"issn-type":[{"value":"0925-9902","type":"print"},{"value":"1573-7675","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3,13]]}}}