This work studies combinatorial objects of pyramidal structure. It considers one of the ways of representing rules in a hierarchical consecutive structure: the decision tree method, where each object corresponds to the single node that provides a solution. The paper proposes algorithms of building a decision tree based on the generalized Pascal’s triangle and generalized Pascal’s pyramid.

The offered methods of the combinatorial analysis of hierarchical structures in decision-making problems can be used in creating and analyzing knowledge databases.

hierarchical structure, partially ordered set, generalized Pascal’s pyramid, decision-making problems, decision tree, combinatorial algorithms.

Received: July 5, 2022; Accepted: September 3, 2022; Published: September 27, 2022

How to cite this article: O. V. Kuzmin, Generalized Pascal’s pyramids and decision trees, Advances and Applications in Discrete Mathematics 34 (2022), 1-15. http://dx.doi.org/10.17654/0974165822039

This Open Access Article is Licensed under Creative Commons Attribution 4.0 International License

References
[1] M. Mesarović, D. Mako and Y. Takahara, Theory of Hierarchical Multilevel Systems, Academic Press, New York, 1970, 294 pp.
[2] T. L. Saaty, The Analytic Hierarchy Process: Planning, Priority Setting, Resource Allocation, McGraw-Hill, New York, 1980, 287 pp.
[3] R. P. Stanley, Enumerative Combinatorics, Vol. 1, Cambridge University Press, Cambridge, 1997, 335 pp.
[4] G. Grätzer, Lattice Theory: Foundation, Springer, Basel AG, 2011, 644 pp.
[5] A. A. Balagura and O. V. Kuzmin, Generalized Pascal pyramid and partially ordered sets, Surveys on Applied and Industrial Mathematics 14(1) (2007), 88-91 (in Russian).
[6] V. B. Lebedev and E. A. Fedotov, Information system data modeling using lattice theory methods, University Proceedings, Volga region, Engineering Sciences, 2015, pp. 104-110 (in Russian).
[7] S. K. Murthy, Automatic construction of decision trees from data: a multidisciplinary survey, Data Min. Knowl. Discov. 2(4) (1998), 345-389.
[8] O. V. Kuzmin, Generalized Pascal Pyramids and their Applications, Nauka Publ., Novosibirsk, 2000, 294 pp. (in Russian).
[9] O. V. Kuzmin, A. A. Balagura, V. V. Kuzmina and I. A. Khudonogov, Partially ordered sets and combinatory objects of the pyramidal structure, Advances and Applications in Discrete Mathematics 20(2) (2019), 219-236.
[10] C. I. Hovland, Computer simulation of thinking, American Psychologist 15(11) (1960), 687-693.
[11] E. B. Hunt, Marin Janet and J. S. Philip, Experiments in Induction, Academic Press, New York, 1966, 247 pp.
[12] J. R. Quinlan, Induction of decision trees, Machine Learning 1(1) (1986), 81-106.
[13] J. R. Quinlan, C4.5: Programs for Machine learning, Morgan Kaufmann Publishers Inc., San Mateo, 1993, 302 pp.
[14] L. Breiman, J. Friedman, R. Olshen and C. Stone, Classification and Regression Trees, Wadsworth Books, New York, 1984, 358 pp.
[15] A. A. Balagura and O. V. Kuzmin, Generalized Pascal pyramids and their reciprocals, Discrete Math. Appl. 17(6) (2007), 619-628.
[16] B. A. Bondarenko, Generalized Pascal Triangles and Pyramids, their Fractals, Graphs, and Applications, The Fibonacci Association, Santa Clara, 2010, 296 pp.
[17] O. V. Kuzmin and M. V. Seregina, Upper units of the generalized Pascal pyramid and their interpretations, Journal of Siberian Federal University, Mathematics and Physics 3(4) (2010), 533-543 (in Russian).
[18] O. V. Kuzmin and M. V. Seregina, Plane sections of the generalized Pascal pyramid and their interpretations, Discrete Math. Appl. 20(4) (2010), 377-389.
[19] O. V. Kuzmin, A. P. Khomenko and A. I. Artyunin, Discrete model of static loads distribution management on lattice structures, Advances and Applications in Discrete Mathematics 19(3) (2018), 183-193.
[20] O. V. Kuzmin, A. P. Khomenko and A. I. Artyunin, Development of special mathematical software using combinatorial numbers and lattice structure analysis, Advances and Applications in Discrete Mathematics 19(3) (2018), 229-242.
[21] L. Lovász, Combinatorial Problems and Exercises, Akadémiai Kiadó, Budapest, 1979, 551 pp.
[22] Nicos Christofides, Graph Theory: An Algorithmic Approach, Academic Press, London, 1975, 400 pp.