Sciweavers

82 search results - page 11 / 17
» Lookahead-based algorithms for anytime induction of decision...
Sort
View
IDA
2005
Springer
15 years 3 months ago
Learning from Ambiguously Labeled Examples
Inducing a classification function from a set of examples in the form of labeled instances is a standard problem in supervised machine learning. In this paper, we are concerned w...
Eyke Hüllermeier, Jürgen Beringer
ML
2000
ACM
154views Machine Learning» more  ML 2000»
14 years 9 months ago
Lazy Learning of Bayesian Rules
The naive Bayesian classifier provides a simple and effective approach to classifier learning, but its attribute independence assumption is often violated in the real world. A numb...
Zijian Zheng, Geoffrey I. Webb
IFIP12
2008
14 years 11 months ago
P-Prism: A Computationally Efficient Approach to Scaling up Classification Rule Induction
Top Down Induction of Decision Trees (TDIDT) is the most commonly used method of constructing a model from a dataset in the form of classification rules to classify previously unse...
Frederic T. Stahl, Max A. Bramer, Mo Adda
KDD
2000
ACM
121views Data Mining» more  KDD 2000»
15 years 1 months ago
Mining high-speed data streams
Many organizations today have more than very large databases; they have databases that grow without limit at a rate of several million records per day. Mining these continuous dat...
Pedro Domingos, Geoff Hulten
MLDM
2009
Springer
15 years 4 months ago
PMCRI: A Parallel Modular Classification Rule Induction Framework
In a world where massive amounts of data are recorded on a large scale we need data mining technologies to gain knowledge from the data in a reasonable time. The Top Down Induction...
Frederic T. Stahl, Max A. Bramer, Mo Adda