# Chandelier Decision Tree

Chapter

## Abstract

This chapter proposes two new techniques called the *chandelier decision tree* and the *random chandelier*. This pair of techniques is similar to the well-known pair of techniques, the decision tree and the random forest. The chapter also presents a previously proposed algorithm called the unit circle algorithm (UCA) and proposes a family of UCA-based algorithms called the unit circle machine (UCM), unit ring algorithm (URA), and unit ring machine (URM). The unit circle algorithm integrates a normalization process to define a unit circle domain, and thus the other proposed algorithms adopt the phrase “unit circle.” The chandelier decision tree and the random chandelier use the unit ring machine to build the chandelier trees.

## References

- 1.S. Suthaharan. “unit-circle classification algorithm to characterize back attack and normal traffic for network intrusion detection systems,” in Proceedings of the IEEE International Conference on Intelligence and Security Informatics, pp. 150–152, 2012.Google Scholar
- 2.L. Rokach, and O. Maimon. “Top-down induction of decision trees classifiers-a survey.” IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, vol. 35, no. 4, pp. 476–487, 2005.CrossRefGoogle Scholar
- 3.L. Breiman, “Random forests.” Machine learning 45, pp. 5–32, 2001.zbMATHCrossRefGoogle Scholar
- 4.S. Suthaharan. “A single-domain, representation-learning model for big data classification of network intrusion,” Machine Learning and Data Mining in Pattern Recognition, Lecture Notes in Computer Science Volume 7988, pp. 296–310, 2013.CrossRefGoogle Scholar
- 5.T. Hastie, R. Tibshirani, and J. Friedman. The Elements of Statistical Learning. New York: Springer, 2009.zbMATHCrossRefGoogle Scholar
- 6.L. Breiman. “Bagging predictors.” Machine learning 24, pp. 123–140, 1996.zbMATHMathSciNetGoogle Scholar

## Copyright information

© Springer Science+Business Media New York 2016