
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Ping Luo, Hui Xiong, Guoxing Zhan, Junjie Wu, Zhongzhi Shi, "InformationTheoretic Distance Measures for Clustering Validation: Generalization and Normalization," IEEE Transactions on Knowledge and Data Engineering, vol. 21, no. 9, pp. 12491262, September, 2009.  
BibTex  x  
@article{ 10.1109/TKDE.2008.200, author = {Ping Luo and Hui Xiong and Guoxing Zhan and Junjie Wu and Zhongzhi Shi}, title = {InformationTheoretic Distance Measures for Clustering Validation: Generalization and Normalization}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {21}, number = {9}, issn = {10414347}, year = {2009}, pages = {12491262}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2008.200}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  InformationTheoretic Distance Measures for Clustering Validation: Generalization and Normalization IS  9 SN  10414347 SP1249 EP1262 EPD  12491262 A1  Ping Luo, A1  Hui Xiong, A1  Guoxing Zhan, A1  Junjie Wu, A1  Zhongzhi Shi, PY  2009 KW  Clustering validation KW  entropy KW  informationtheoretic distance measures KW  Kmeans clustering. VL  21 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] J. Aczl and Z. Darczy, On Measures of Information and Their Characterizations. Academic Press, 1975.
[2] D. Barbará and P. Chen, “Using SelfSimilarity to Cluster Large Data Sets,” Data Mining and Knowledge Discovery, vol. 7, no. 2, pp.123152, 2003.
[3] D. Barbará, Y. Li, and J. Couto, “Coolcat: An EntropyBased Algorithm for Categorical Clustering,” Proc. 11th ACM Int'l Conf. Information and Knowledge Management (CIKM '02), pp. 582589, 2002.
[4] L. Breiman, J. Friedman, C.J. Stone, and R.A. Olshen, Classification and Regression Trees. Wadsworth Int'l Group, 1984.
[5] Y. Chen, Y. Zhang, and X. Ji, “Size Regularized Cut for Data Clustering,” Proc. 18th Conf. Neural Information Processing Systems (NIPS), 2005.
[6] M.H. DeGroot and M.J. Schervish, Probability and Statistics, thirded. AddisonWesley, 2001.
[7] M. Halkidi, Y. Batistakis, and M. Vazirgiannis, “On Clustering Validation Techniques,” J. Intelligent Information Systems, vol. 17, nos. 2/3, pp. 107145, 2001.
[8] M. Halkidi, D. Gunopulos, N. Kumar, M. Vazirgiannis, and C. Domeniconi, “A Framework for SemiSupervised Learning Based on Subjective and Objective Clustering Criteria,” Proc. Fifth IEEE Int'l Conf. Data Mining (ICDM '05), pp. 637640, 2005.
[9] A.K. Jain and R.C. Dubes, Algorithms for Clustering Data. Prentice Hall, 1998.
[10] S. Jaroszewicz, D.A. Simovici, W. Kuo, and L. OhnoMachado, “The GoodmanKruskal Coefficient and Its Applications in the Genetic Diagnosis of Cancer,” IEEE Trans. Biomedical Eng., vol. 51, no. 7, pp. 10951102, July 2004.
[11] I. Jonyer, D.J. Cook, and L.B. Holder, “GraphBased Hierarchical Conceptual Clustering,” J. Machine Learning Research, vol. 2, pp.1943, 2001.
[12] I. Jonyer, L.B. Holder, and D.J. Cook, “GraphBased Hierarchical Conceptual Clustering in Structural Databases,” Proc. 17th Nat'l Conf. Artificial Intelligence and 12th Conf. Innovative Applications of Artificial Intelligence (AAAI '00), p. 1078, 2000.
[13] G. Karypis, http://glaros.dtc.umn.edu/gkhome/viewscluto , 2008.
[14] J. Li, D. Tao, W. Hu, and X. Li, “Kernel Principle Component Analysis in Pixels Clustering,” Proc. IEEE/WIC/ACM. Int'l Conf. Web Intelligence (WI '05), pp. 786789, 2005.
[15] W. Li, W.K. Ng, Y. Liu, and K.L. Ong, “Enhancing the Effectiveness of Clustering with Spectra Analysis,” IEEE Trans. Knowledge and Data Eng., vol. 19, no. 7, pp. 887902, July 2007.
[16] P. Luo, G. Zhan, Q. He, Z. Shi, and K. Lü, “On Defining Partition Entropy by Inequalities,” IEEE Trans. Information Theory, vol. 53, no. 9, pp. 32333239, 2007.
[17] R. Lopez De Mantaras, “A DistanceBased Attribute Selection Measure for Decision Tree Induction,” Machine Learning, vol. 6, no. 1, pp. 8192, 1991.
[18] A.W. Marshall and I. Olkin, Inequalities: Theory of Majorization and Its Applications. Academic Press, 1979.
[19] M. Meila, “Comparing Clusterings: An Axiomatic View,” Proc. 22nd Int'l Conf. Machine Learning (ICML '05), pp. 577584, 2005.
[20] N.R. Pal and S.K. Pal, “Entropy: A New Definition and Its Applications,” IEEE Trans. Systems Man and Cybernetics, vol. 21, no. 5, pp. 12601270, 1991.
[21] M.H. Protter and C.B. Morrey Jr., A First Course in Real Analysis, second ed. Springer, 1991.
[22] C.E. Shannon, “A Mathematical Theory of Communication,” Bell System Technical J., vol. 27, pp. 379423, 623656, 1948.
[23] D.A. Simovici and S. Jaroszewicz, “An Axiomatization of Partition Entropy,” IEEE Trans. Information Theory, vol. 48, no. 7, pp. 21382142, 2002.
[24] D.A. Simovici and S. Jaroszewicz, “A Metric Approach to Building Decision Trees Based on GoodmanKruskal Association Index,” Proc. Eighth PacificAsia Conf. Knowledge Discovery and Data Mining (PAKDD '04), pp. 181190, 2004.
[25] P.N. Tan, M. Steinbach, and V. Kumar, Introduction to Data Mining. AddisonWesley, 2005.
[26] H. Xiong, J. Wu, and J. Chen, “KMeans Clustering Versus Validation Measures: A Data Distribution Perspective,” Proc. 12th ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD '06), pp. 779784, 2006.