{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:48:44Z","timestamp":1743007724475,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642250842"},{"type":"electronic","value":"9783642250859"}],"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-25085-9_76","type":"book-chapter","created":{"date-parts":[[2011,11,11]],"date-time":"2011-11-11T10:03:34Z","timestamp":1321005814000},"page":"638-645","source":"Crossref","is-referenced-by-count":13,"title":["A New Clustering Algorithm Based on K-Means Using a Line Segment as Prototype"],"prefix":"10.1007","author":[{"given":"Juan Carlos Rojas","family":"Thomas","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"76_CR1","doi-asserted-by":"crossref","unstructured":"Jain, A.K., Murty, M.N., Flynn, O.J.: Data Clustering: a review. ACM Computing Surveys\u00a031(3) (September 1999)","DOI":"10.1145\/331499.331504"},{"key":"76_CR2","doi-asserted-by":"crossref","unstructured":"Gan, G., Ma, C., Wu, J.: Data Clustering Theory, algorithms and applications. SIAM, Society for Industrial and Applied Mathematics (May 30, 2007)","DOI":"10.1137\/1.9780898718348"},{"key":"76_CR3","unstructured":"Fahim, M., Saake, G., Salem, A.M., Torkey, F.A., Ramadan, M.A.: K-Means for Spherical Clusters with Large Variance in Sizes. In: Proceedings of World Academy of Science, Engineering and Technology, Paris, vol.\u00a035, pp. 177\u2013182 (November 2008) ISSN 2070-3740"},{"key":"76_CR4","doi-asserted-by":"crossref","unstructured":"Guha, S., Rastogi, R., Shim, K.: CURE: An Efficient Clustering Algorithms for Large Databases. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, Seattle, WA, pp. 73\u201384 (1998)","DOI":"10.1145\/276304.276312"},{"key":"76_CR5","volume-title":"Pattern Recognition and Machine Learning","author":"C.M. Bishop","year":"2006","unstructured":"Bishop, C.M.: Pattern Recognition and Machine Learning. Springer, Heidelberg (2006)"},{"key":"76_CR6","unstructured":"Theodoridis, S., Koutroumbas, K.: Pattern Recognition, 3rd edn. (2006)"},{"key":"76_CR7","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1243\/095440605X8298","volume":"219","author":"D.T. Pham","year":"2004","unstructured":"Pham, D.T., Dimov, S.S., Nguyen, C.D.: Selection of k in K-means clustering. Mechanical Engineering Science\u00a0219, 103\u2013119 (2004)","journal-title":"Mechanical Engineering Science"},{"key":"76_CR8","first-page":"727","volume-title":"Proceedings of Seventeenth International Conference on Machine Learning","author":"D. Pelleg","year":"2000","unstructured":"Pelleg, D., Moore, A.: x-means: Extending k-means with efficient estimation of the number of clusters. In: Proceedings of Seventeenth International Conference on Machine Learning, pp. 727\u2013734. Morgan Kaufmann, San Francisco (2000)"},{"key":"76_CR9","first-page":"138","volume":"22","author":"V. Faber","year":"1994","unstructured":"Faber, V.: Clustering and the continuous k-means algorithm. Los Alamos Science\u00a022, 138\u2013144 (1994)","journal-title":"Los Alamos Science"},{"key":"76_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/3-540-45643-0_13","volume-title":"Algorithm Engineering and Experiments","author":"S. Phillips","year":"2002","unstructured":"Phillips, S.: Acceleration of K-means and Related Clustering Algorithms. In: Mount, D.M., Stein, C. (eds.) ALENEX 2002. LNCS, vol.\u00a02409, pp. 166\u2013177. Springer, Heidelberg (2002)"},{"issue":"3","key":"76_CR11","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 Minig and Knowledge Discovery\u00a02(3), 283\u2013304 (1998)","journal-title":"Data Minig and Knowledge Discovery"},{"key":"76_CR12","first-page":"91","volume-title":"Proceedings of the 15th International Conference on Machine Learning","author":"P.S. Bradley","year":"1998","unstructured":"Bradley, P.S., Fayyad, U.M.: Refining initial points for k-means clustering. In: Proceedings of the 15th International Conference on Machine Learning, pp. 91\u201399. Morgan Kaufmann, San Francisco (1998)"},{"key":"76_CR13","first-page":"323","volume":"26","author":"S. Deelers","year":"2007","unstructured":"Deelers, S., Auwatanamongkol, S.: Enhancing K-Means Algorithm with Initial Cluster Centers Derived from Data Partitioning along the Data Axis with the Highest Variance. PWASET\u00a026, 323\u2013328 (2007)","journal-title":"PWASET"}],"container-title":["Lecture Notes in Computer Science","Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25085-9_76","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,19]],"date-time":"2019-06-19T08:00:56Z","timestamp":1560931256000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25085-9_76"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642250842","9783642250859"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25085-9_76","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}