Back to Search
Start Over
BUAP: Performance of K-Star at the INEX΄09 Clustering Task.
- Source :
- Focused Retrieval & Evaluation; 2010, p434-440, 7p
- Publication Year :
- 2010
-
Abstract
- The aim of this paper is to use unsupervised classification techniques in order to group the documents of a given huge collection into clusters. We approached this challenge by using a simple clustering algorithm (K-Star) in a recursive clustering process over subsets of the complete collection. The presented approach is a scalable algorithm which may automatically discover the number of clusters. The obtained results outperformed different baselines presented in the INEX 2009 clustering task. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISBNs :
- 9783642145551
- Database :
- Complementary Index
- Journal :
- Focused Retrieval & Evaluation
- Publication Type :
- Book
- Accession number :
- 76850634
- Full Text :
- https://doi.org/10.1007/978-3-642-14556-8_43