221 search results - page 3 / 45 » Random Indexing K-tree |
CIKM
2007
Springer
13 years 11 months ago
2007
Springer
Index compression techniques are known to substantially decrease the storage requirements of a text retrieval system. As a side-effect, they may increase its retrieval performanc...
CPC
2002
13 years 5 months ago
2002
The Wiener index is analyzed for random recursive trees and random binary search trees in the uniform probabilistic models. We obtain the expectations, asymptotics for the varianc...
TKDE
2011
13 years 4 days ago
2011
—We consider approaches for similarity search in correlated, high-dimensional data-sets, which are derived within a clustering framework. We note that indexing by “vector appro...
ICIP
2009
IEEE
13 years 2 months ago
2009
IEEE
Decision trees have been widely used for online learning classification. Many approaches usually need large data stream to finish decision trees induction, as show notable limitat...
WWW
2006
ACM
14 years 5 months ago
2006
ACM
We revisit a problem introduced by Bharat and Broder almost a decade ago: how to sample random pages from the corpus of documents indexed by a search engine, using only the search...