{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:35:48Z","timestamp":1725665748706},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642278716"},{"type":"electronic","value":"9783642278723"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-27872-3_40","type":"book-chapter","created":{"date-parts":[[2012,2,29]],"date-time":"2012-02-29T06:38:51Z","timestamp":1330497531000},"page":"264-271","source":"Crossref","is-referenced-by-count":0,"title":["A Fast and Effective Partitioning Algorithm for Document Clustering"],"prefix":"10.1007","author":[{"given":"Rajeev","family":"Kumar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alok","family":"Ranjan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joydip","family":"Dhar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"40_CR1","unstructured":"Berkhin, P.: Survey of clustering data mining techniques, Accrue Software Paper (2002)"},{"key":"40_CR2","doi-asserted-by":"crossref","unstructured":"Hartigan, J., Wong, M.: Algorithm AS136: A k-means clustering algorithm. Applied Statistics, 100\u2013108 (1979)","DOI":"10.2307\/2346830"},{"key":"40_CR3","unstructured":"Arthur, D., Vassilvitskii, S.: K-means++: the advantages of careful seeding. In: ACM-SIAM Symposium on Discrete Algorithms (2007)"},{"key":"40_CR4","doi-asserted-by":"crossref","unstructured":"Mahdavi, M., Abolhassani, H.: Harmony k -means algorithm for document clustering. Data Mining and Knowledge Discovery (2009)","DOI":"10.1007\/s10618-008-0123-0"},{"key":"40_CR5","doi-asserted-by":"crossref","unstructured":"Cui, X., Potok, T.E., Palathingal, P.: Document clustering using particle swarm optimization. In: Proceedings IEEE Swarm Intelligence Symposium, pp. 185\u2013191 (2005)","DOI":"10.1109\/SIS.2005.1501621"},{"issue":"7","key":"40_CR6","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1109\/TPAMI.2002.1017616","volume":"24","author":"T. Kanungo","year":"2002","unstructured":"Kanungo, T., Mount, D.M., Netanyahu, N.S., Piatko, C.D., Silverman, R., Wu, A.Y.: An efficient k-means clustering algorithm: Analysis and implementation. IEEE Trans. Pattern Anal. Mach. Intell.\u00a024(7), 881\u2013892 (2002)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"3","key":"40_CR7","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 Survey\u00a031(3), 264\u2013323 (1999)","journal-title":"ACM Computing Survey"},{"issue":"5","key":"40_CR8","doi-asserted-by":"publisher","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. Information Systems\u00a025(5), 345\u2013366 (2000)","journal-title":"Information Systems"},{"issue":"2","key":"40_CR9","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1145\/276305.276312","volume":"27","author":"S. Guha","year":"1998","unstructured":"Guha, S., Rastogi, R., Shim, K.: Cure: an efficient clustering algorithm for large databases. SIGMOD Rec.\u00a027(2), 73\u201384 (1998)","journal-title":"SIGMOD Rec."},{"issue":"8","key":"40_CR10","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/2.781637","volume":"32","author":"G. Karypis","year":"1999","unstructured":"Karypis, G., News, V.K.: Chameleon: Hierarchical clustering using dynamic modeling. Computer\u00a032(8), 68\u201375 (1999)","journal-title":"Computer"},{"key":"40_CR11","unstructured":"Han, E.H., Karypis, G., Kumar, V., Mobasher, B.: Hypergraph based clustering in high-dimensional data sets: A summary of results. Data Engineering Bulletin, 15\u201322 (1998)"},{"key":"40_CR12","unstructured":"Ng, R., Han, J.: Efficient and effective clustering method for spatial data mining. In: Proceedings of the 20th VLDB Conference, Santiago, Chile, pp. 144\u2013155 (1994)"},{"key":"40_CR13","doi-asserted-by":"crossref","unstructured":"Zahn, K.: Graph-theoretical methods for detecting and describing gestalt clusters. IEEE Transactions on Computers, 68\u201386 (1971)","DOI":"10.1109\/T-C.1971.223083"},{"key":"40_CR14","doi-asserted-by":"crossref","unstructured":"Chandrasekharan, M., Rajagopalan, R.: An ideal seed non-hierarchical clustering algorithm for cellular manufacturing. International Journal of Production Research, 451\u2013464 (1986)","DOI":"10.1080\/00207548608919741"},{"key":"40_CR15","unstructured":"Jain, A.K., Dubes, R.C.: Algorithms for Clustering Data. Prentice Hall (1988)"},{"issue":"3","key":"40_CR16","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1023\/B:MACH.0000027785.44527.d6","volume":"55","author":"Y. Zhao","year":"2004","unstructured":"Zhao, Y., Karypis, G.: Empirical and theoretical comparisons of selected criterion functions for document clustering. Machine Learning\u00a055(3), 311\u2013331 (2004)","journal-title":"Machine Learning"},{"key":"40_CR17","doi-asserted-by":"crossref","unstructured":"Zhao, Y., Karypis, G.: Evaluation of hierarchical clustering algorithms for document datasets. In: CIKM Proceedings of the Eleventh International Conference on Information and Knowledge Management, pp. 515\u2013524. ACM Press (2002)","DOI":"10.1145\/584792.584877"},{"key":"40_CR18","doi-asserted-by":"crossref","unstructured":"Zha, H., He, X., Ding, C., Simon, H., Gu, M.: Bipartite graph partitioning and data clustering. In: CIKM (2001)","DOI":"10.2172\/816202"},{"key":"40_CR19","doi-asserted-by":"crossref","unstructured":"Dhillon, I.S.: Co-clustering documents and words using bipartite spectral graph partitioning, Technical Report, Department of Computer Science, University of Texas, Austin (2001)","DOI":"10.1145\/502512.502550"},{"key":"40_CR20","unstructured":"Salton, G.: Automatic Text Processing: The Transformation, Analysis, and Retrieval of Information by Computer. Addison-Wesley (1989)"},{"key":"40_CR21","unstructured":"Zhao, Y., Karypis, G.: Criterion functions for document clustering: Experiments and analysis, Technical Report, University of Minnesota, pp. 01\u201340 (2001)"},{"key":"40_CR22","unstructured":"Stein, B., Eissen, S.M.Z., Wi\u00dfbrock, F.: On cluster validity and the information need of users. In: Proceedings Artificial Intelligence and Applications, pp. 373, 522, 531, 533 (2003)"},{"key":"40_CR23","unstructured":"Dataset from Karypis Lab, \n                    \n                      http:\/\/glaros.dtc.umn.edu\/gkhome\/fetch\/sw\/cluto\/datasets.tar.gz"}],"container-title":["Lecture Notes in Computer Science","Data Engineering and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-27872-3_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T04:29:15Z","timestamp":1556425755000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-27872-3_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642278716","9783642278723"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-27872-3_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}