1283 search results - page 26 / 257 » Learning Voting Trees |
ICML
2004
IEEE
15 years 10 months ago
2004
IEEE
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
ICML
2004
IEEE
15 years 10 months ago
2004
IEEE
Conditional Random Fields (CRFs; Lafferty, McCallum, & Pereira, 2001) provide a flexible and powerful model for learning to assign labels to elements of sequences in such appl...
IJCAI
2003
14 years 11 months ago
2003
Information extraction (IE) aims at extracting specific information from a collection of documents. A lot of previous work on 10 from semi-structured documents (in XML or HTML) us...
ML
2006
ACM
14 years 9 months ago
2006
ACM
We present an approach to email filtering based on the suffix tree data structure. A method for the scoring of emails using the suffix tree is developed and a number of scoring and...
85
Voted
IJCSS
2000
14 years 9 months ago
2000
Abstract. The quality of a decision tree is usually evaluated through its complexity and its generalization accuracy. Tree-simpli