.png){kind=icon}
Return
Dynamic hierarchical algorithms for document clustering
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patrec.2009.11.011.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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
Keywords:
Hierarchical clustering
Dynamic clustering
Overlapped clustering
Journal
IF:
3.3
Papers:
8.0K
Citations:
1.6W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveDOTE: Dual cOnvolutional filTer lEarning for Super-Resolution and Cross-Modality Synthesis in MRI
PREAI
ShareSave
ShareSave no more
no more