Asian Journal of Information Technology

Year: 2013
Volume: 12
Issue: 2
Page No. 77 - 82

An Efficient K-Means Initialization Using Minimum-Average-Maximum (MAM) Method

Authors : S. Dhanabal and S. Chandramathi

References

Arthur, D. and S. Vassilvitskii, 2007. K-means++: The advantages of careful seeding. Proceedings of the 18th Annual ACM-SIAM Symposium of Discrete Analysis, January 7-9, 2007, New Orleans, LA., USA., pp: 1027-1035.

Astrahan, M.M., 1970. Speech Analysis by Clustering, or the Hyperphoneme Method. Defense Technical Information Center, Palo Alto, CA.

Blake, C.L. and C.J. Merz, 1998. UCI Repository of Machine Learning Databases. 1st Edn., University of California, Irvine, CA.

Bradley, P.S. and U.M. Fayyad, 1998. Refining initial points for K-means clustering. Proceedings of the 15th International Conference on Machine Learning, July 24-27, 1998, Morgan Kaufmann, San Francisco, pp: 91-99.

Faber, V., 1994. Clustering and the continuous k-means algorithm. Los Alamos Sci., 22: 138-144.
Direct Link  |  

Fathian, M. and B. Amiri, 2008. A honeybee-mating approach for cluster analysis. Adv. Manuf. Tech., 1: 809-821.
Direct Link  |  

Fisher, D., 1996. Iterative optimization and simplification of hierarchical clustering. J. Artif. Intell. Res., 4: 147-179.
Direct Link  |  

Fisher, D.H., 1987. Knowledge acquisition via incremental conceptual clustering. Machine Learning, 2: 139-172.
CrossRef  |  

Forgey, E., 1965. Cluster Analysis of multivariate data: Efficiency versus interpretability of classification. Biometrics, 21: 768-780.
Direct Link  |  

Han, J. and M. Kamber, 2006. Data Mining-Concepts and Techniques. 2nd Edn., Morgan Kaufmann Publishers, USA., ISBN: 1558609016, pp: 800.

Hand, D.J. and W.J. Krzanowski, 2005. Optimising k-means clustering results with standard software packages. Comput. Stat. Data Anal., 49: 969-973.
Direct Link  |  

Hartigan, J.A. and M.A. Wong, 1979. Algorithm AS 136: A K-means clustering algorithm. J. R. Stat. Soc. Ser. C (Applied Stat.), 28: 100-108.
CrossRef  |  Direct Link  |  

Higgs, R.E., K.G. Bemis, I.A. Watson and J.H. Wikel, 1997. Experimental designs for selecting molecules from large chemical databases. J. Chem. Inform. Comput. Sci., 37: 861-870.
CrossRef  |  Direct Link  |  

Jain, A.K., M.N. Murty and P.J. Flynn, 1999. Data clustering: A review. ACM Comput. Surv., 31: 264-323.
CrossRef  |  Direct Link  |  

Khan, S.S. and A. Ahmad, 2004. Cluster center initialization for K-mean clustering. Pattern Recognit. Lett., 25: 1293-1302.
CrossRef  |  Direct Link  |  

MacQueen, J., 1967. Some methods for classification and analysis of multivariate observations. Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, Volume 1, January 17-20, 1967, California, USA., pp: 281-297.

Meila, M. and D. Heckerman, 1998. An experimental comparison of several clustering and initialization methods. Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence, July 24-26, 1998, San Francisco, CA., pp: 386-395.

Milligan, G.W., 1980. An examination of the effect of six types of error perturbation on fifteen clustering algorithms. Psychometrika, 45: 325-342.
CrossRef  |  

Mirkin, B., 2005. Clustering for Data Mining: A Data Recovery Approach. Chapman and Hall, London.

Pena, J.M., J.A. Lozano and P. Larranaga, 1999. An empirical comparison of four initialization methods for the K-Means algorithm. Pattern Recognit. Lett., 20: 1027-1040.
CrossRef  |  Direct Link  |  

Selim, S.Z. and M.A. Ismail, 1984. K-means-type algorithms: A generalized convergence theorem and characterization of local optimality. IEEE Trans. Pattern Anal. Mach. Intell., 6: 81-87.
CrossRef  |  

Snarey, M., N.K. Terrett, P. Willet and D.J. Wilton, 1997. Comparison of algorithms for dissimilarity-based compound selection. J. Mol. Graphics Modell., 15: 372-385.
PubMed  |  Direct Link  |  

Steinley, D., 2003. Local optima in k-means clustering: What you don't know may hurt you. Psychol. Methods, 8: 294-304.
PubMed  |  Direct Link  |  

Tan, P.N., M. Steinbach and V. Kumar, 2006. Cluster Analysis: Basic Concepts and Algorithms. In: Introduction to Data Mining, Tan, P.N., M. Steinbach and V. Kumar (Eds.)., Pearson Addison Wesley, Boston.

Ward, Jr. J.H., 1963. Hierarchical grouping to optimize an objective function. J. Am. Stat. Assoc., 58: 236-244.
CrossRef  |  Direct Link  |  

Design and power by Medwell Web Development Team. © Medwell Publishing 2024 All Rights Reserved