



@article {2365,
	title = {LEGClust - A clustering algorithm based on layered entropic subgraphs},
	journal = {IEEE Transactions on Pattern Analysis and Machine IntelligenceIEEE Trans Pattern Anal Mach Intell},
	volume = {30},
	year = {2008},
	note = {Cited By (since 1996): 8Export Date: 21 November 2012Source: ScopusCODEN: ITPIDdoi: 10.1109/TPAMI.2007.1142Language of Original Document: EnglishCorrespondence Address: Santos, J.M.; Department of Mathematics, ISEP - Polytechnic School of Engineering, R. Dr. A. Bernardino de Almeida 431, 4200-072 Porto, Portugal; email: jms@isep.ipp.ptReferences: Jain, A.K., Dubes, R.C., (1988) Algorithms for Clustering Data, , Prentice Hall International;Jain, A.K., Murty, M.N., Flynn, P.J., Data clustering: A review (1999) ACM Computing Surveys, 31 (3), pp. 264-323; 
Jain, A., Topchy, A., Law, M., Buhmann, J., Landscape of clustering algorithms (2004) 17th International Conference on Pattern Recognition, 1, pp. 260-263; 
Berkhin, P., (2002) Survey of clustering data mining techniques, , Accrue Software, San Jose, CA, Tech. Rep; 
Guha, S., Rastogi, R., Shim, K., CURE: An efficient clustering algorithm for large databases (1998) ACM SIGMOD International Conference on Management of Data, pp. 73-84; 
Guha, S., Rastogi, R., Shim, K., ROCK: A robust clustering algorithm for categorical attributes (2000) Information Systems, 25 (5), pp. 345-366; 
Kaufman, L., Rousseeuw, P., (1990) Finding Groups in Data: An Introduction to Cluster Analysis, , New York, NY: John Wiley and Sons; 
Zhang, T., Ramakrishnan, R., Livny, M., BIRCH: An efficient clustering method for very large databases (1996) ACM SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery, pp. 103-114. , Montreal, Canada; 
Zhang, T., Ramakrishnan, R., Livny, M., BIRCH: A new data clustering algorithm and its applications (1997) Data Mining and Knowledge Discovery, 1 (2), pp. 141-182; 
Karypis, G., Han, E.-H.S., Kumar, V., Chameleon: Hierarchical clustering using dynamic modeling (1999) IEEE Computer, 32 (8), pp. 68-75; 
Kamvar, S.D., Klein, D., Manning, C.D., Interpreting and extending classical agglomerative clustering algorithms using a model-based approach (2002) Proceedings of the Nineteenth International Conference on Machine Learning, pp. 283-290. , San Francisco, CA, USA: Morgan Kaufmann Publishers Inc; 
Johnson, E.L., Mehrotra, A., Nemhauser, G.L., Min-cut clustering (1993) Mathematical Programming, 62, pp. 133-151; 
Matula, D., Cluster analysis via graph theoretic techniques (1970) Proc. Luisiana Conference on Combinatorics, Graph Theory and Computing, pp. 199-212. , R.C.Mullin, K.B.Reid, and D.P.Roselle, Eds. University of Manitoba, Winnipeg; 
Matula, D., k-components, clusters and slicings in graphs (1972) SIAM J. Appl. Math, 22 (3), pp. 459-480; 
Hartuv, E., Schmitt, A., Lange, J., Meier-Ewert, S., Lehrachs, H., Shamir, R., An algorithm for clustering cDNAs for gene expression analysis (1999) RECOMB, pp. 188-197; 
Hartuv, E., Shamir, R., A clustering algorithm based on graph connectivity (2000) Information Processing Letters, 76 (4-6), pp. 175-181; 
Wu, Z., Leahy, R., An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation (1993) IEEE Transactions on Pattern Analysis and Machine Learning, 15 (11), pp. 1101-1113; 
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 1998Fiedler, M., A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory (1975) Czechoslovak Mathematical Journal, 25 (100), pp. 619-633; 
Chung, F.R.K., (1997) Spectral Graph Theory, (92). , Providence, RI: American Mathematical Society; 
Shi, J., Malik, J., Normalized cuts and image segmentation (2000) IEEE Transactions on Pattern Analysis and Machine Intelligence, 22 (8), pp. 888-905; 
Kannan, R., Vempala, S., Vetta, A., On clusterings: Good, bad, and spectral (2000) Proceedings of the 41st Annual Symposium on the Foundation of Computer Science, pp. 367-380; 
Ding, C., He, X., Zha, H., Gu, M., Simon, H., A min-max cut algorithm for graph partitioning and data clustering (2001) International Conference on Data Mining, pp. 107-114; 
Ng, A.Y., Jordan, M.I., Weiss, Y., On spectral clustering: Analysis and an algorithm (2001) Advances in Neural Information Processing Systems, 14; 
Meila, M., Shi, J., A random walks view of spectral segmentation (2001) Eighth International Workshop on Artificial Intelligence and Statistics; 
Verma, D., Meila, M., (2003) A comparison of spectral clustering algorithms, , Washington University, Tech. Rep. UW-CSE-03-05-01; 
Ester, M., Kriegel, H.-P., Sander, J., Xu, X., A density-based algorithm for discovering clusters in large spatial databases with noise (1996) 2nd International Conference on Knowledge Discovery and Data Mining, pp. 226-231. , A. Press, Ed; 
Fukunaga, K., Hostetler, L.D., The estimation of the gradient of a density function, with applications in pattern recognition (1975) IEEE Trans. in Information Theory, 21, pp. 32-40; 
Cheng, Y., Mean shift, mode seeking, and clustering (1995) IEEE Trans. on Pattern Analysis and Machine Intelligence, 17 (8), pp. 790-799; 
Comaniciu, D., Meer, P., Mean shift analysis and applications (1999) IEEE International Conference on Computer Vision, pp. 1197-1203; 
Comaniciu, D., Meer, P., Mean shift: A robust approach toward feature space analisys (2002) IEEE Trans. on Pattern Analysis and Machine Intelligence, 24 (5), pp. 603-619; 
Fischer, B., Z{\"o}ller, T., Buhmann, J.M., Path based pairwise data clustering with application to texture segmentation (2001) LNCS - Proceed. of International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition, 2134, pp. 235-250; 
Fischer, B., Buhmann, J.M., Path-based clustering for grouping of smooth curves and texture segmentation (2003) IEEE Transactions on Pattern Analysis and Machine Intelligence, 25 (4), pp. 513-518; 
Shannon, C., A mathematical theory of communication (1948) Bell System Technical Journal, 27, pp. 379-423,623-656; 
Renyi, A., Some fundamental questions of information theory (1976) Selected Papers of Alfred Renyi, 2, pp. 526-552; 
Parzen, E., On the estimation of a probability density function and mode (1962) Annals of Mathematical Statistics, 33, pp. 1065-1076; 
Xu, D., Pr{\'\i}ncipe, J., Training mlps layer-by-layer with the information potential (1999) Intl. Joint Conf. on Neural Networks, pp. 1716-1720; 
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-151Hero, A.O., Ma, B., Michel, O.J., Gorman, J., Applications of entropic spanning graphs (2002) IEEE Signal Processing Magazine, 19 (5), pp. 85-95; 
Cheng, C.H., Fu, A.W., Zhang, Y., Entropy-based subspace clustering for mining numerical data (1999) International Conference on Knowledge Discovery and Data Mining; 
Jenssen, R., Hild, I., Erdogmus, K.E.D., Pr{\'\i}ncipe, J., Eltoft, T., Clustering using renyi{\textquoteright}s entropy (2003) Proceedings of the International Joint Conference on Neural Networks, pp. 523-528; 
Gokcay, E., Pr{\'\i}ncipe, J.C., Information theoretic clustering (2002) IEEE Transactions on Pattern Analysis and Machine Learning, 24 (2), pp. 158-171; 
Lee, Y., Choi, S., Minimum entropy, k-means, spectral clustering (2004) IEEE International Joint Conference on Neural Networks, 1, pp. 117-122; 
Lee, Y., Maximum within-cluster association (2005) Pattern Recognition Letters, 26 (10), pp. 1412-1422. , July; 
J. M. Santos and J. Marques de S{\'a}, Human clustering on bi-dimensional data: An assessment, INEB - Instituto de Engenharia Biom{\'e}dica, Porto, Portugal, Technical Report 1, October 2005. [Online]. Available: http://www.fe.up.pt/~nnig/papers/ JMS_TechReport2005_1.pdfSilverman, B.W., (1986) Density Estimation for Statistics and Data Analisys, 26. , Chapman \& Hall; 
Bowman, A.W., Azzalini, A., (1997) Applied Smooting Techniques for Data Analysis, , London: Oxford University Press; 
Jenssen, R., Eltoft, T., Pr{\'\i}ncipe, J., Information theoretic spectral clustering (2004) Proceedings of the International Joint Conference on Neural Networks, pp. 111-116; 
Santos, J.M., Marques de S{\'a}, J., Alexandre, L.A., Neural Networks Trained with the EEM Algorithm: Tuning the Smoothing Parameter (2005) 6th WSEAS Int. Conf. on Neural Networks; 
Proen{\c c}a, H., Alexandre, L.A., UBIRIS: A noisy iris image database (2005) Proceed. of ICIAP 2005 - Intern. Confer. on Image Analysis and Processing, 1, pp. 970-977; 
(2000), http:// genome-www.stanford.edu/nci60, Stanford NCI60 cancer microarray projectBlake, C., Keogh, E., Merz, C., (1998) UCI repository of machine learning Databases, , http://www.ics.uci.edu/~mlearn/MLRepository.html; 
Forina, M., Armanino, C., Eigenvector projection and simplified nonlinear mapping of fatty acid content of italian olive oils (1981) Ann. Chim. (Rome), 72, pp. 127-155; 
G. Karypis, Cluto: Software package for clustering high-dimensional datasets, November 2003, version 2.1.1Karypis, G., (2003) Cluto: A Clustering Toolkit, , University of Minnesota, Department of Computer Science, Minneapolis, MN 55455, November; 
Sanguinetti, G., Laidler, J., Lawrence, N.D., Automatic determination of the number of clusters using spectral algorithms (2005) International Workshop on Machine Learning for Signal Processing, pp. 55-60; 
Xu, X., Dbscan, , http://ifsc.ualr.edu/xwxu, Online, Available; 
Duin, R.P., Dutch handwritten numerals, , http://www.ph.tn.tudelft.nl/~duin; 
Hubert, L., Arabie, P., Comparing partitions (1985) Journal of Classification, 2 (1), pp. 193-218; 
Porter, M.F., An algorithm for suffix stripping (1980) Program, 14 (3), pp. 130-137; 
Hastie, T., Tibshirani, R., Friedman, J., (2001) The Elements of Statistical Learning, , Springer
},
	month = {2008///},
	pages = {62 - 75},
	abstract = {Hierarchical clustering is a stepwise clustering method usually based on proximity measures between objects or sets of objects from a given data set. The most common proximity measures are distance measures. The derived proximity matrices can be used to build graphs, which provide the basic structure for some clustering methods. We present here a new proximity matrix based on an entropic measure and also a clustering algorithm (LEGClust) that builds layers of subgraphs based on this matrix, and uses them and a hierarchical agglomerative clustering technique to form the clusters. Our approach capitalizes on both a graph structure and a hierarchical construction. Moreover, by using entropy as a proximity measure we are able, with no assumption about the cluster shapes, to capture the local structure of the data, forcing the clustering method to reflect this structure. We present several experiments on artificial and real data sets that provide evidence on the superior performance of this new algorithm when compared with competing ones. {\textcopyright} 2007 IEEE.},
	keywords = {algorithm, Algorithms, article, artificial intelligence, automated pattern recognition, Cluster Analysis, Clustering, Clustering algorithms, computer assisted diagnosis, Distance measurement, Entropic subgraphs, entropy, Graph theory, Graphs, Hierarchical clustering, Hierarchical systems, Image enhancement, Image Interpretation, Computer-Assisted, Imaging, Three-Dimensional, methodology, Pattern Recognition, Automated, reproducibility, Reproducibility of Results, sensitivity and specificity, three dimensional imaging},
	isbn = {01628828 (ISSN)},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-36448984894\&partnerID=40\&md5=f549049e4ae5bff1f3a95aaae22cefb8},
	author = {Santos, J.M. and De S{\'a}, J.M. and Alexandre, L.A.}
}
