In this paper we introduce a general framework for hierarchical clustering that deals with both static and dynamic data sets. From this framework, different hierarchical agglomerative algorithms can be obtained, by specifying an inter-cluster similarity measure, a subgraph of the β-similarity graph, and a cover algorithm. A new clustering algorithm called Hierarchical Compact Algorithm and its dynamic version are presented, which are specific versions of the proposed framework. Our evaluation experiments on several standard document collections show that this algorithm requires less computational time than standard methods in dynamic data sets while achieving a comparable or even better clustering quality. Therefore, we advocate its use for tasks that require dynamic clustering, such as information organization, creation of document taxonomies and hierarchical topic detection. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Gil-García, R., Badía-Contelles, M., & Pons-Porrata, A. (2005). Dynamic hierarchical compact clustering algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3773 LNCS, pp. 302–310). Springer Verlag. https://doi.org/10.1007/11578079_32
Mendeley helps you to discover research relevant for your work.