Journal
PATTERN RECOGNITION LETTERS
Volume 31, Issue 6, Pages 469-477Publisher
ELSEVIER
DOI: 10.1016/j.patrec.2009.11.011
Keywords
Hierarchical clustering; Dynamic clustering; Overlapped clustering
Categories
Ask authors/readers for more resources
In this paper, two clustering algorithms called dynamic hierarchical compact and dynamic hierarchical star are presented Both methods aim to construct a cluster hierarchy, dealing with dynamic data sets The first creates disjoint hierarchies of clusters, while the second obtains overlapped hierarchies The experimental results on several benchmark text collections show that these methods not only are suitable for producing hierarchical clustering solutions in dynamic environments effectively and efficiently, but also offer hierarchies easier to browse than traditional algorithms. Therefore, we advocate its use for tasks that require dynamic clustering, such as information organization, creation of document taxonomies and hierarchical topic detection. (C) 2009 Elsevier B V All rights reserved
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available