LEGClust - A clustering algorithm based on layered entropic subgraphs

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 30, Issue 1, 2008, Pages 62-75

  Santos, Jorge M ^a,b   De Sá, Joaquim Marques ^b,c   Alexandre, Luís A ^d,e  

^a INSTITUTO SUPERIOR DE ENGENHARIA DO PORTO   (Portugal)

^b INEB INSTITUTO DE ENGENHARIA BIOMÉDICA   (Portugal)

^c UNIVERSITY OF PORTO   (Portugal)

^d UNIVERSITY OF BEIRA INTERIOR   (Portugal)

^e IT Networks and Multimedia Group   (Portugal)

Author keywords

Clustering; Entropy; Graphs

Indexed keywords

CLUSTER ANALYSIS; CLUSTERING ALGORITHMS; DISTANCE MEASUREMENT; HIERARCHICAL SYSTEMS;

ENTROPIC SUBGRAPHS; HIERARCHICAL CLUSTERING;

GRAPH THEORY;

ALGORITHM; ARTICLE; ARTIFICIAL INTELLIGENCE; AUTOMATED PATTERN RECOGNITION; CLUSTER ANALYSIS; COMPUTER ASSISTED DIAGNOSIS; IMAGE ENHANCEMENT; METHODOLOGY; REPRODUCIBILITY; SENSITIVITY AND SPECIFICITY; THREE DIMENSIONAL IMAGING;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; CLUSTER ANALYSIS; IMAGE ENHANCEMENT; IMAGE INTERPRETATION, COMPUTER-ASSISTED; IMAGING, THREE-DIMENSIONAL; PATTERN RECOGNITION, AUTOMATED; REPRODUCIBILITY OF RESULTS; SENSITIVITY AND SPECIFICITY;

EID: 36448984894     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPAMI.2007.1142     Document Type: Article

References (61)

