{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T05:04:06Z","timestamp":1747890246918,"version":"3.41.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,4,7]],"date-time":"2015-04-07T00:00:00Z","timestamp":1428364800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s10586-015-0450-z","type":"journal-article","created":{"date-parts":[[2015,4,6]],"date-time":"2015-04-06T08:25:15Z","timestamp":1428308715000},"page":"933-948","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["A parallel text document clustering algorithm based on neighbors"],"prefix":"10.1007","volume":"18","author":[{"given":"Yanjun","family":"Li","sequence":"first","affiliation":[]},{"given":"Congnan","family":"Luo","sequence":"additional","affiliation":[]},{"given":"Soon M.","family":"Chung","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,7]]},"reference":[{"key":"450_CR1","doi-asserted-by":"crossref","unstructured":"Aboutabl, A.E., Elsayed, M.N.: A novel parallel algorithm for clustering documents based on the hierarchical agglomerative approach. Int. J. Comput. Sci. Inf. Technol. (IJCSIT). 3(2), 152\u2013163 (2011)","DOI":"10.5121\/ijcsit.2011.3211"},{"key":"450_CR2","doi-asserted-by":"crossref","unstructured":"Bobda, C., Steenbock, N.: Singular value decomposition on distributed reconfigurable systems. In: Proceedings of the 12th International Workshop on Rapid System Prototyping, pp. 38\u201343 (2001)","DOI":"10.1109\/IWRSP.2001.933836"},{"key":"450_CR3","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1137\/0906007","volume":"6","author":"RP Brent","year":"1985","unstructured":"Brent, R.P., Luk, F.T.: The solution of singular-value and symmetric eigen-value problems on multiprocessor arrays. SIAM J. Sci. Stat. Comput. 6, 69\u201384 (1985)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"450_CR4","doi-asserted-by":"crossref","unstructured":"Cao, Z., Zhou, Y. : Parallel text clustering based on MapReduce. In: Proceedings of the 2nd International Conference on Cloud and Green Computing, pp. 226\u2013229 (2012)","DOI":"10.1109\/CGC.2012.128"},{"key":"450_CR5","doi-asserted-by":"crossref","unstructured":"Cutting, D.R., Karger, D.R., Pedersen, J.O., Tukey, J.W.: Scatter\/gather: a cluster-based approach to browsing large document collections. In: Proceedings of the ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 318\u2013329 (1992)","DOI":"10.1145\/133160.133214"},{"key":"450_CR6","doi-asserted-by":"crossref","unstructured":"Dhillon, I.S., Modha, D.S.: A data-clustering algorithm on distributed memory multiprocessors. In: Large-Scale Parallel Data Mining, LNCS, vol. 1759, pp. 245\u2013260. Springer, Heidelberg (2000)","DOI":"10.1007\/3-540-46502-2_13"},{"issue":"2","key":"450_CR7","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1145\/380995.381010","volume":"2","author":"G Forman","year":"2000","unstructured":"Forman, G., Zhang, B.: Distributed data clustering can be efficient and exact. SIGKDD Explor. Newsl. 2(2), 34\u201338 (2000)","journal-title":"SIGKDD Explor. Newsl."},{"issue":"2","key":"450_CR8","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1109\/TIT.1982.1056488","volume":"28","author":"MR Garey","year":"1982","unstructured":"Garey, M.R., Johnson, D.S., Witsenhausen, H.S.: Complexity of the generalized Lloyd\u2013Max problem. IEEE Trans. Inf. Theory 28(2), 256\u2013257 (1982)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"450_CR9","doi-asserted-by":"crossref","unstructured":"Garg, A., Mangla, A., Gupta, N., Bhatnagar, V.: PBIRCH: a scalable parallel clustering algorithm for incremental data. In: Proceedings of the International Database Engineering and Applications Symposium, pp. 315\u2013316 (2006)","DOI":"10.1109\/IDEAS.2006.36"},{"issue":"5","key":"450_CR10","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/S0306-4379(00)00022-3","volume":"25","author":"S Guha","year":"2000","unstructured":"Guha, S., Rastogi, R., Shim, K.: ROCK: a robust clustering algorithm for categorical attributes. Inf. Syst. 25(5), 345\u2013366 (2000)","journal-title":"Inf. Syst."},{"key":"450_CR11","volume-title":"Clustering Algorithms","author":"JA Hartigan","year":"1975","unstructured":"Hartigan, J.A.: Clustering Algorithms. Wiley, New York (1975)"},{"key":"450_CR12","volume-title":"Algorithms for Clustering Data","author":"AK Jain","year":"1988","unstructured":"Jain, A.K., Dubes, R.C.: Algorithms for Clustering Data. Prentice Hall, Englewood Cliffs (1988)"},{"key":"450_CR13","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316801","volume-title":"Finding Groups in Data: An Introduction to Cluster Analysis","author":"L Kaufman","year":"1990","unstructured":"Kaufman, L., Rousseeuw, P.J.: Finding Groups in Data: An Introduction to Cluster Analysis. Wiley, New York (1990)"},{"key":"450_CR14","doi-asserted-by":"crossref","unstructured":"Larsen, B., Aone, C.: Fast and effective text mining using linear-time document clustering. In: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 16\u201322 (1999)","DOI":"10.1145\/312129.312186"},{"key":"450_CR15","unstructured":"Lewis, D., Yang, Y., Rose, T., Li, F.: RCV1: a new benchmark collection for text categorization research. J. Mach. Learn. Res. 5, 361\u2013397 (2004). Information about RCV1. http:\/\/www.daviddlewis.com\/resources\/testcollections\/rcv1\/ Accessed 20 Oct 2014"},{"issue":"3","key":"450_CR16","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0167-8191(89)90036-7","volume":"11","author":"X Li","year":"1989","unstructured":"Li, X., Fang, Z.: Parallel clustering algorithms. Parallel Comput. 11(3), 275\u2013290 (1989)","journal-title":"Parallel Comput."},{"issue":"1","key":"450_CR17","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/s11227-006-0002-7","volume":"39","author":"Y Li","year":"2007","unstructured":"Li, Y., Chung, S.M.: Parallel bisecting K-means with prediction clustering algorithm. J. Supercomput. 39(1), 19\u201337 (2007)","journal-title":"J. Supercomput."},{"key":"450_CR18","doi-asserted-by":"crossref","unstructured":"Li, Y., Chung, S.M., Holt, J.D.: Text document clustering based on frequent word meaning sequences. Data Knowl. Eng. 64(1), 381\u2013404 (2008)","DOI":"10.1016\/j.datak.2007.08.001"},{"issue":"5","key":"450_CR19","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1109\/TKDE.2007.190740","volume":"20","author":"Y Li","year":"2008","unstructured":"Li, Y., Luo, C., Chung, S.M.: Text clustering with feature selection by using statistical data. IEEE Trans Knowl. Data Eng. 20(5), 641\u2013652 (2008)","journal-title":"IEEE Trans Knowl. Data Eng."},{"key":"450_CR20","unstructured":"Liu, G., Wang, Y., Zhao, T., Li, D.: Research on the parallel text clustering algorithm based on the semantic tree. In: Proceedings of the 6th International Conference on Computer Sciences and Convergence Information Technology, pp. 400\u2013403 (2011)"},{"issue":"11","key":"450_CR21","doi-asserted-by":"crossref","first-page":"1271","DOI":"10.1016\/j.datak.2009.06.007","volume":"68","author":"C Luo","year":"2009","unstructured":"Luo, C., Li, Y., Chung, S.M.: Text document clustering based on neighbors. Data Knowl. Eng. 68(11), 1271\u20131288 (2009)","journal-title":"Data Knowl. Eng."},{"key":"450_CR22","doi-asserted-by":"crossref","unstructured":"Mogill, J.A., Haglin, D.J.: Toward parallel document clustering. In: Proceedings of the IEEE International Symposium on Parallel and Distributed Processing (IPDPS) Workshops and PhD Forum, pp. 1700\u20131709 (2011)","DOI":"10.1109\/IPDPS.2011.327"},{"key":"450_CR23","unstructured":"Moore, A.W.: The anchors hierarchy: using the triangle inequality to survive high dimensional data. In: Proceedings of the 12th Conference on Uncertainty in Artificial Intelligence, pp. 397\u2013405 (2000)"},{"key":"450_CR24","doi-asserted-by":"crossref","first-page":"1313","DOI":"10.1016\/0167-8191(95)00017-I","volume":"21","author":"CF Olson","year":"1995","unstructured":"Olson, C.F.: Parallel algorithms for hierarchical clustering. Parallel Comput. 21, 1313\u20131325 (1995)","journal-title":"Parallel Comput."},{"issue":"8","key":"450_CR25","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.: Efficient disk-based K-means clustering for relational databases. IEEE Trans. Knowl. Data Eng. 16(8), 909\u2013921 (2004)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"450_CR26","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1109\/71.89059","volume":"2","author":"S Ranka","year":"1991","unstructured":"Ranka, S., Sahni, S.: Clustering on a hypercube multicomputer. IEEE Trans. Parallel Distrib. Syst. 2(2), 129\u2013137 (1991)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"450_CR27","volume-title":"Information Retrieval","author":"CJ Rijsbergen van","year":"1979","unstructured":"van Rijsbergen, C.J.: Information Retrieval, 2nd edn. Buttersworth, London (1979)","edition":"2"},{"key":"450_CR28","unstructured":"Steinbach, M., Karypis, G., Kumar, V.: A comparison of document clustering techniques. KDD Workshop on Text Mining (2000)"},{"key":"450_CR29","unstructured":"Zhang, Y., Sun, J., Zhang, Y., Zhang, X.: Parallel implementation of CLARANS using PVM. In: Proceedings of the 2004 International Conference on Machine Learning and Cybernetics, vol. 3, pp. 1646\u20131649 (2004)"},{"key":"450_CR30","doi-asserted-by":"crossref","unstructured":"Zhao, Y., Karypis, G.: Comparison of agglomerative and partitional document clustering algorithms. Technical Report# TR 02-014, Department of Computer Science, University of Minnesota, Minneapolis (2002)","DOI":"10.21236\/ADA439503"}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-015-0450-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10586-015-0450-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-015-0450-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T22:57:06Z","timestamp":1747868226000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10586-015-0450-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,7]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["450"],"URL":"https:\/\/doi.org\/10.1007\/s10586-015-0450-z","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"type":"print","value":"1386-7857"},{"type":"electronic","value":"1573-7543"}],"subject":[],"published":{"date-parts":[[2015,4,7]]}}}