A modification of the k-means method for quasi-unsupervised learning

Knowledge-Based Systems

Volumn 37, Issue , 2013, Pages 176-185

  Rebollo Monedero, David ^a   Solé, Marc ^a   Nin, Jordi ^a   Forné, Jordi ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Clustering; Constrained clustering; k Means method; Loyd algorithm; Quasi unsupervised learning; Size constraints

Indexed keywords

CLUSTERING; CONSTRAINED CLUSTERING; K-MEANS METHOD; QUASI-UNSUPERVISED LEARNING; SIZE CONSTRAINT;

CLUSTERING ALGORITHMS; HEURISTIC METHODS; REGRESSION ANALYSIS;

UNSUPERVISED LEARNING;

EID: 84870054852     PISSN: 09507051     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.knosys.2012.07.024     Document Type: Article

References (43)

1. D. Arthur, B. Manthey, H. Roeglin, k-Means has polynomial smoothed complexity, in: Proc. IEEE Annual Symp. Found. Comput. Sci. (FOCS), Atlanta, GA, October 2009, pp. 1157-1160.
2. L. Bai, J. Liang, and C. Dang An initialization method to simultaneously find initial cluster centers and the number of clusters for clustering categorical data Knowl.-Based Syst. 24 6 2011 785 795
3. A. Bhowmick, A theoretical analysis of Lloyd's algorithm for k-means clustering, 2009.
4. M. Bilenko, S. Basu, R.J. Mooney, Integrating constraints and metric learning in semi-supervised clustering, in: Proc. Int. Conf. Mach. Learn. (ICML), Banff, Alberta, Canada, July 2004, pp. 81-88.
5. C. Bishop Pattern Recognition and Machine Learning 2006 Springer-Verlag New York
6. O.B. Chapelle, B. Schölkopf, and A. Zien Semi-Supervised Learning 2006 MIT Press Cambridge, MA
7. V. Cross, Fuzzy semantic distance measures between ontological concepts, in: Proc. N. Amer. Fuzzy Inform. Process. Soc. (NAFIPS), 2004, pp. 236-240.
8. J. Domingo-Ferrer, and J.M. Mateo-Sanz Practical data-oriented microaggregation for statistical disclosure control IEEE Trans. Knowl. Data Eng. 14 1 2002 189 201
9. J. Domingo-Ferrer, and V. Torra Ordinal, continuous and heterogenerous k-anonymity through microaggregation Data Min. Knowl. Disc. 11 2 2005 195 212
10. R.O. Duda, P.E. Hart, and D.G. Stork Pattern Classification second ed. 2001 Wiley New York
11. M. Fisher, and K. Rajaram Accurate retail testing of fashion merchandise: methodology and application J. Market. Sci. 19 3 2000
12. A. Frank, A. Asuncion, UCI machine learning repository, Univ. California, Irvine, Sch. Inform., Comput. Sci., 2010. < http://archive.ics.uci.edu/ml >.
13. H. Frigui, and R. Krishnapuram A robust competitive clustering algorithm with applications in computer vision IEEE Trans. Pattern Anal. Mach. Intell. 21 5 1999 450 465
14. A. Gersho, and R.M. Gray Vector Quantization and Signal Compression 1992 Kluwer Academic Publishers Boston, MA
15. R.M. Gray, and D.L. Neuhoff Quantization IEEE Trans. Inform. Theory 44 1998 2325 2383
16. S.K. Gupta, K.S. Rao, and V. Bhatnagar k-Means clustering algorithm for categorical attributes Proc. Data Warehous. Knowl. Disc. (DaWaK) Lecture Notes Comput. Sci. (LNCS) vol. 1676 1999 Springer-Verlag Florence, Italy 203 208
17. T. Huang, Y. Yu, G. Guo, and K. Li A classification algorithm based on local cluster centers with a few labeled training examples Knowl.-Based Syst. 23 6 2010 563 571
18. Z. Huang Extensions to the k-means algorithm for clustering large data sets with categorical values Data Min. Knowl. Disc. 2 3 1998 283 304
19. L. Hubert, and P. Arabie Comparing partitions J. Classif. 2 1 1985 193 218
20. M. Inaba, N. Katoh, H. Imai, Applications of weighted voronoi diagrams and randomization to variance-based k-clustering, in: Proc. ACM Symp. Comput. Geom., 1994, pp. 332-339.
21. M. Inaba, N. Katoh, and H. Imai Variance-based k-clustering algorithms by Voronoi diagrams and randomization IEICE Trans. Inform. Syst. E83-D 6 2000 1199 1206
22. F. Jacquenet, and C. Largeron Discovering unexpected documents in corpora Knowl.-Based Syst. 22 6 2009 421 429
23. T. Kanungo, D.M. Mount, N.S. Netanyahu, C.D. Piatko, R. Silverman, and A.Y. Wu An efficient k-means clustering algorithm: analysis and implementation IEEE Trans. Pattern Anal. Mach. Intell. 24 7 2002 881 892
24. L. Kaufman, and P.J. Rousseeuw Finding Groups in Data: An Introduction to Cluster Analysis 2005 Wiley
25. M. Li, and L. Zhang Multinomial mixture model with feature selection for text clustering Knowl.-Based Syst. 21 7 2008 704 708
26. S.P. Lloyd Least squares quantization in PCM IEEE Trans. Inform. Theory IT-28 1982 129 137
27. J.B. MacQueen, Some methods for classification and analysis of multivariate observations, in: Proc. Berkeley Symp. Math. Stat., Prob. I (Stat.), Berkeley, CA, 1965-1966 (Symp.), 1967 (Proc.), 1967, pp. 281-297.
28. D. Marquardt An algorithm for least-squares estimation of nonlinear parameters SIAM J. Appl. Math. (SIAP) 11 1963 431 441
29. S. Martínez, A. Valls, and D. Sánchez Semantically-grounded construction of centroids for datasets with textual attributes Knowledge-Based Systems 35 2012 160 172
30. J. Max Quantizing for minimum distortion IEEE Trans. Inform. Theory 6 1 1960 7 12
31. J.J. Moré The Levenberg-Marquardt algorithm: implementation and theory G.A. Watson, Numerical Analysis Lecture Notes Math vol. 630 1977 Springer Verlag 105 116
32. A. Ng, CS229 course on machine learning, Stanford Univ., 2011. < http://cs229.stanford.edu >.
33. D. Rebollo-Monedero, Quantization and transforms for distributed source coding, Ph.D. dissertation, Stanford Univ., 2007.
34. D. Rebollo-Monedero, J. Forné, and M. Soriano An algorithm for k-anonymous microaggregation and clustering inspired by the design of distortion-optimized quantizers Data Knowl. Eng. 70 10 2011 892 921
35. H. Steinhaus Sur la division des corps matériels en parties Bull. Pol. Acad. Sci. IV 12 1956 801 804
36. C. Studholme, D.L.G. Hill, and D.J. Hawkes An overlap invariant entropy measure of 3D medical image alignment Pattern Recognit. 32 1 1999 71 86
37. L. Sweeney k-Anonymity: a model for protecting privacy Int. J. Uncertain. Fuzz. Knowl.-Based Syst. 10 5 2002 557 570
38. K. Ueda, and N. Yamashita On a global complexity bound of the Levenberg-Marquardt method J. Optim. Theory Appl. 147 2010 443 453
39. I. Wald, V. Hvran, On building fast kd-trees for ray tracing, and on doing that in o(nlogn), in: Proc. IEEE Symp. Interact. Ray Trac., 2006, pp. 61-69.
40. L. Willenborg, and T. DeWaal Elements of Statistical Disclosure Control 2001 Springer-Verlag New York
41. R. Xu, and D. Wunsch II Survey of clustering algorithms IEEE Trans. Neural Netw. 16 3 2005 645 678
42. X. Xu, J. Jäger, and H.-P. Kriegel A fast parallel clustering algorithm for large spatial databases Y. Guo, R. Grossman, High Performance Data Mining: Scaling Algorithms*, Applications* and systems 2002 Springer-Verlag 263 290
43. S. Zhu, D. Wang, and T. Li Data clustering with size constraints Knowl.-Based Syst. 23 8 2010 883 889