[15] J. C. Dunn. A fuzzy relative of the isodata process and its use in detecting compact well-separated clusters. Journal of Cybernetics, 3(3):32-57, 1973.
[16] Vladimir Estivill-Castro, Eugene Gilmore, and René Hexel. Constructing interpretable decision trees using parallel coordinates. In Leszek Rutkowski, Rafat Scherer, Marcin Korytkowski, Witold Pedrycz, Ryszard Tadeusiewicz, and Jacek M. Zurada, editors, Artificial Intelligence and Soft Computing, pages 152-164, Cham, 2020. Springer International Publishing.
[17] Vladimir Estivill-Castro, Eugene Gilmore, and René Hexel. Human-in-the-loop construction of decision tree classifiers with parallel coordinates. In 2020 IEEE International Conference on Systems, Man, and Cybernetics (SMC), pages 3852-3859, 2020.
[18] R. A. Fisher. Iris. UCI Machine Learning Repository, 1988. DOI: 10.24432/C56C76.
[19] Yoav Freund and Robert E. Schapire. A desicion-theoretic generalization of on-line learning and an application to boosting. In Paul Vitanyi, editor, Computational Learning Theory, pages 23-37, Berlin, Heidelberg, 1995. Springer Berlin Heidelberg.
[20] Magzhan Gabidolla and Miguel Á. Carreira-Perpiñán. Optimal interpretable clustering using oblique decision trees. In Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, KDD '22, page 400–410, New York, NY, USA, 2022. Association for Computing Machinery.
[21] Magzhan Gabidolla, Arman Zharmagambetov, and Miguel Á. Carreira-Perpiñán. Improved multiclass adaboost using sparse oblique decision trees. In 2022 International Joint Conference on Neural Networks (IJCNN), pages 1–8, 2022.
[22] Pierre Geurts, Damien Ernst, and Louis Wehenkel. Extremely randomized trees. Machine learning, 63(1):3-42, 2006.
[23] Eugene Gilmore, Vladimir Estivill-Castro, and René Hexel. More interpretable decision trees. In Hugo Sanjurjo González, Iker Pastor López, Pablo García Bringas, Héctor Quintián, and Emilio Corchado, editors, Hybrid Artificial Intelligent Systems, pages 280–292, Cham, 2021. Springer International Publishing.
[24] Jack H. Good, Kyle Miller, and Artur Dubrawski. Kernel density decision trees. In Proceedings of the AAAI Spring Symposium on AI Engineering. Curran Associates, Inc., 2022.
[25] Bogdan Gulowaty and Michal Wojniak. Extracting interpretable decision tree ensemble from random forest. In 2021 International Joint Conference on Neural Networks (IJCNN), pages 1-8, 2021.
[26] Venkatesan Guruswami and Prasad Raghavendra. Hardness of learning halfspaces with noise. In 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), pages 543-552, 2006.
[27] Suryabhan Singh Hada, Miguel Á Carreira-Perpínán, and Arman Zharmagambetov. Sparse oblique decision trees: A tool to understand and manipulate neural net features. Data Mining and Knowledge Discovery, pages 1–40, 2023.
[28] Suryabhan Singh Hada and Miguel Á. Carreira-Perpínán. Sparse oblique decision trees: A tool to interpret natural language processing datasets. In 2022 International Joint Conference on Neural Networks (IJCNN), pages 1–8, 2022.
[29] Laurent Hyafil and Ronald L. Rivest. Constructing optimal binary decision trees is np-complete. Information Processing Letters, 5(1):15-17, 1976.
[30] Andras Janosi, William Steinbrunn, Matthias Pfisterer, and Robert Detrano. Heart Disease. UCI Machine Learning Repository, 1988. DOI: 10.24432/C52P4X.
[31] M. Koklu and I.A. Ozkan. Dry Bean Dataset. UCI Machine Learning Repository, 2020.
[32] Peter Kontschieder, Madalina Fiterau, Antonio Criminisi, and Samuel Rota Bulò. Deep neural decision forests. In 2015 IEEE International Conference on Computer Vision (ICCV), pages 1467-1475, 2015.