A method for initialising the K-means clustering algorithm using kd-treesREDMOND, Stephen J; HENEGHAN, Conor.Pattern recognition letters. 2007, Vol 28, Num 8, pp 965-973, issn 0167-8655, 9 p.Article

Fast modified global k-means algorithm for incremental cluster constructionBAGIROV, Adil M; UGON, Julien; WEBB, Dean et al.Pattern recognition. 2011, Vol 44, Num 4, pp 866-876, issn 0031-3203, 11 p.Article

Modified global k-means algorithm for minimum sum-of-squares clustering problemsBAGIROV, Adil M.Pattern recognition. 2008, Vol 41, Num 10, pp 3192-3199, issn 0031-3203, 8 p.Article

A genetic algorithm that exchanges neighboring centers for k-means clusteringLASZLO, Michael; MUKHERJEE, Sumitra.Pattern recognition letters. 2007, Vol 28, Num 16, pp 2359-2366, issn 0167-8655, 8 p.Article

Efficient global clustering using the Greedy Elimination MethodCHAN, Z. S. H; KASABOV, N.Electronics Letters. 2004, Vol 40, Num 25, pp 1611-1612, issn 0013-5194, 2 p.Article

Study of a Reasonable Initial Center Selection Method Applied to a K-Means ClusteringLEE, Wonhee; LEE, Samuel Sangkon; AN, Dong-Un et al.IEICE transactions on information and systems. 2013, Vol 96, Num 8, pp 1727-1733, issn 0916-8532, 7 p.Article

Lazy learning in radial Basis Neural Networks: A way of achieving more accurate modelsVALLS, José M; GALVAN, Inés M; ISASI, Pedro et al.Neural processing letters. 2004, Vol 20, Num 2, pp 105-124, issn 1370-4621, 20 p.Article

Combining multiple clusterings using evidence accumulationFRED, Ana L. N; JAIN, Anil K.IEEE transactions on pattern analysis and machine intelligence. 2005, Vol 27, Num 6, pp 835-850, issn 0162-8828, 16 p.Article

Regional and online learnable fieldsSCHATTEN, Rolf; GOERKE, N. Rolf; ECKMILLER, Rolf et al.International Joint Conference on Neural Networks. 2004, isbn 0-7803-8359-1, 4Vol, Vol1, 793-798Conference Paper

A group quorum system of degree 1 + √1+n mCHEDID, Fouad B.Lecture notes in computer science. 2006, pp 70-81, issn 0302-9743, isbn 978-3-540-68139-7, 1Vol, 12 p.Conference Paper

T-REKS: identification of Tandem REpeats in sequences with a K-meanS based algorithmJORDA, Julien; KAJAVA, Andrey V.Bioinformatics (Oxford. Print). 2009, Vol 25, Num 20, pp 2632-2638, issn 1367-4803, 7 p.Article

Hierarchical initialization approach for K-Means clusteringLU, J. F; TANG, J. B; TANG, Z. M et al.Pattern recognition letters. 2008, Vol 29, Num 6, pp 787-795, issn 0167-8655, 9 p.Article

An efficient k-means clustering algorithm using simple partitioningHUNG, Ming-Chuan; JUNGPIN WU; CHANG, Jin-Hua et al.Journal of information science and engineering. 2005, Vol 21, Num 6, pp 1157-1177, issn 1016-2364, 21 p.Article

A new algorithm for initial cluster centers in k-means algorithmERISOGLU, Murat; CALIS, Nazif; SAKALLIOGLU, Sadullah et al.Pattern recognition letters. 2011, Vol 32, Num 14, pp 1701-1705, issn 0167-8655, 5 p.Article

Automated variable weighting in k-means type clusteringJOSHUA ZHEXUE HUANG; NG, Michael K; HONGQIANG RONG et al.IEEE transactions on pattern analysis and machine intelligence. 2005, Vol 27, Num 5, pp 657-668, issn 0162-8828, 12 p.Article

Molecular dynamics-like data clustering approachLI JUNLIN; FU HONGGUANG.Pattern recognition. 2011, Vol 44, Num 8, pp 1721-1737, issn 0031-3203, 17 p.Article

Super-cooled Droplet Splash Image ClassificationXUEQING ZHANG; BARNES, Stuart; SHAN FU et al.Proceedings of SPIE, the International Society for Optical Engineering. 2009, Vol 7375, issn 0277-786X, isbn 978-0-8194-7651-7 0-8194-7651-X, 73752F.1-73752F.8, 2Conference Paper

How slow is the k-means method?ARTHUR, David; VASSILVITSK, Sergei.SCG : symposium on computational geometry. 2006, pp 144-153, isbn 1-59593-340-9, 1Vol, 10 p.Conference Paper

Document clustering with grouping and chaining algorithmsCHALI, Yllias; NOUREDDINE, Soufiane.Lecture notes in computer science. 2005, pp 280-291, issn 0302-9743, isbn 3-540-29172-5, 1Vol, 12 p.Conference Paper

Outliers in rough k-means clusteringPETERS, Georg.Lecture notes in computer science. 2005, pp 702-707, issn 0302-9743, isbn 3-540-30506-8, 1Vol, 6 p.Conference Paper

Regional and online learnable fieldsSCHATTEN, Rolf; GOERKE, Nils; ECKMILLER, Rolf et al.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-28757-4, 2Vol, Part II, 74-83Conference Paper

A revision for Gaussian mixture density decomposition algorithmXIAOBING YANG; FANSHENG KONG; BIHONG LIU et al.Lecture notes in computer science. 2004, pp 1014-1019, issn 0302-9743, isbn 3-540-24127-2, 6 p.Conference Paper

Noise reduction for ellipse fitting on medical imagesTANG, T. B; LU, C. K; LAUDE, A et al.Electronics letters. 2013, Vol 49, Num 3, pp 178-179, issn 0013-5194, 2 p.Article

Combining multiple classifications of chemical structures using consensus clustering : Chemoinformatics in Drug DiscoveryCHU, Chia-Wei; HOLLIDAY, John D; WILLETT, Peter et al.Bioorganic & medicinal chemistry. 2012, Vol 20, Num 18, pp 5366-5371, issn 0968-0896, 6 p.Article

An optimized K-means algorithm of reducing cluster intra-dissimilarity for document clusteringDALING WANG; GE YU; YUBIN BAO et al.Lecture notes in computer science. 2005, pp 785-790, issn 0302-9743, isbn 3-540-29227-6, 1Vol, 6 p.Conference Paper