K-tree: Large Scale Document Clustering

Details K-tree: Large Scale Document Clustering K-tree: Large Scale Document Clustering

2010-01-06

arxiv.org/abs/1001.0830v1

Computer Science

Information Retrieval

2 pages, SIGIR 2009

Scientific paper

10.1145/1571941.1572094

We introduce K-tree in an information retrieval context. It is an efficient approximation of the k-means clustering algorithm. Unlike k-means it forms a hierarchy of clusters. It has been extended to address issues with sparse representations. We compare performance and quality to CLUTO using document collections. The K-tree has a low time complexity that is suitable for large document collections. This tree structure allows for efficient disk based implementations where space requirements exceed that of main memory.

Affiliated with

Also associated with

No associations

Rating

K-tree: Large Scale Document Clustering does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with K-tree: Large Scale Document Clustering, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and K-tree: Large Scale Document Clustering will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-163939