Sciweavers

1209 search results - page 55 / 242
» Semi-Supervised Learning with Trees
Sort
View
ICDM
2010
IEEE
154views Data Mining» more  ICDM 2010»
13 years 6 months ago
Discrimination Aware Decision Tree Learning
Abstract--Recently, the following discrimination aware classification problem was introduced: given a labeled dataset and an attribute , find a classifier with high predictive accu...
Faisal Kamiran, Toon Calders, Mykola Pechenizkiy
NIPS
2004
13 years 9 months ago
The Power of Selective Memory: Self-Bounded Learning of Prediction Suffix Trees
Prediction suffix trees (PST) provide a popular and effective tool for tasks such as compression, classification, and language modeling. In this paper we take a decision theoretic...
Ofer Dekel, Shai Shalev-Shwartz, Yoram Singer
CORR
2008
Springer
108views Education» more  CORR 2008»
13 years 8 months ago
Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning
Resolution refinements called w-resolution trees with lemmas (WRTL) and with input lemmas (WRTI) are introduced. Dag-like resolution is equivalent to both WRTL and WRTI when there...
Samuel R. Buss, Jan Hoffmann 0002, Jan Johannsen
ICML
1999
IEEE
14 years 9 months ago
Lazy Bayesian Rules: A Lazy Semi-Naive Bayesian Learning Technique Competitive to Boosting Decision Trees
Lbr is a lazy semi-naive Bayesian classi er learning technique, designed to alleviate the attribute interdependence problem of naive Bayesian classi cation. To classify a test exa...
Zijian Zheng, Geoffrey I. Webb, Kai Ming Ting
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