Sciweavers

140 search results - page 10 / 28
» From the Nearest Neighbour Rule to Decision Trees
Sort
View
JMLR
2010
107views more  JMLR 2010»
14 years 6 months ago
Learning Instance-Specific Predictive Models
This paper introduces a Bayesian algorithm for constructing predictive models from data that are optimized to predict a target variable well for a particular instance. This algori...
Shyam Visweswaran, Gregory F. Cooper
ML
2000
ACM
154views Machine Learning» more  ML 2000»
14 years 11 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
GECCO
2005
Springer
195views Optimization» more  GECCO 2005»
15 years 5 months ago
Evolving fuzzy decision tree structure that adapts in real-time
A fuzzy logic algorithm has been developed that automatically allocates electronic attack (EA) resources distributed over different platforms in real-time. The controller must be ...
James F. Smith III
ADMA
2005
Springer
157views Data Mining» more  ADMA 2005»
15 years 5 months ago
Learning k-Nearest Neighbor Naive Bayes for Ranking
Accurate probability-based ranking of instances is crucial in many real-world data mining applications. KNN (k-nearest neighbor) [1] has been intensively studied as an effective c...
Liangxiao Jiang, Harry Zhang, Jiang Su
CIDM
2009
IEEE
15 years 6 months ago
Evolving decision trees using oracle guides
—Some data mining problems require predictive models to be not only accurate but also comprehensible. Comprehensibility enables human inspection and understanding of the model, m...
Ulf Johansson, Lars Niklasson