{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:55:27Z","timestamp":1764996927534,"version":"3.40.1"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,2,15]],"date-time":"2012-02-15T00:00:00Z","timestamp":1329264000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1007\/s13042-012-0079-7","type":"journal-article","created":{"date-parts":[[2012,2,14]],"date-time":"2012-02-14T06:36:14Z","timestamp":1329201374000},"page":"107-117","source":"Crossref","is-referenced-by-count":39,"title":["A hybrid approach to speed-up the k-means clustering method"],"prefix":"10.1007","volume":"4","author":[{"given":"T. Hitendra","family":"Sarma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Viswanath","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B. Eswara","family":"Reddy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,2,15]]},"reference":[{"key":"79_CR1","unstructured":"Almedia MB, Braga A, Braga JP (2000) Svm-km: speeding svms learning with a priory cluster selection and k-means. In: Proceedings of the sixth Brazilian Symposium on Neural Networks 162\u2013167"},{"key":"79_CR2","unstructured":"Alsabti K, Ranka S, Singh V (1998) An efficient k-means clustering algorithm. In: Proceedings of First Workshop High Performance Data Mining (March 1998)"},{"key":"79_CR3","doi-asserted-by":"crossref","first-page":"2249","DOI":"10.1016\/S0031-3203(01)00028-0","volume":"34","author":"V Ananthanarayana","year":"2001","unstructured":"Ananthanarayana V, Murty M, Subramanian D (2001) An incremental data mining algorithm for compact realization of prototypes. Pattern Recognit 34:2249\u20132251","journal-title":"Pattern Recognit"},{"key":"79_CR4","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1016\/S0031-3203(00)00094-7","volume":"34","author":"TR Babu","year":"2001","unstructured":"Babu TR, Murty MN (2001) Comparison of genetic algorithms based prototype selection schemes. Pattern Recognit 34:523\u2013525","journal-title":"Pattern Recognit"},{"key":"79_CR5","unstructured":"Berkhin P (2002) Survey of clustering data mining techniques. Technical Report, Accure Software"},{"key":"79_CR6","doi-asserted-by":"crossref","unstructured":"Bidyut Kr. Patra, Sukumar Nandi, Viswanath P (2011) A distance based clustering method for arbitrary shaped clusters in large data-sets. Pattern Recognit 44:2862\u20132870","DOI":"10.1016\/j.patcog.2011.04.027"},{"key":"79_CR7","unstructured":"Bottou L, Bengio Y (1995) Convergence properties of the k-means algorithms. In: Advances in Neural Information Processing Systems 7, MIT Press, Cambridge, pp. 585\u2013592"},{"key":"79_CR8","unstructured":"Bradley PS, Fayyad U, Raina C (1998) Scaling clustering algorithms to large databases. In: Proceedings of Fourth International Conference on Knowledge Discovery and Data Mining, AAAI Press, pp 9\u201315"},{"key":"79_CR9","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1016\/j.patcog.2009.09.019","volume":"43","author":"R Chitta","year":"2010","unstructured":"Chitta R, Murthy MN (2010) Two-level k-means clustering algorithm for k- $$\\tau$$ relationship establishment and linear-time classification. Pattern Recognit 43:796\u2013804","journal-title":"Pattern Recognit"},{"key":"79_CR10","unstructured":"Davidson I, Satyanarayana A (2004) Speeding up k-means clustering by bootstrap averaging. IEEE ICDM"},{"key":"79_CR11","unstructured":"Domingos P, Hulten G (2001) A general method for scaling up machine learning algorithms and its application to clustering. Eighteenth International Conference on Machine Learning"},{"issue":"1","key":"79_CR12","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1145\/360402.360419","volume":"2","author":"F Farnstrom","year":"2000","unstructured":"Farnstrom F, Lewis J, Elkan C (2000) Scalability for clustering algorithms revisited. SIGKDD Explor 2(1):51\u201357","journal-title":"SIGKDD Explor"},{"key":"79_CR13","doi-asserted-by":"crossref","unstructured":"Gereon Frahling, Christian Sohler (2006) A fast k-means implementation using coresets. In: Proceedings of the twenty-second annual symposium on Computational geometry (SCG \u201906), pp. 135\u2013143. ACM Press, New York, USA","DOI":"10.1145\/1137856.1137879"},{"key":"79_CR14","unstructured":"Gongde Guo, Si Chen, Lifei Chen (2011) Soft subspace clustering with an improved feature weight self-adjustment mechanism. Int J Mach Learn Cybern. doi: 10.1007\/s13042-011-0038"},{"key":"79_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0019-9","volume-title":"Convex Polytopes, 2nd edn","author":"B Grunbaum","year":"2003","unstructured":"Grunbaum B (2003) Convex Polytopes, 2nd edn. Springer, New York"},{"key":"79_CR16","doi-asserted-by":"crossref","unstructured":"Guha S, Rastogi R, Shim K (1998) Cure:an efficient clustering algorithm for large databases. In: Proceedings of Conference Management of Data (ACM SIGMOD\u201998), pp 73\u201384","DOI":"10.1145\/276305.276312"},{"key":"79_CR17","unstructured":"Han J, Kamber M (2000) Data mining: concepts and techniques. 2nd edn. Morgan Kaufmann, USA"},{"key":"79_CR18","volume-title":"Clustering algorithms","author":"JA Hartigan","year":"1975","unstructured":"Hartigan JA (1975) Clustering algorithms. Wiley, New York"},{"key":"79_CR19","volume-title":"Algorithms for clustering data","author":"A Jain","year":"1988","unstructured":"Jain A, Dubes R (1988) Algorithms for clustering data. Prentice Hall, Englewood Cliffs"},{"issue":"3","key":"79_CR20","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"A Jain","year":"1999","unstructured":"Jain A, Murthy MN, Flynn PJ (1999) Data clustering: a review. ACM Comput Surv 31(3):264\u2013323","journal-title":"ACM Comput Surv"},{"issue":"8","key":"79_CR21","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1016\/j.patrec.2009.09.011","volume":"31","author":"AK Jain","year":"2010","unstructured":"Jain AK (2010) Data clustering: 50\u00a0years beyond k-means. Pattern Recognit Lett 31(8):651\u2013666","journal-title":"Pattern Recognit Lett"},{"issue":"1","key":"79_CR22","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1109\/34.824819","volume":"22","author":"AK Jain","year":"2000","unstructured":"Jain AK, Duin P, Mao J (2000) Statistical pattern recognition: A review. IEEE Transact Pattern Anal Mach Intell 22(1):4\u201337","journal-title":"IEEE Transact Pattern Anal Mach Intell"},{"key":"79_CR23","doi-asserted-by":"crossref","unstructured":"Liang J, Song W (2011) Clustering based on steiner points. Int J Mach Learn Cybern. doi: 10.1007\/s13042-011-0047-7","DOI":"10.1007\/s13042-011-0047-7"},{"key":"79_CR24","unstructured":"Abdul Nazeer KA, Sebastian MP (2009) Improving the accuracy and efficiency of the k-means clustering algorithm. In: Proceedings of the World Congress on Engineering 2009 vol I. London, U.K."},{"key":"79_CR25","doi-asserted-by":"crossref","unstructured":"Kanungo T, Mount D, Netanyahu N, Piatko C, Silverman R, Wu A The analysis of a simple k-means clustering algorithm. In: Proceedings of 16th Annual ACM Symposium Computational Geometry, pp 100\u2013109 (June 2000)","DOI":"10.21236\/ADA458738"},{"issue":"7","key":"79_CR26","doi-asserted-by":"crossref","first-page":"881","DOI":"10.1109\/TPAMI.2002.1017616","volume":"24","author":"T Kanungo","year":"2002","unstructured":"Kanungo T, Mount DM, Netanyahu NS, christine D Piatko, Silverman R, Wu AY (2002) An efficient k-means clustering algorithm: Analysis and implementation. IEEE Transact Pattern Anal Mach Intell 24(7):881\u2013892","journal-title":"IEEE Transact Pattern Anal Mach Intell"},{"key":"79_CR27","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 (1990) Finding groups in data: an introduction to cluster analysis. Wiley, New York"},{"issue":"3","key":"79_CR28","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1109\/3477.764879","volume":"29","author":"K Krishna","year":"1999","unstructured":"Krishna K, Murty M (1999) Genetic k-means algorithm. IEEE Transact Syst Man Cybern Part B Cybern 29(3):433\u2013439","journal-title":"IEEE Transact Syst Man Cybern Part B Cybern"},{"key":"79_CR29","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"SP Lloyd","year":"1982","unstructured":"Lloyd SP (1982) Least squares quantization in PCM. IEEE Transact Inf Theory 28:129\u2013137","journal-title":"IEEE Transact Inf Theory"},{"key":"79_CR30","doi-asserted-by":"crossref","unstructured":"Lu Y, Lu S, Fotouhi F, Deng Y, Brown SJ (2004) Fgka: A fast genetic k-means clustering algorithm. In: Proceedings of ACM Symposium on Applied Computing. pp 622\u2013623","DOI":"10.1145\/967900.968029"},{"key":"79_CR31","unstructured":"MacQueen JB (1967) Some methods for classification and analysis of multivariate observations. In: Proceedings of 5-th Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, University of California Press, Berkeley, pp. 281\u2013297"},{"issue":"1","key":"79_CR32","first-page":"220","volume":"1","author":"MK Pakhira","year":"2009","unstructured":"Pakhira MK (2009) A modified k-means algorithm to avoid empty clusters. Int J Recent Trends Eng 1(1):220\u2013226","journal-title":"Int J Recent Trends Eng"},{"issue":"1","key":"79_CR33","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1145\/1007730.1007731","volume":"6","author":"L parsons","year":"2004","unstructured":"parsons L, Haque E, Liu H (2004) Subspace clustering for high dimensional data: a review. ACM SIGKDD Explor Newsl 6(1): 90\u2013105","journal-title":"ACM SIGKDD Explor Newsl"},{"key":"79_CR34","doi-asserted-by":"crossref","unstructured":"Pelleg D, Moore A Accelerating exact k-means algorithms with geometric reasoning. In: Proceedings ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 277\u2013281 (Aug 1999)","DOI":"10.1145\/312129.312248"},{"key":"79_CR35","doi-asserted-by":"crossref","unstructured":"Pelleg D, Moore A (2000) x-means: Extending k-means with efficient estimation of the number of clusters. In: Proceedings of the 17th International Conference on Machine Learning (July 2000)","DOI":"10.1007\/3-540-44491-2_3"},{"key":"79_CR36","unstructured":"Murphy PM (1994) UCI Repository of Machine Learning Databases ( http:\/\/www.ics.uci.edu\/mlearn\/MLRepository.html ]. Department of Information and Computer Science, University of California, Irvine"},{"issue":"1","key":"79_CR37","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s10115-005-0210-0","volume":"10","author":"R Jin","year":"2006","unstructured":"Jin R, Goswami A, Agarwal G (2006) Fast and exact out-of-core and distributed k-means clustering. Knowl Inf Syst 10(1):17\u201340","journal-title":"Knowl Inf Syst"},{"issue":"7","key":"79_CR38","doi-asserted-by":"crossref","first-page":"1626","DOI":"10.1631\/jzus.2006.A1626","volume":"10","author":"AM Fahim","year":"2006","unstructured":"Fahim AM, Salem AM, Torkey A, Ramadan MA (2006) An efficient enhanced k-means clustering algorithm. J Zhejiang Univ 10(7):1626\u20131633","journal-title":"J Zhejiang Univ"},{"key":"79_CR39","doi-asserted-by":"crossref","unstructured":"Na S, Xumin L, Yong G (2010) Research on k-means clustering algorithm: an improved k-means clustering algorithm. In: Third International Symposium on Intelligent Information Technology and Security Informatics (IITSI), pp 63\u201367 (April 2010)","DOI":"10.1109\/IITSI.2010.74"},{"key":"79_CR40","volume-title":"Cluster analysis algorithms for data reduction and classification","author":"H Spath","year":"1980","unstructured":"Spath H (1980) Cluster analysis algorithms for data reduction and classification. Ellis Horwood, Chichester"},{"key":"79_CR41","doi-asserted-by":"crossref","unstructured":"Phillips SJ (2002) Acceleration of k-means and related clustering algorithms. In: Proceedings of Algorithms Engineering and Experiments(ALENEX02), pp. 166\u2013177. Springer, Berlin","DOI":"10.1007\/3-540-45643-0_13"},{"key":"79_CR42","doi-asserted-by":"crossref","unstructured":"Hitendra Sarma T, Viswanath P (2009) Speeding-up the k-means clustering method: A prototype based approach. In: Proceedings of 3rd International Conference on Pattern Recognition and Machine Intelligence(PReMI)LNCS 5909, pp. 56\u201361. Springer, Berlin","DOI":"10.1007\/978-3-642-11164-8_10"},{"key":"79_CR43","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1016\/j.patrec.2003.12.013","volume":"25","author":"P Vijaya","year":"2004","unstructured":"Vijaya P, Murty MN, Subramanian DK (2004) Leaders-subleaders: an efficient hierarchical clustering algorithm for large data sets. Pattern Recognit Lett 25:505\u2013513","journal-title":"Pattern Recognit Lett"},{"key":"79_CR44","doi-asserted-by":"crossref","unstructured":"Viswanath P, Pinkesh R (2006) l-dbscan : a fast hybrid density based clustering method. In: Proceedings of the 18th Intl. Conf. on Pattern Recognition (ICPR-06), vol. 1, pp. 912\u2013915. IEEE Computer Society, Hong Kong","DOI":"10.1109\/ICPR.2006.741"},{"key":"79_CR45","doi-asserted-by":"crossref","unstructured":"Viswanath P, Suresh Babu V (2009) Rough-DBSCAN : a fast hybrid density based clustering mehtod for large data sets. Pattern Recognition latters (2009), doi: 10.1016\/j.patrec.2009.08.008","DOI":"10.1016\/j.patrec.2009.08.008"},{"issue":"1","key":"79_CR46","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1145\/3147.3165","volume":"11","author":"J Vitter","year":"1985","unstructured":"Vitter J (1985) Random sampling with a reservoir. ACM Transact Math Softw 11(1):37\u201357","journal-title":"ACM Transact Math Softw"},{"issue":"1","key":"79_CR47","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10115-007-0114-2","volume":"14","author":"X Wu","year":"2008","unstructured":"Wu X, Kumar V, Ross Quinlan J, Ghosh J, Yang Q, Motoda H, McLachlan GJ, Ng A, Liu B, Yu P (2008) Top 10 algorithms in data mining. Knowl Inf Syst 14(1):1\u201337","journal-title":"Knowl Inf Syst"},{"issue":"3","key":"79_CR48","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1109\/TNN.2005.845141","volume":"16","author":"R Xu","year":"2005","unstructured":"Xu R, Wunsch D (2005) Survey of clustering algorithms. IEEE Transact Neural Netw 16(3):645\u2013678","journal-title":"IEEE Transact Neural Netw"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-012-0079-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13042-012-0079-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-012-0079-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,20]],"date-time":"2025-03-20T18:35:30Z","timestamp":1742495730000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13042-012-0079-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,15]]},"references-count":48,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["79"],"URL":"https:\/\/doi.org\/10.1007\/s13042-012-0079-7","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"type":"print","value":"1868-8071"},{"type":"electronic","value":"1868-808X"}],"subject":[],"published":{"date-parts":[[2012,2,15]]}}}