Sciweavers

352 search results - page 18 / 71
» A Fast Decision Tree Learning Algorithm
Sort
View
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
16 years 2 months ago
The offset tree for learning with partial labels
We present an algorithm, called the offset tree, for learning in situations where a loss associated with different decisions is not known, but was randomly probed. The algorithm i...
Alina Beygelzimer, John Langford
SAC
2006
ACM
15 years 8 months ago
Induction of compact decision trees for personalized recommendation
We propose a method for induction of compact optimal recommendation policies based on discovery of frequent itemsets in a purchase database, followed by the application of standar...
Daniel Nikovski, Veselin Kulev
78
Voted
ICML
2005
IEEE
16 years 3 months ago
Fast condensed nearest neighbor rule
We present a novel algorithm for computing a training set consistent subset for the nearest neighbor decision rule. The algorithm, called FCNN rule, has some desirable properties....
Fabrizio Angiulli
ICML
2006
IEEE
16 years 3 months ago
Full Bayesian network classifiers
The structure of a Bayesian network (BN) encodes variable independence. Learning the structure of a BN, however, is typically of high computational complexity. In this paper, we e...
Jiang Su, Harry Zhang
ICASSP
2011
IEEE
14 years 6 months ago
A sliding-window online fast variational sparse Bayesian learning algorithm
In this work a new online learning algorithm that uses automatic relevance determination (ARD) is proposed for fast adaptive nonlinear filtering. A sequential decision rule for i...
Thomas Buchgraber, Dmitriy Shutin, H. Vincent Poor