1068 search results - page 32 / 214 » Extremely randomized trees |
120
Voted
EMNLP
2011
14 years 4 months ago
2011
126
Voted
CORR
2010
Springer
15 years 5 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...
177
click to vote
WEA
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. The suffix tree is an extremely important data structure for stringology, with a wealth of applications in bioinformatics. Classical implementations require much space, w...
138
click to vote
IWOCA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We analyze special random network models – so-called thickened trees – which are constructed by random trees where the nodes are replaced by local clusters. These obj...
278
click to vote
CP
2009
Springer
16 years 5 months ago
2009
Springer
Decision tree induction techniques attempt to find small trees that fit a training set of data. This preference for smaller trees, which provides a learning bias, is often justifie...