Sciweavers

225 search results - page 4 / 45
» On Learning Decision Trees with Large Output Domains
Sort
View
ICML
2005
IEEE
14 years 8 months ago
Learning as search optimization: approximate large margin methods for structured prediction
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
Daniel Marcu, Hal Daumé III
ACL
2001
13 years 9 months ago
Japanese Named Entity Recognition based on a Simple Rule Generator and Decision Tree Learning
Named entity (NE) recognition is a task in which proper nouns and numerical information in a document are detected and classified into categories such as person, organization, loc...
Hideki Isozaki
CVPR
2006
IEEE
14 years 9 months ago
Supervised Learning of Edges and Object Boundaries
Edge detection is one of the most studied problems in computer vision, yet it remains a very challenging task. It is difficult since often the decision for an edge cannot be made ...
Piotr Dollár, Zhuowen Tu, Serge Belongie
ICML
1999
IEEE
14 years 8 months ago
The Alternating Decision Tree Learning Algorithm
The applicationofboosting procedures to decision tree algorithmshas been shown to produce very accurate classi ers. These classiers are in the form of a majority vote over a numbe...
Yoav Freund, Llew Mason
JMLR
2012
11 years 10 months ago
Structured Output Learning with High Order Loss Functions
Often when modeling structured domains, it is desirable to leverage information that is not naturally expressed as simply a label. Examples include knowledge about the evaluation ...
Daniel Tarlow, Richard S. Zemel