{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T03:50:17Z","timestamp":1725594617678},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642219368"},{"type":"electronic","value":"9783642219375"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-21937-5_11","type":"book-chapter","created":{"date-parts":[[2011,7,1]],"date-time":"2011-07-01T10:25:51Z","timestamp":1309515951000},"page":"110-122","source":"Crossref","is-referenced-by-count":5,"title":["Two-Stage Clustering with k-Means Algorithm"],"prefix":"10.1007","author":[{"given":"Raied","family":"Salman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vojislav","family":"Kecman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qi","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Strack","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erick","family":"Test","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"Arhter, D., Vassilvitskii, S.: How Slow is the kMeans Method? In: SCG 2006, Sedona, Arizona, USA (2006)"},{"key":"11_CR2","unstructured":"Elkan, C.: Using the Triangle Inequality to Accelerate K \u2013Means. In: Proceedings of the Twentieth International Conference on Machine Learning (ICML-2003), Washington DC (2003)"},{"key":"11_CR3","unstructured":"Pakhira, M.K.: A Modified k-means Algorithm to Avoid Empty Clusters. International Journal of Recent Trends in Engineering\u00a01(1) (May 2009)"},{"key":"11_CR4","volume-title":"Pattern Classification","author":"R.O. Dude","year":"2000","unstructured":"Dude, R.O., Hart, P.E., Stork, D.G.: Pattern Classification. Wiley-Interscience Publication, Hoboken (2000)"},{"issue":"3","key":"11_CR5","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s00453-004-1127-9","volume":"41","author":"S. Har-Peled","year":"2005","unstructured":"Har-Peled, S., Sadri, B.: How fast is the k-means method? Algorithmica\u00a041(3), 185\u2013202 (2005)","journal-title":"Algorithmica"},{"key":"11_CR6","series-title":"Technical Report of Microsoft Research Center","volume-title":"Refining Initial Points for Kmeans Clustering","author":"P.S. Bradley","year":"1998","unstructured":"Bradley, P.S., Fayyad, U.M.: Refining Initial Points for Kmeans Clustering. Technical Report of Microsoft Research Center. Redmond,California, USA (1998)"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Wu, F.X.: Genetic weighted k-means algorithm for clustering large-scale gene expression data. BMC Bioinformatics\u00a09 (2008)","DOI":"10.1186\/1471-2105-9-S6-S12"},{"issue":"11","key":"11_CR8","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1016\/j.patrec.2004.04.007","volume":"25","author":"S.S. Khan","year":"2004","unstructured":"Khan, S.S., Ahmed, A.: Cluster center initialization for Kmeans algorithm. Pattern Recognition Letters\u00a025(11), 1293\u20131302 (2004)","journal-title":"Pattern Recognition Letters"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0034-4257(88)90045-4","volume":"25","author":"M.E. Hodgson","year":"1988","unstructured":"Hodgson, M.E.: Reducing computational requirements of the minimum-distance classifier. Remote Sensing of Environments\u00a025, 117\u2013128 (1988)","journal-title":"Remote Sensing of Environments"}],"container-title":["Communications in Computer and Information Science","Recent Trends in Wireless and Mobile Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21937-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T18:26:18Z","timestamp":1553883978000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21937-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642219368","9783642219375"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21937-5_11","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2011]]}}}