Sciweavers

12 search results - page 2 / 3
» Partitioning Nominal Attributes in Decision Trees
Sort
View
ML
2000
ACM
154views Machine Learning» more  ML 2000»
13 years 4 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
PAKDD
2007
ACM
140views Data Mining» more  PAKDD 2007»
13 years 11 months ago
A Hybrid Multi-group Privacy-Preserving Approach for Building Decision Trees
In this paper, we study the privacy-preserving decision tree building problem on vertically partitioned data. We made two contributions. First, we propose a novel hybrid approach, ...
Zhouxuan Teng, Wenliang Du
IJCAI
1993
13 years 6 months ago
Multi-Interval Discretization of Continuous-Valued Attributes for Classification Learning
Since most real-world applications of classification learning involve continuous-valued attributes, properly addressing the discretization process is an important problem. This pa...
Usama M. Fayyad, Keki B. Irani
ECML
2003
Springer
13 years 10 months ago
Logistic Model Trees
Abstract. Tree induction methods and linear models are popular techniques for supervised learning tasks, both for the prediction of nominal classes and continuous numeric values. F...
Niels Landwehr, Mark Hall, Eibe Frank
ICDM
2009
IEEE
124views Data Mining» more  ICDM 2009»
13 years 11 months ago
Rule Ensembles for Multi-target Regression
—Methods for learning decision rules are being successfully applied to many problem domains, especially where understanding and interpretation of the learned model is necessary. ...
Timo Aho, Bernard Zenko, Saso Dzeroski