Search Sciweavers | Sciweavers

20

ICML
2004
IEEE

109views Machine Learning» more ICML 2004»

Lookahead-based algorithms for anytime induction of decision trees

14 years 8 months ago

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, ...

Saher Esmeir, Shaul Markovitch

claim paper

Read More »

24

click to vote

ICML
2004
IEEE

203views Machine Learning» more ICML 2004»

Training conditional random fields via gradient tree boosting

14 years 8 months ago

Download web.engr.oregonstate.edu

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...

Thomas G. Dietterich, Adam Ashenfelter, Yaroslav B...

claim paper

Read More »

18

click to vote

IJCAI
2003

102views Artificial Intelligence» more IJCAI 2003»

Information Extraction from Web Documents Based on Local Unranked Tree Automaton Inference

13 years 9 months ago

Download dli.iiit.ac.in

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...

Raymond Kosala, Maurice Bruynooghe, Jan Van den Bu...

claim paper

Read More »

20

click to vote

ML
2006
ACM

132views Machine Learning» more ML 2006»

A suffix tree approach to anti-spam email filtering

13 years 7 months ago

Download www.dcs.bbk.ac.uk

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...

Rajesh Pampapathi, Boris Mirkin, Mark Levene

claim paper

Read More »

29

click to vote

IJCSS
2000

79views more IJCSS 2000»

Impact of learning set quality and size on decision tree performances

13 years 7 months ago