Efficient Construction of Decision Trees by the Dual Information Distance Method

@article{BenGal2014EfficientCO,
  title={Efficient Construction of Decision Trees by the Dual Information Distance Method},
  author={I. Ben-Gal and Alexandra Dana and N. Shkolnik and G. Singer},
  journal={Quality Technology & Quantitative Management},
  year={2014},
  volume={11},
  pages={133 - 147}
}
Abstract The construction of efficient decision and classification trees is a fundamental task in Big Data analytics which is known to be NP-hard. Accordingly, many greedy heuristics were suggested for the construction of decision-trees, but were found to result in local-optimum solutions. In this work we present the dual information distance (DID) method for efficient construction of decision trees that is computationally attractive, yet relatively robust to noise. The DID heuristic selects… Expand
25 Citations
Improving decision trees by Tsallis Entropy Information Metric method
  • 8
  • PDF
Improving Decision Trees Using Tsallis Entropy
  • 2
  • PDF
Parallel construction of decision trees with consistently non-increasing expected number oftests
  • PDF
Subspace Analysis in Multi-Class Datasets: An Application to Novelty Detection Ensembles
  • M. Bacher, E. Shmueli, I. Ben-Gal
  • Computer Science
  • 2018 IEEE International Conference on the Science of Electrical Engineering in Israel (ICSEE)
  • 2018
Subspace selection for anomaly detection: An information theory approach
  • 3
Ensemble-Bayesian SPC: Multi-mode process monitoring for novelty detection
  • 4
  • PDF
...
1
2
3
...

References

SHOWING 1-10 OF 28 REFERENCES
Decision Tree Induction: How Effective is the Greedy Heuristic?
  • 36
  • PDF
A Distance-Based Attribute Selection Measure for Decision Tree Induction
  • R. Mántaras
  • Mathematics, Computer Science
  • Machine Learning
  • 2005
  • 345
  • PDF
Lower Bounds on Learning Decision Lists and Trees
  • 101
Decision tree design from a communication theory standpoint
  • 87
  • PDF
Evaluation of gene-expression clustering via mutual information distance measure
  • 164
  • PDF
Orthogonal Relief Algorithm for Feature Selection
  • Jun Yang, Y. Li
  • Computer Science
  • ICIC
  • 2006
  • 16
Support-Vector Networks
  • 32,193
  • PDF
An Informational Search for a Moving Target
  • E. Kagan, I. Ben-Gal
  • Computer Science
  • 2006 IEEE 24th Convention of Electrical & Electronics Engineers in Israel
  • 2006
  • 14
Elements of Information Theory
  • 40,519
  • PDF
Real-Time Heuristic Search
  • R. Korf
  • Mathematics, Computer Science
  • Artif. Intell.
  • 1990
  • 1,023
...
1
2
3
...