{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:07:13Z","timestamp":1761894433718},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2007,1]]},"DOI":"10.1007\/s11227-006-0002-7","type":"journal-article","created":{"date-parts":[[2006,12,12]],"date-time":"2006-12-12T09:08:24Z","timestamp":1165914504000},"page":"19-37","source":"Crossref","is-referenced-by-count":33,"title":["Parallel bisecting k-means with prediction clustering algorithm"],"prefix":"10.1007","volume":"39","author":[{"given":"Yanjun","family":"Li","sequence":"first","affiliation":[]},{"given":"Soon M.","family":"Chung","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","unstructured":"Anderberg MR (1973) Cluster analysis for applications. Academic Press"},{"key":"2_CR2","unstructured":"Bradley P, Fayyad U (1998) Refining initial points for k-means clustering. In: Proc. of the 15th int\u2019l conf. on machine learning\u2013ICML\u201998. pp. 91\u201399"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Cutting DR, Karger DR, Pedersen JO, Tukey JW (1992) Scatter\/Gather: a cluster-based approach to browsing large document collections. In: Proc. of the 15th ACM SIGIR conf. on research and development in information retrieval, pp 318\u2013329","DOI":"10.1145\/133160.133214"},{"issue":"11","key":"2_CR4","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1145\/240455.240477","volume":"39","author":"DE Culler","year":"1996","unstructured":"Culler DE, Karp RM, Patterson D, Sahay A, Santos EE, Schauser KE, Subramonian R, von Eicken T (1996) LogP: a practical model of parallel computation. Commun ACM 39(11):78\u201385","journal-title":"Commun ACM"},{"key":"2_CR5","unstructured":"Dhillon IS, Modha DS (2000) A data-clustering algorithm on distributed memory multiprocessors. In: Large-scale parallel data mining, LNCS 1759. Springer-Verlag"},{"issue":"2","key":"2_CR6","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1109\/TIT.1982.1056488","volume":"28","author":"MR Garey","year":"1982","unstructured":"Garey MR, Johnson DS, Witsenhausen HS (1982) Complexity of the generalized lloyd-max problem. IEEE Trans Inf Theory 28(2):256\u2013257","journal-title":"IEEE Trans Inf Theory"},{"key":"2_CR7","unstructured":"Hartigan JA (1975) Clustering algorithms. John Wiley & Sons"},{"issue":"3","key":"2_CR8","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"AK Jain","year":"1999","unstructured":"Jain AK, Murty MN, Flynn PJ (1999) Data clustering: a review. ACM Comput Surv 31(3):264\u2013323","journal-title":"ACM Comput Surv"},{"issue":"1","key":"2_CR9","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF02294153","volume":"50","author":"G Milligan","year":"1985","unstructured":"Milligan G (1985) An algorithm for creating artificial test clusters. Psychometrika 50(1):123\u2013127","journal-title":"Psychometrika"},{"issue":"8","key":"2_CR10","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1109\/TKDE.2004.25","volume":"16","author":"C Ordonez","year":"2004","unstructured":"Ordonez C, Omiecinski E (2004) Efficient disk-based k-Means Clustering for Relational Databases. IEEE Trans Knowl Data Engi 16(8):909\u2013921","journal-title":"IEEE Trans Knowl Data Engi"},{"key":"2_CR11","unstructured":"Salton G (1988) Automatic text processing: the transformation. analysis, and retrieval information by Computer. Addison-Wesley"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Shannon CE (1948) A mathematical theory of communication, Bell Syst Techn 27(July\/October):379\u2013423 and 623\u2013656","DOI":"10.1002\/j.1538-7305.1948.tb00917.x"},{"key":"2_CR13","unstructured":"Steinbach M, Karypis G, Kumar V (2000) A comparison of document clustering techniques. KDD Workshop on Text Mining"},{"key":"2_CR14","unstructured":"UCI Machine learning repository, http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html"},{"issue":"3","key":"2_CR15","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1023\/B:MACH.0000027785.44527.d6","volume":"55","author":"Y Zhao","year":"2004","unstructured":"Zhao Y, Karypis G (2004) Empirical and theoretical comparisons of selected criterion functions for document clustering. Machine Learning 55(3):311\u2013331","journal-title":"Machine Learning"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-006-0002-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-006-0002-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-006-0002-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T10:24:57Z","timestamp":1559384697000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-006-0002-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,1]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,1]]}},"alternative-id":["2"],"URL":"https:\/\/doi.org\/10.1007\/s11227-006-0002-7","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,1]]}}}