{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:30:00Z","timestamp":1740137400594,"version":"3.37.3"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,11,11]],"date-time":"2015-11-11T00:00:00Z","timestamp":1447200000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003329","name":"Ministerio de Econom\u00eda y Competitividad (ES)","doi-asserted-by":"publisher","award":["TIN2014-57458-R"],"award-info":[{"award-number":["TIN2014-57458-R"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Stat Methods Appl"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s10260-015-0345-4","type":"journal-article","created":{"date-parts":[[2015,11,11]],"date-time":"2015-11-11T00:52:33Z","timestamp":1447203153000},"page":"477-499","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A method for K-Means seeds generation applied to text mining"],"prefix":"10.1007","volume":"25","author":[{"given":"Daniel","family":"Velez","sequence":"first","affiliation":[]},{"given":"Jorge","family":"Sueiras","sequence":"additional","affiliation":[]},{"given":"Alejandro","family":"Ortega","sequence":"additional","affiliation":[]},{"given":"Jose F.","family":"Velez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,11]]},"reference":[{"key":"345_CR1","unstructured":"Arthur D, Vassilvitskii S (2007) K-Means++: the advantages of careful seeding. In: Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms, pp 1027\u20131035"},{"key":"345_CR2","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1137\/1037127","volume":"37","author":"MW Berry","year":"1995","unstructured":"Berry MW, Dumais ST, O\u2019brien GW (1995) Using linear algebra for intelligent information retrieval. SIAM Rev 37:573\u2013595","journal-title":"SIAM Rev"},{"key":"345_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-0450-1","volume-title":"Pattern recognition with fuzzy objective function algorithms","author":"JC Bezdek","year":"1981","unstructured":"Bezdek JC (1981) Pattern recognition with fuzzy objective function algorithms. Plenum Press, New York"},{"key":"345_CR4","unstructured":"Blei DM, Ng AY, Jordan MI (2003) Latent dirichlet allocation. J Mach Learn Res 3:993\u20131022"},{"key":"345_CR5","unstructured":"Bradley PS, Fayyad UM (1998) Refining initial points for K-Means clustering. In: Proceedings of the fifteenth international conference on machine learning, pp 91\u201399"},{"key":"345_CR6","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/j.eswa.2012.07.021","volume":"40","author":"ME Celebi","year":"2013","unstructured":"Celebi ME, Kingravi HA, Vela Patricio A (2013) A comparative study of efficient initialization methods for the K-Means clustering algorithm. Expert Syst Appl 40:200\u2013210","journal-title":"Expert Syst Appl"},{"key":"345_CR7","doi-asserted-by":"crossref","first-page":"1061","DOI":"10.1016\/j.patcog.2011.08.012","volume":"45","author":"RC Amorim De","year":"2012","unstructured":"De Amorim RC, Mirkin B (2012) Minkowski metric, feature weighting and anomalous cluster initializing in K-Means clustering. Pattern Recognit 45:1061\u20131075","journal-title":"Pattern Recognit"},{"key":"345_CR8","doi-asserted-by":"crossref","unstructured":"Ding C, He X (2004) K-Means clustering via principal component analysis. In: Proceedings of the twenty-first international conference on machine learning, pp 29\u201335","DOI":"10.1145\/1015330.1015408"},{"issue":"3","key":"345_CR9","first-page":"32","volume":"3","author":"JC Dunn","year":"1973","unstructured":"Dunn JC (1973) A fuzzy relative of the isodata process and its use in detecting compact well-separated clusters. Cybern Syst 3(3):32\u201357","journal-title":"Cybern Syst"},{"issue":"3","key":"345_CR10","first-page":"768","volume":"21","author":"E Forgy","year":"1965","unstructured":"Forgy E (1965) Cluster analysis of multivariate data: efficiency vs. interpretability of classification. Biometrics 21(3):768\u2013769","journal-title":"Biometrics"},{"key":"345_CR11","unstructured":"Francis LA (2006) Taming text: an introduction to text mining. Casualty Actuar Soc Forum 51\u201388"},{"issue":"11","key":"345_CR12","doi-asserted-by":"crossref","first-page":"994","DOI":"10.1016\/j.patrec.2009.04.013","volume":"30","author":"M Al Hasan","year":"2009","unstructured":"Hasan M Al, Chaoji V, Salem S, Zaki M (2009) Robust partitional clustering by outlier and density insensitive seeding. Pattern Recognit Lett 30(11):994\u20131002","journal-title":"Pattern Recognit Lett"},{"key":"345_CR13","doi-asserted-by":"crossref","DOI":"10.2495\/DATA060021","volume-title":"Text preparation through extended tokenization","author":"M Hassler","year":"2006","unstructured":"Hassler M, Fliedl G (2006) Text preparation through extended tokenization. University Klagenfurt, Klagenfurt"},{"key":"345_CR14","unstructured":"Heinrich G (2004) Parameter estimation for text analysis. Technical Report Fraunhofer IGD, Darmstadt, Germany"},{"key":"345_CR15","unstructured":"Hettich S, Bay SD (1999) The UCI KDD archive, http:\/\/kdd.ics.uci.edu , Irvine, CA: University of California, Department of Information and Computer Science, pp 1721\u20131288"},{"key":"345_CR16","doi-asserted-by":"crossref","unstructured":"Hoffmann T (1999) Probabilistic latent semantic analysis, uncertainty in artificial intelligence, UAI 99 Stockholm, pp 289\u2013296","DOI":"10.1145\/312624.312649"},{"key":"345_CR17","unstructured":"IT++ (2005) IT++ documentation. http:\/\/itpp.sourceforge.net , Retrieved 1 July 2015"},{"key":"345_CR18","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 years beyond K-Means. Pattern Recognit Lett 31:651\u2013666","journal-title":"Pattern Recognit Lett"},{"key":"345_CR19","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1007\/11563952_44","volume":"3739","author":"L Jing","year":"2005","unstructured":"Jing L, Ng MK, Xu J, Huang J (2005) On the performance of feature weighting K-Means for text subspace clustering. Adv Web-Age Inf Manag 3739:502\u2013512","journal-title":"Adv Web-Age Inf Manag"},{"issue":"2","key":"345_CR20","first-page":"91","volume":"1","author":"L Jing","year":"2006","unstructured":"Jing L, Ng MK, Yang X, Huang JZ (2006) A text clustering system based on K-Means type subspace clustering and ontology. Int J Intell Technol 1(2):91\u2013103","journal-title":"Int J Intell Technol"},{"key":"345_CR21","unstructured":"Jivani AG (2011) A comparative study of stemming algorithms. Department of Computer Science and Engineering, The Maharaja Sayajirao University of Baroda Vadodara, Gujarat, India"},{"key":"345_CR22","unstructured":"Joachims T (1997) A probabilistic analysis of the rocchio algorithm with tf-idf for text categorization. In: Proceedings of the fourteenth international conference on machine learning, pp 143\u2013151"},{"key":"345_CR23","doi-asserted-by":"crossref","unstructured":"Katsavounidis I, Jay Kuo C-C, Zhang Z (1994) A new initialization technique for generalized lloyd iteration. IEEE Signal Process Lett 1(10):144\u2013146","DOI":"10.1109\/97.329844"},{"key":"345_CR24","doi-asserted-by":"crossref","first-page":"43","DOI":"10.14257\/ijast.2014.62.04","volume":"62","author":"Y Kumar","year":"2014","unstructured":"Kumar Y, Sahoo G (2014) A new initialization method to originate initial cluster centers for K-Means algorithm. Int J Adv Sci Technol 62:43\u201354","journal-title":"Int J Adv Sci Technol"},{"key":"345_CR25","unstructured":"Maysum P (2011) Iterative methods for computing eigenvalues and eigenvectors. Waterloo Math Rev 1:9\u201318"},{"key":"345_CR26","unstructured":"MacQueen JB (1967) Some methods for classification and analysis of multivariate observations. In: Proceedings of 5th Berkeley symposium on mathematical statistics and probability 1, University Of California Press, pp 281\u2013297"},{"key":"345_CR27","unstructured":"Mendes-Rodrigues MES, Sacks L (2004) A scalable hierarchical fuzzy clustering algorithm for text mining. In: Proceedings of the 5th international conference on recent advances in soft computing, pp 269\u2013274"},{"key":"345_CR28","doi-asserted-by":"crossref","DOI":"10.1201\/9781420034912","volume-title":"Clustering for data mining: a data recovery approach","author":"B Mirkin","year":"2005","unstructured":"Mirkin B (2005) Clustering for data mining: a data recovery approach. Chapman and Hall, Boca Raton"},{"key":"345_CR29","first-page":"217","volume":"52\u20133","author":"DS Modha","year":"2003","unstructured":"Modha DS, Spangler WS (2003) Feature weighting in K-Means clustering. Comput Methods Feature Sel Mach Learn 52\u20133:217\u2013237","journal-title":"Comput Methods Feature Sel Mach Learn"},{"key":"345_CR30","doi-asserted-by":"crossref","unstructured":"Ocampo-Guzman I, Lopez-Arevalo I, Sosa-Sosa V (2009) Data-driven approach for ontology learning. In: 6th international conference on computing science and automatic control, electrical engineering, pp 1\u20136","DOI":"10.1109\/ICEEE.2009.5393402"},{"issue":"1","key":"345_CR31","first-page":"51","volume":"4","author":"T Onoda","year":"2012","unstructured":"Onoda T, Sakai M, Yamada S (2012) Careful seeding method based on independent components analysis for K-Means clustering. J Emerg Technol Web Intell 4(1):51\u201359","journal-title":"J Emerg Technol Web Intell"},{"key":"345_CR32","unstructured":"OpenCV (2014) OpenCV 2.4.9.0 documentation, Opencv Api reference, the core functionality. http:\/\/docs.opencv.org\/modules\/refman.html . Retrieved 19 Oct 2014"},{"issue":"11","key":"345_CR33","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1080\/14786440109462720","volume":"2","author":"K Pearson","year":"1901","unstructured":"Pearson K (1901) On lines and planes of closest fit to systems of points in space. Philos Mag 2(11):559\u2013572","journal-title":"Philos Mag"},{"key":"345_CR34","doi-asserted-by":"crossref","first-page":"1148","DOI":"10.1093\/comjnl\/bxq069","volume":"54","author":"D Pinto","year":"2011","unstructured":"Pinto D, Rosso P, Jimenez-Salazar H (2011) A self-enriching methodology for clustering narrow domain short texts. Comput J 54:1148\u20131165","journal-title":"Comput J"},{"key":"345_CR35","unstructured":"Porter MF (1997) An algorithm for suffix stripping. In: Readings in information retrieval. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, pp 313\u2013316"},{"issue":"4","key":"345_CR36","first-page":"539","volume":"53","author":"V Rousson","year":"2004","unstructured":"Rousson V, Gasser T (2004) Simple component analysis. Appl Stat 53(4):539\u2013555","journal-title":"Appl Stat"},{"issue":"1","key":"345_CR37","first-page":"11","volume":"28","author":"G Salton","year":"1973","unstructured":"Salton G, Yang CS (1973) On the specification of term values in automatic indexing. J Doc 28(1):11\u201321","journal-title":"J Doc"},{"key":"345_CR38","volume-title":"Applied clustering techniques course notes","author":"SAS","year":"2013","unstructured":"SAS (2013) Applied clustering techniques course notes. SAS Institute Inc., Cary"},{"key":"345_CR39","doi-asserted-by":"crossref","unstructured":"Savaresi SM, Bole DL (2001) On the performance of bisecting K-Means and PDDP. In: Proceedings of the first SIAM international conference on data mining, pp 502\u2013512","DOI":"10.1137\/1.9781611972719.5"},{"key":"345_CR40","unstructured":"Steinbach M, Karypis G, Kumar V (2000) A comparison of document clustering techniques. KDD workshop on text mining"},{"key":"345_CR41","doi-asserted-by":"crossref","unstructured":"Yang T, Wang J (2014) A robust K-Means type algorithm for soft subspace clustering and its application to text clustering. J Softw 9(8):2120\u20132124","DOI":"10.4304\/jsw.9.8.2120-2124"},{"key":"345_CR42","first-page":"1057","volume":"4","author":"H Zha","year":"2001","unstructured":"Zha H, Ding C, Gu M, He X, Simon HD (2001) Spectral relaxation for K-Means clustering. Neural Inf Process Syst (NIPS 2001) 4:1057\u20131064","journal-title":"Neural Inf Process Syst (NIPS 2001)"},{"issue":"3","key":"345_CR43","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1023\/B:MACH.0000027785.44527.d6","volume":"55","author":"Y Zhao","year":"2004","unstructured":"Zhao Y, Karypis G (2004) Empirical and theoretical comparisons of selected criterion functions for document clustering. Mach Learn 55(3):311\u2013331","journal-title":"Mach Learn"},{"key":"345_CR44","unstructured":"Zhao X, Jiang J (2011) An empirical comparison of topics in Twitter and traditional media. Singapore Management University, School of Information Systems Technical Paper Series"}],"container-title":["Statistical Methods & Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10260-015-0345-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10260-015-0345-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10260-015-0345-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T08:16:27Z","timestamp":1567325787000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10260-015-0345-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,11]]},"references-count":44,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["345"],"URL":"https:\/\/doi.org\/10.1007\/s10260-015-0345-4","relation":{},"ISSN":["1618-2510","1613-981X"],"issn-type":[{"type":"print","value":"1618-2510"},{"type":"electronic","value":"1613-981X"}],"subject":[],"published":{"date-parts":[[2015,11,11]]}}}