Sciweavers

88 search results - page 2 / 18
» Optimizing Interval Training Protocols Using Data Mining Dec...
Sort
View
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 6 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
HICSS
2009
IEEE
144views Biometrics» more  HICSS 2009»
14 years 19 days ago
Privacy Preserving Decision Tree Mining from Perturbed Data
Privacy preserving data mining has been investigated extensively. The previous works mainly fall into two categories, perturbation and randomization based approaches and secure mu...
Li Liu, Murat Kantarcioglu, Bhavani M. Thuraisingh...
KDD
1995
ACM
140views Data Mining» more  KDD 1995»
13 years 9 months ago
Decision Tree Induction: How Effective is the Greedy Heuristic?
Mostexisting decision tree systemsuse a greedyapproachto inducetrees -- locally optimalsplits are inducedat every node of the tree. Althoughthe greedy approachis suboptimal,it is ...
Sreerama K. Murthy, Steven Salzberg
PAKDD
1998
ACM
158views Data Mining» more  PAKDD 1998»
13 years 10 months ago
Data Mining Using Dynamically Constructed Recurrent Fuzzy Neural Networks
Abstract. Approaches to data mining proposed so far are mainly symbolic decision trees and numerical feedforward neural networks methods. While decision trees give, in many cases, ...
Yakov Frayman, Lipo Wang
CIDM
2009
IEEE
14 years 18 days 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