Sciweavers

390 search results - page 37 / 78
» A Model of Inductive Bias Learning
Sort
View
KDD
2002
ACM
171views Data Mining» more  KDD 2002»
14 years 9 months ago
Mining complex models from arbitrarily large databases in constant time
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
Geoff Hulten, Pedro Domingos
KDD
2003
ACM
150views Data Mining» more  KDD 2003»
14 years 9 months ago
Learning relational probability trees
Classification trees are widely used in the machine learning and data mining communities for modeling propositional data. Recent work has extended this basic paradigm to probabili...
Jennifer Neville, David Jensen, Lisa Friedland, Mi...
ICASSP
2008
IEEE
14 years 3 months ago
Ratio semi-definite classifiers
We present a novel classification model that is formulated as a ratio of semi-definite polynomials. We derive an efficient learning algorithm for this classifier, and apply it...
Jonathan Malkin, Jeff Bilmes
PAMI
2008
176views more  PAMI 2008»
13 years 8 months ago
Learning Flexible Features for Conditional Random Fields
Abstract-- Extending traditional models for discriminative labeling of structured data to include higher-order structure in the labels results in an undesirable exponential increas...
Liam Stewart, Xuming He, Richard S. Zemel
ECAI
2008
Springer
13 years 10 months ago
MTForest: Ensemble Decision Trees based on Multi-Task Learning
Many ensemble methods, such as Bagging, Boosting, Random Forest, etc, have been proposed and widely used in real world applications. Some of them are better than others on noisefre...
Qing Wang, Liang Zhang, Mingmin Chi, Jiankui Guo