1068 search results - page 32 / 214 » Extremely randomized trees |
EMNLP
2011
12 years 8 months ago
2011
CORR
2010
Springer
13 years 8 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...
WEA
2010
Springer
13 years 6 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...
IWOCA
2009
Springer
14 years 3 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...
CP
2009
Springer
14 years 9 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...