CORR
2010
Springer
13 years 11 months ago
2010
Springer
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 T...
EMNLP
2006
14 years 28 days ago
2006
Random Indexing is a vector space technique that provides an efficient and scalable approximation to distributional similarity problems. We present experiments showing Random Inde...
LREC
2008
14 years 29 days ago
2008
We present results from using Random Indexing for Latent Semantic Analysis to handle Singular Value Decomposition tractability issues. We compare Latent Semantic Analysis, Random ...
TSD
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. This paper suggests a novel representation for documents that is intended to improve precision. This representation is generated by combining two central techniques: Rand...