Random Indexing K-tree

13 years 4 months ago

Download eprints.qut.edu.au

Random Indexing K-tree is the combination of two algorithms suited for large scale document clustering. Keywords Random Indexing, K-tree, Dimensionality Reduction, B-tree, Search Tree, Clustering, Document Clustering, Vector Quantization, k-means

Christopher M. De Vries, Lance De Vine, Shlomo Gev

Real-time Traffic

CORR 2010 | Education | Keywords Random Indexing | Random Indexing | Random Indexing K-tree |

claim paper

» The Degree Distribution of Random kTrees

» Diagnosis Code Assignment Support Using Random Indexing of Patient Records A Qualitative ...

» Using Random Indexing to improve Singular Value Decomposition for Latent Semantic Analysis

» Inverted index compression via online document routing

» Random Indexing using Statistical Weight Functions

» ContentBased Image Retrieval by Indexing Random Subwindows with Randomized Trees

» Measuring Index Quality Using Random Walks on the Web

» Dynamic index coding for wireless broadcast networks

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2010
Where	CORR
Authors	Christopher M. De Vries, Lance De Vine, Shlomo Geva

Comments (0)

Sciweavers

Random Indexing K-tree

CORR 2010 | Education | Keywords Random Indexing | Random Indexing | Random Indexing K-tree |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers