activity
20102015
most citedDocument Clustering Evaluation: Divergence from a Random Baseline

20 citations · 50 across the 6 of their papers we have counts for

collaborators

6 papers

cs.IR2015★ 9 cited

Parallel Streaming Signature EM-tree: A Clustering Algorithm for Web Scale Applications

Christopher M. de Vries, Lance De Vine, Shlomo Geva +1

The proliferation of the web presents an unsolved problem of automatically analyzing billions of pages of natural language. We introduce a scalable algorithm that clusters hundreds…

cs.IR2012★ 20 cited

Document Clustering Evaluation: Divergence from a Random Baseline

Christopher M. De Vries, Shlomo Geva, Andrew Trotman

Divergence from a random baseline is a technique for the evaluation of document clustering. It ensures cluster quality measures are performing work that prevents ineffective cluste…

cs.IR2012★ 6 cited

TopSig: Topology Preserving Document Signatures

Shlomo Geva, Christopher M. De Vries

Performance comparisons between File Signatures and Inverted Files for text retrieval have previously shown several significant shortcomings of file signatures relative to inverted…

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…