Random Indexing K-tree

Details Random Indexing K-tree Random Indexing K-tree

2010-01-06

arxiv.org/abs/1001.0833v2

Computer Science

Information Retrieval

8 pages, ADCS 2009; Hyperref and cleveref LaTeX packages conflicted. Removed cleveref

Scientific paper

Random Indexing (RI) K-tree is the combination of two algorithms for clustering. Many large scale problems exist in document clustering. RI K-tree scales well with large inputs due to its low complexity. It also exhibits features that are useful for managing a changing collection. Furthermore, it solves previous issues with sparse document vectors when using K-tree. The algorithms and data structures are defined, explained and motivated. Specific modifications to K-tree are made for use with RI. Experiments have been executed to measure quality. The results indicate that RI K-tree improves document cluster quality over the original K-tree algorithm.

Affiliated with

Also associated with

No associations

Rating

Random Indexing K-tree 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 Random Indexing K-tree, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Random Indexing K-tree will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-163953