Universidad Complutense de Madrid
E-Prints Complutense

Network clustering by graph coloring: An application to astronomical images

Impacto

Downloads

Downloads per month over past year

Zarrazola, E. and Montero, Javier and Yáñez, Javier and Gómez de Castro, Ana Inés (2011) Network clustering by graph coloring: An application to astronomical images. In Intelligent Systems Design and Applications (ISDA), 2011 11th International Conference on. IEEE, pp. 796-801. ISBN 978-1-4577-1676-8

[img] PDF
Restringido a Repository staff only

303kB

Official URL: http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=6121754&abstractAccess=no&userType=inst



Abstract

In this paper we propose an efficient and polynomial hierarchical clustering technique for unsupervised classification of items being connected by a graph. The output of this algorithm shows the cluster evolution in a divisive way, in such a way that s soon as two items are included in the same cluster they will join a common cluster until the last iteration, in which all the items belong to a singleton cluster. This output can be viewed as a fuzzy clustering in which for each alpha cut we have a standard cluster of the network. The clustering tool we present in this paper allows a hierarchical clustering of related items avoiding some unrealistic constraints that are quite often assumed in clustering problems. The proposed procedure is applied to a hierarchical segmentation problem in astronomical images.


Item Type:Book Section
Uncontrolled Keywords:Graph Theory; Hierarchical Clustering; Astronomical Images.
Subjects:Sciences > Mathematics > Operations research
ID Code:28655
Deposited On:26 Feb 2015 07:44
Last Modified:03 Jun 2016 14:30

Origin of downloads

Repository Staff Only: item control page