作者: Edwin Zarrazola , Daniel Gomez , Javier Montero , Javier Yánez , Ana Inés Gómez de Castro
DOI: 10.1109/ISDA.2011.6121754
关键词:
摘要: In this paper we propose an efficient and polynomial hierarchical clustering technique for unsupervised classification of items being connected by a graph. The output algorithm shows the cluster evolution in divisive way, such way that as soon two are included same they will join common until last iteration, which all belong to singleton cluster. This can be viewed fuzzy each alpha cut have standard network. tool present allows related avoiding some unrealistic constraints quite often assumed problems. proposed procedure is applied segmentation problem astronomical images.