{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:49:52Z","timestamp":1725461392218},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642374494"},{"type":"electronic","value":"9783642374500"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37450-0_15","type":"book-chapter","created":{"date-parts":[[2013,4,17]],"date-time":"2013-04-17T05:41:52Z","timestamp":1366177312000},"page":"210-218","source":"Crossref","is-referenced-by-count":3,"title":["MAKM: A MAFIA-Based k-Means Algorithm for Short Text in Social Networks"],"prefix":"10.1007","author":[{"given":"Pengfei","family":"Ma","sequence":"first","affiliation":[]},{"given":"Yong","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"Goil, S.: MAFIA: efficient and scalable subspace clustering for very large (1999)"},{"key":"15_CR2","unstructured":"Elkan, C.: Using the triangle inequality to accelerate k-means. In: ICML, pp. 147\u2013153 (2003)"},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1023\/A:1009769707641","volume":"2","author":"Z. Huang","year":"1998","unstructured":"Huang, Z.: Extensions to the k-Means Algorithm for Clustering Large Data Sets with Categorical Values. Data Mining and Knowledge Discovery\u00a02, 283\u2013304 (1998)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"15_CR4","unstructured":"Hassan-Montero, Y., Herrero-Solana, V.: Improving Tag-Clouds as Visual Information Retrieval Interfaces, Spain, October 25-28 (2006)"},{"key":"15_CR5","unstructured":"Bradley, P.S., Fayyad, U.M.: Refining Initial Points for K-Means Clustering. In: ICML (1998)"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Lu, J.F., Tang, J.B., Tang, Z.M., Yang, J.Y.: Hierarchical initialization approach for K-Means clustering. Pattern Recognition Letters (2008)","DOI":"10.1016\/j.patrec.2007.12.009"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-642-03685-9_2","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"A. Aggarwal","year":"2009","unstructured":"Aggarwal, A., Deshpande, A., Kannan, R.: Adaptive Sampling for k-Means Clustering. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX 2009. LNCS, vol.\u00a05687, pp. 15\u201328. Springer, Heidelberg (2009)"},{"key":"15_CR8","unstructured":"Arai, K., Barakbah, A.R.: Hierarchical K-means: an algorithm for centroids initialization for K-means. In: Reports of the Faculty of Science and Engineering, vol.\u00a036(1), Saga University, Japan (2007)"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37450-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T10:48:02Z","timestamp":1557658082000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37450-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642374494","9783642374500"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37450-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}