Document Clustering with K-tree
- Cite this paper as:
- De Vries C.M., Geva S. (2009) Document Clustering with K-tree. In: Geva S., Kamps J., Trotman A. (eds) Advances in Focused Retrieval. INEX 2008. Lecture Notes in Computer Science, vol 5631. Springer, Berlin, Heidelberg
This paper describes the approach taken to the XML Mining track at INEX 2008 by a group at the Queensland University of Technology. We introduce the K-tree clustering algorithm in an Information Retrieval context by adapting it for document clustering. Many large scale problems exist in document clustering. K-tree scales well with large inputs due to its low complexity. It offers promising results both in terms of efficiency and quality. Document classification was completed using Support Vector Machines.
KeywordsINEX XML Mining Clustering K-tree Tree Vector Quantization Text Classification Support Vector Machine
Unable to display preview. Download preview PDF.