20 citations · 50 across the 6 of their papers we have counts for
Showing 2010Show all
3 papers · 1 filter
cs.IR2010★ 1 cited
Random Indexing K-tree
Christopher M. De Vries, Lance De Vine, Shlomo Geva
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…
cs.IR2010★ 9 cited
K-tree: Large Scale Document Clustering
Christopher M. De Vries, Shlomo Geva
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 h…
cs.IR2010★ 5 cited
Document Clustering with K-tree
Christopher M. De Vries, Shlomo Geva
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…