Sciweavers

495 search results - page 64 / 99
» Transfer Learning in Decision Trees
Sort
View
ACL
2003
13 years 9 months ago
Self-Organizing Markov Models and Their Application to Part-of-Speech Tagging
This paper presents a method to develop a class of variable memory Markov models that have higher memory capacity than traditional (uniform memory) Markov models. The structure of...
Jin-Dong Kim, Hae-Chang Rim, Jun-ichi Tsujii
ACL
2003
13 years 9 months ago
Using Predicate-Argument Structures for Information Extraction
In this paper we present a novel, customizable IE paradigm that takes advantage of predicate-argument structures. We also introduce a new way of automatically identifying predicat...
Mihai Surdeanu, Sanda M. Harabagiu, John Williams,...
NIPS
2001
13 years 9 months ago
Kernel Machines and Boolean Functions
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...
Adam Kowalczyk, Alex J. Smola, Robert C. Williamso...
IDA
2007
Springer
14 years 2 months ago
Combining Bagging and Random Subspaces to Create Better Ensembles
Random forests are one of the best performing methods for constructing ensembles. They derive their strength from two aspects: using random subsamples of the training data (as in b...
Pance Panov, Saso Dzeroski
ICDM
2009
IEEE
124views Data Mining» more  ICDM 2009»
14 years 2 months ago
Rule Ensembles for Multi-target Regression
—Methods for learning decision rules are being successfully applied to many problem domains, especially where understanding and interpretation of the learned model is necessary. ...
Timo Aho, Bernard Zenko, Saso Dzeroski