
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Michael Laszlo, Sumitra Mukherjee, "A Genetic Algorithm Using HyperQuadtrees for LowDimensional Kmeans Clustering," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 28, no. 4, pp. 533543, April, 2006.  
BibTex  x  
@article{ 10.1109/TPAMI.2006.66, author = {Michael Laszlo and Sumitra Mukherjee}, title = {A Genetic Algorithm Using HyperQuadtrees for LowDimensional Kmeans Clustering}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {28}, number = {4}, issn = {01628828}, year = {2006}, pages = {533543}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPAMI.2006.66}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Pattern Analysis and Machine Intelligence TI  A Genetic Algorithm Using HyperQuadtrees for LowDimensional Kmeans Clustering IS  4 SN  01628828 SP533 EP543 EPD  533543 A1  Michael Laszlo, A1  Sumitra Mukherjee, PY  2006 KW  kmeans algorithm KW  clustering KW  genetic algorithms KW  quadtrees KW  optimal partition KW  center selection. VL  28 JA  IEEE Transactions on Pattern Analysis and Machine Intelligence ER   
[1] G.P. Babu and M.N. Murty, “A NearOptimal Initial Seed Value Selection for kMeans Algorithm Using Genetic Algorithm,” Pattern Recognition Letters, vol. 14, pp. 763769, 1993.
[2] S. Bandyopadhyay and U. Maulik, “NonParametric Genetic Clustering: Comparison of Validity Indices,” IEEE Trans. Systems, Man, and Cybernetics, PartC, vol. 31, no. 1, pp. 120125, 2001.
[3] S. Bandyopadhyay and U. Maulik, “An Evolutionary Technique Based on KMeans Algorithm for Optimal Clustering in RN,” Information SciencesApplications: An Int'l J., vol. 146, pp. 221237, Oct. 2002.
[4] J.N. Bhuyan, V.V. Raghavan, and K.E. Venkatesh, “Genetic Algorithm for Clustering with an Ordered Representation,” Proc. Fourth Int'l Conf. Genetic Algorithms, pp. 408415, 1991.
[5] L. Bottou and Y. Bengio, “Convergence Properties of the kMeans Algorithms,” Advances in Neural Information Processing Systems, 7, G. Tesauro and D. Touretzky, eds., pp. 585592, MIT Press, 1995.
[6] Y.T. Chien, Interactive Pattern Recognition. New York: MarcelDekker, 1978.
[7] D. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning. Reading, Mass.: AddisonWesley, 1989.
[8] G. Hamerly and C. Elkan, “Alternatives to the kMeans Algorithm that Find Better Clusterings,” Proc. 11th Int'l Conf. Information and Knowledge Management, Nov. 2002.
[9] G. Hamerl and C. Elkan, “Learning the k in kMeans,” Proc. 17th Ann. Conf. Neural Information Processing Systems (NIPS), Dec. 2003.
[10] P. Hansen and N. Mladenovic, “JMeans: A New Local Search Heuristic for Minimum SumofSquares Clustering,” Pattern Recognition, vol. 34, no. 2, pp. 405413, 2001.
[11] D.S. Hochbaum and D.B. Shmoys, “A Best Possible Heuristic for the kCenter problem,” Math. Operations Research, vol. 10, no. 2, pp. 180184, 1985.
[12] A.K. Jain and R.C. Dubes, Algorithms for Clustering Data. Englewood Cliffs, N.J.: Prentice Hall, 1988.
[13] A.K. Jain, M.N. Murty, and P.J. Flynn, “Data Clustering: A Review,” ACM Computing Surveys, vol. 31, no. 3, 1999.
[14] D. Jones and M.A. Beltramo, “Solving Partitioning Problems with Genetic Algorithms,” Proc. Fourth Int'l Conf. Genetic Algorithms, pp. 442449, 1991.
[15] T. Kanungo, D.M. Mount, N. Netanyahu, C. Piatko, R. Silverman, and A.Y. Wu, “An Efficient kMeans Clustering Algorithm: Analysis and Implementation,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, pp. 881892, 2002.
[16] K. Krishna and M.N. Murty, “Genetic kMeans Algorithm,” IEEE Trans. Sysytems, Man, and Cybernetics, vol. 29, no. 3, pp. 433439, June 1999.
[17] O.L. Mangasarian, “Mathematical Programming in Data Mining,” Data Mining and Knowledge Discovery, vol. 1, pp. 183201, 1997.
[18] U. Maulik and S. Bandyopadhyay, “Genetic AlgorithmBased Clustering Technique,” Pattern Recognition, vol. 33, pp. 14551465, 2000.
[19] J. McQueen, “Some Methods for Classification and Analysis of Multivariate Observations,” Proc. Fifth Berkeley Symp. Math. Statistics and Probability, pp. 281297, 1967.
[20] J. Peña, J. Lozano, and P. Larrsñaga, “An Empirical Comparison of Four Initialization Methods for the kMeans Algorithm,” Pattern Recognition Letters, vol. 20, pp. 10271040, 1999.
[21] D. Pollard, “A Central Limit Theorem for kMeans Clustering,” Annals of Probability, vol. 10, pp. 919926, 1982.
[22] S.Z. Selim and M.A. Ismail, “KMeansType Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 6, pp. 8187, 1984.
[23] H. Samet, The Design and Analysis of Spatial Data Structures. Reading, Mass.: AddisonWesley, 1990.
[24] H. Spath, Cluster Analysis Algorithms for Data Reduction and Classification of Objects. Chichester: Ellis Horwood, 1980.