Sciweavers

334 search results - page 34 / 67
» The Alternating Decision Tree Learning Algorithm
Sort
View
ECML
2007
Springer
15 years 3 months ago
Clustering Trees with Instance Level Constraints
Abstract. Constrained clustering investigates how to incorporate domain knowledge in the clustering process. The domain knowledge takes the form of constraints that must hold on th...
Jan Struyf, Saso Dzeroski
CEC
2010
IEEE
14 years 10 months ago
Learning-assisted evolutionary search for scalable function optimization: LEM(ID3)
Inspired originally by the Learnable Evolution Model(LEM) [5], we investigate LEM(ID3), a hybrid of evolutionary search with ID3 decision tree learning. LEM(ID3) involves interleav...
Guleng Sheri, David Corne
84
Voted
SDM
2010
SIAM
158views Data Mining» more  SDM 2010»
14 years 11 months ago
On the Use of Combining Rules in Relational Probability Trees
A relational probability tree (RPT) is a type of decision tree that can be used for probabilistic classification of instances with a relational structure. Each leaf of an RPT cont...
Daan Fierens
FOCS
2003
IEEE
15 years 3 months ago
Learning DNF from Random Walks
We consider a model of learning Boolean functions from examples generated by a uniform random walk on {0, 1}n . We give a polynomial time algorithm for learning decision trees and...
Nader H. Bshouty, Elchanan Mossel, Ryan O'Donnell,...
63
Voted
ACL
2003
14 years 11 months ago
Learning to Predict Pitch Accents and Prosodic Boundaries in Dutch
We train a decision tree inducer (CART) and a memory-based classifier (MBL) on predicting prosodic pitch accents and breaks in Dutch text, on the basis of shallow, easy-to-comput...
Erwin Marsi, Martin Reynaert, Antal van den Bosch,...