Sciweavers

240 search results - page 5 / 48
» Forest for the trees
Sort
View
SIGKDD
2000
231views more  SIGKDD 2000»
13 years 7 months ago
KDD-99 Classifier Learning Contest: LLSoft's Results Overview
Kernel Miner is a new data-mining tool based on building the optimal decision forest. The tool won second place in the KDD'99 Classifier Learning Contest, August 1999. We des...
Itzhak Levin
ACL
2008
13 years 8 months ago
Forest Reranking: Discriminative Parsing with Non-Local Features
Conventional n-best reranking techniques often suffer from the limited scope of the nbest list, which rules out many potentially good alternatives. We instead propose forest reran...
Liang Huang
BIRTHDAY
2009
Springer
14 years 2 months ago
Covering a Tree by a Forest
Consider a tree T and a forest F. The paper discusses the following new problems: The Forest vertex-cover problem (FVC): cover the vertices of T by a minimum number of copies of tr...
Fanica Gavril, Alon Itai
ACL
2001
13 years 8 months ago
Parse Forest Computation of Expected Governors
In a headed tree, each terminal word can be uniquely labeled with a governing word and grammatical relation. This labeling is a summary of a syntactic analysis which eliminates de...
Helmut Schmid, Mats Rooth
PAMI
1998
127views more  PAMI 1998»
13 years 7 months ago
The Random Subspace Method for Constructing Decision Forests
—Much of previous attention on decision trees focuses on the splitting criteria and optimization of tree sizes. The dilemma between overfitting and achieving maximum accuracy is ...
Tin Kam Ho