1. A. K. Jain and R. C. Dubes, Algorithms for Clustering Data. Prentice Hall International, 1988.
2. A. K. Jain, M. N. Murty, and P. J. Flynn, "Data clustering: A review," ACM Computing Surveys, vol. 31, no. 3, pp. 264-323, 1999.
3. A. Jain, A. Topchy, M. Law, and J. Buhmann, "Landscape of clustering algorithms," in 17th International Conference on Pattern Recognition vol. 1, 2004, pp. 260-263.
4. P. Berkhin, "Survey of clustering data mining techniques," Accrue Software, San Jose, CA, Tech. Rep., 2002.
5. S. Guha, R. Rastogi, and K. Shim, "CURE: An efficient clustering algorithm for large databases," in ACM SIGMOD International Conference on Management of Data, 1998, pp. 73-84.
6. S. Guha, R. Rastogi, and K. Shim, "ROCK: A robust clustering algorithm for categorical attributes," Information Systems, vol. 25, no. 5, pp. 345-366, 2000.
7. L. Kaufman and P. Rousseeuw, Finding Groups in Data: An Introduction to Cluster Analysis. New York, NY: John Wiley and Sons, 1990.
8. T. Zhang, R. Ramakrishnan, and M. Livny, "BIRCH: An efficient clustering method for very large databases," in ACM SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery, Montreal, Canada, 1996, pp. 103-114.
9. T. Zhang, R. Ramakrishnan, and M. Livny, "BIRCH: A new data clustering algorithm and its applications," Data Mining and Knowledge Discovery vol. 1, no. 2, pp. 141-182, 1997.
10. G. Karypis, E.-H. S. Han, and V. Kumar, "Chameleon: Hierarchical clustering using dynamic modeling," IEEE Computer, vol. 32, no. 8, pp. 68-75, 1999.
11. S. D. Kamvar, D. Klein, and C. D. Manning, "Interpreting and extending classical agglomerative clustering algorithms using a model-based approach," in Proceedings of the Nineteenth International Conference on Machine Learning. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc., 2002, pp. 283-290.
12. E. L. Johnson, A. Mehrotra, and G. L. Nemhauser, "Min-cut clustering," Mathematical Programming, vol. 62, pp. 133-151, 1993.
13. D. Matula, "Cluster analysis via graph theoretic techniques," in Proc. Luisiana Conference on Combinatorics, Graph Theory and Computing R.C.Mullin, K.B.Reid, and D.P.Roselle, Eds. University of Manitoba, Winnipeg, 1970, pp. 199-212.
14. D. Matula, "k-components, clusters and slicings in graphs," SIAM J. Appl. Math., vol. 22, no. 3, pp. 459-480, 1972.
15. E. Hartuv, A. Schmitt, J. Lange, S. Meier-Ewert, H. Lehrachs, and R. Shamir, "An algorithm for clustering cDNAs for gene expression analysis," in RECOMB, 1999, pp. 188-197.
16. E. Hartuv and R. Shamir, "A clustering algorithm based on graph connectivity," Information Processing Letters, vol. 76, no. 4-6, pp. 175-181, 2000.
17. Z. Wu and R. Leahy, "An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation," IEEE Transactions on Pattern Analysis and Machine Learning, vol. 15, no. 11, pp. 1101-1113, 1993.
18. G. Karypis and V. Kumar, "Multilevel algorithms for multi-constraint graph partitioning," University of Minnesota, Department of Computer Science/Army HPC Research Center, Minneapolis, Tech. Rep. 98-019, May 1998.
19. M. Fiedler, "A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory," Czechoslovak Mathematical Journal, vol. 25(100), pp. 619-633, 1975.
20. F. R. K. Chung, Spectral Graph Theory. Providence, RI: American Mathematical Society, 1997, no. 92.
21. J. Shi and J. Malik, "Normalized cuts and image segmentation," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 22, no. 8, pp. 888-905, 2000.
22. R. Kannan, S. Vempala, and A. Vetta, "On clusterings: Good, bad, and spectral," in Proceedings of the 41st Annual Symposium on the Foundation of Computer Science, 2000, pp. 367-380.
23. C. Ding, X. He, H. Zha, M. Gu, and H. Simon, "A min-max cut algorithm for graph partitioning and data clustering," in International Conference on Data Mining, 2001, pp. 107-114.
24. A. Y. Ng, M. I. Jordan, and Y. Weiss, "On spectral clustering: Analysis and an algorithm," in Advances in Neural Information Processing Systems, vol. 14, 2001.
25. M. Meila and J. Shi, "A random walks view of spectral segmentation," in Eighth International Workshop on Artificial Intelligence and Statistics, 2001.
26. D. Verma and M. Meila, "A comparison of spectral clustering algorithms," Washington University, Tech. Rep. UW-CSE-03-05-01, 2003.
27. M. Ester, H.-P. Kriegel, J. Sander, and X. Xu, "A density-based algorithm for discovering clusters in large spatial databases with noise," in 2nd International Conference on Knowledge Discovery and Data Mining, A. Press, Ed., 1996, pp. 226-231.
28. K. Fukunaga and L. D. Hostetler, "The estimation of the gradient of a density function, with applications in pattern recognition," IEEE Trans. in Information Theory, vol. 21, pp. 32-40, 1975.
29. Y. Cheng, "Mean shift, mode seeking, and clustering," IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 17, no. 8, pp. 790-799, 1995.
30. D. Comaniciu and P. Meer, "Mean shift analysis and applications," in IEEE International Conference on Computer Vision, 1999, pp. 1197-1203.
31. D. Comaniciu and P. Meer, "Mean shift: A robust approach toward feature space analisys," IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 24, no. 5, pp. 603-619, 2002.
32. B. Fischer, T. Zöller, and J. M. Buhmann, "Path based pairwise data clustering with application to texture segmentation," in LNCS - Proceed. of International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition, vol. 2134, 2001, pp. 235-250.
33. B. Fischer and J. M. Buhmann, "Path-based clustering for grouping of smooth curves and texture segmentation," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 25, no. 4, pp. 513-518, 2003.
34. C. Shannon, "A mathematical theory of communication," Bell System Technical Journal, vol. 27, pp. 379-423, 623-656, 1948.
35. A. Renyi, "Some fundamental questions of information theory," Selected Papers of Alfred Renyi, vol. 2, pp. 526-552, 1976.
36. E. Parzen, "On the estimation of a probability density function and mode," Annals of Mathematical Statistics, vol. 33, pp. 1065-1076, 1962.
37. D. Xu and J. Príncipe, "Training mlps layer-by-layer with the information potential," in Intl. Joint Conf. on Neural Networks, 1999, pp. 1716-1720.
38. H. Li, K. Zhang, and T. Jiang, "Minimum entropy clustering and applications to gene expression analysis," in IEEE Computational Systems Bioinformatics Conference, IEEE, Ed., 2004, pp. 142-151.
39. A. O. Hero, B. Ma, O. J. Michel, and J. Gorman, "Applications of entropic spanning graphs," IEEE Signal Processing Magazine, vol. 19, no. 5, pp. 85-95, 2002.
40. C. H. Cheng, A. W. Fu, and Y. Zhang, "Entropy-based subspace clustering for mining numerical data," in International Conference on Knowledge Discovery and Data Mining, 1999.
41. R. Jenssen, I. Hild, K.E., D. Erdogmus, J. Príncipe, and T. Eltoft, "Clustering using renyi's entropy," in Proceedings of the International Joint Conference on Neural Networks., 2003, pp. 523-528.
42. E. Gokcay and J. C. Príncipe, "Information theoretic clustering," IEEE Transactions on Pattern Analysis and Machine Learning, vol. 24, no. 2, pp. 158-171, 2002.
43. Y. Lee and S. Choi, "Minimum entropy, k-means, spectral clustering," in IEEE International Joint Conference on Neural Networks, vol. 1, 2004, pp. 117-122.
44. Y. Lee, "Maximum within-cluster association," Pattern Recognition Letters, vol. 26, no. 10, pp. 1412-1422, July 2005.
45. J. M. Santos and J. Marques de Sá, "Human clustering on bi-dimensional data: An assessment," INEB - Instituto de Engenharia Biomédica, Porto, Portugal, Technical Report 1, October 2005. [Online]. Available: http://www.fe.up.pt/~nnig/papers/ JMS_TechReport2005_1.pdf
46. B. W. Silverman, Density Estimation for Statistics and Data Analisys Chapman & Hall, 1986, vol. 26.
47. A. W. Bowman and A. Azzalini, Applied Smooting Techniques for Data Analysis. London: Oxford University Press, 1997.
48. R. Jenssen, T. Eltoft, and J. Príncipe, "Information theoretic spectral clustering," in Proceedings of the International Joint Conference on Neural Networks., 2004, pp. 111-116.
49. J. M. Santos, J. Marques de Sá, and L. A. Alexandre, "Neural Networks Trained with the EEM Algorithm: Tuning the Smoothing Parameter," in 6th WSEAS Int. Conf. on Neural Networks, 2005.
50. H. Proença and L. A. Alexandre, "UBIRIS: A noisy iris image database," in Proceed. of ICIAP 2005 - Intern. Confer. on Image Analysis and Processing, vol. 1, 2005, pp. 970-977.
51. "Stanford NCI60 cancer microarray project," http:// genome-www.stanford.edu/nci60/, 2000.
52. C. Blake, E. Keogh, and C. Merz, "UCI repository of machine learning Databases," http://www.ics.uci.edu/~mlearn/MLRepository.html, 1998.
53. M. Forina and C. Armanino, "Eigenvector projection and simplified nonlinear mapping of fatty acid content of italian olive oils," Ann. Chim. (Rome), vol. 72, pp. 127-155, 1981.
54. G. Karypis, "Cluto: Software package for clustering high-dimensional datasets," November 2003, version 2.1.1.
55. G. Karypis, Cluto: A Clustering Toolkit, University of Minnesota, Department of Computer Science, Minneapolis, MN 55455, November 2003.
56. G. Sanguinetti, J. Laidler, and N. D. Lawrence, "Automatic determination of the number of clusters using spectral algorithms," in International Workshop on Machine Learning for Signal Processing, 2005, pp. 55-60.
57. X. Xu, "Dbscan." [Online]. Available: http://ifsc.ualr.edu/xwxu/
58. R. P. Duin, "Dutch handwritten numerals," http://www.ph.tn.tudelft.nl/~duin.
59. L. Hubert and P. Arabie, "Comparing partitions," Journal of Classification, vol. 2, no. 1, pp. 193-218, 1985.
60. M. F. Porter, "An algorithm for suffix stripping," Program, vol. 14, no. 3, pp. 130-137, 1980.
61. T. Hastie, R. Tibshirani, and J. Friedman, The Elements of Statistical Learning. Springer, 2001.