| Keywords and phrases: hierarchical structure, partially ordered set, generalized Pascal’s pyramid, generalized Stirling’s numbers, information retrieval problems, relevance index.
Received: February 3, 2024; Accepted: July 24, 2024; Published: October 21, 2024
How to cite this article: O. V. Kuzmin, Generalized Pascal’s pyramids and combinatorial information retrieval problems, Advances and Applications in Discrete Mathematics 41(8) (2024), 677-695. https://doi.org/10.17654/0974165824043
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] Marvin L. Manheim, Hierarchical Structure: A Model of Design and Planning Processes, MIT Press, Cambridge, 1966, 227 pp.
[4] O. V. Kuzmin and V. I. Martyanov, Combinatorial-logical Methods of Analysis of Hierarchical Structures and Development of Intelligent Decision Support Systems, Irkutsk University Press, Irkutsk, 2022, 199 pp. (in Russian).
[5] R. P. Stanley, Enumerative Combinatorics, Vol. 1, Cambridge University Press, Cambridge, 1997, 335 pp.
[6] G. Grätzer, Lattice Theory: Foundation, Springer, Basel AG, 2011, 644 pp.
[7] George E. Andrews, Christian Krattenthaler and Alan Krinik, eds., Lattice Path Combinatorics and Applications, Springer, 2019, 418 pp.
[8] William T. Trotter, Combinatorics and Partially Ordered Sets: Dimension Theory, Johns Hopkins University Press, London, 1992, 328 pp.
[9] A. A. Balagura and O. V. Kuzmin, Generalized Pascal’s pyramid and partially ordered sets, Surveys on Applied and Industrial Mathematics 14(1) (2007), 88-91 (in Russian).
[10] V. B. Lebedev and E. A. Fedotov, Information system data modeling using the lattice theory methods, University Proceedings, Volga Region, Engineering Sciences, 2015, pp. 104-110 (in Russian).
[11] S. K. Murthy, Automatic construction of decision trees from data: a multidisciplinary survey, Data Min. Knowl. Discov. 2(4) (1998), 345-389.
[12] O. V. Kuzmin, Generalized Pascal Pyramids and their Applications, Nauka Publ., Novosibirsk, 2000, 294 pp. (in Russian).
[13] 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), 229-242.
[14] R. F. Ahlswede and I. Wegener, Search Problems, John Wiley & Sons, New York, 1987, 296 pp.
[15] P. I. Braslavskiy, E. A. Vovk and M. Yu. Maslov, Faceted organization of the internet catalogue and automatic classification of documents by genre: proceedings of international seminar “Dialogue-2002”, Vol. 2, Computer Linguistics and Intellectual Technologies, Nauka Publ., Moscow, 2002, pp. 83-93 (in Russian).
[16] T. J. Theorey and J. P. Fry, Design of Database Structures, Prentice-Hall, Englewood Cliffs, New York, 1982, 492 pp.
[17] A. A. Balagura and O. V. Kuzmin, Generalized Pascal pyramids and their reciprocals, Discrete Math. Appl. 17(6) (2007), 619-628.
[18] B. A. Bondarenko, Generalized Pascal Triangles and Pyramids, their Fractals, Graphs, and Applications, The Fibonacci Association, Santa Clara, 2010, 296 pp.
[19] O. V. Kuzmin and M. V. Seregina, Upper unit of the generalized Pascal pyramid and their interpretations, The Journal of Siberian Federal University, Mathematics and Physics 3(4) (2010), 533-543 (in Russian).
[20] 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.
[21] O. V. Kuzmin, Generalized Pascal’s pyramids and decision trees, Advances and Applications in Discrete Mathematics 34 (2022), 1-15.
[22] 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.
[23] 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.
[24] I. G. Macdonald, Symmetric Functions and Hall Polynomials, Second Edition, Clarendon Press, Oxford, 1995, 475 pp.
[25] R. A. Baeza-Yates and B. A. Ribeiro-Neto, Modern Information Retrieval: The Concepts and Technology behind Search (second edition), Addison-Wesley, New York, 2011, 960 pp.
[26] Donald E. Knuth, The Art of Computer Programming, Sorting and Searching. Second Edition, Addison-Wesley, Reading, Massachusetts, 1998, Vol. 3, 780 pp.
[27] C. J. Date, An Introduction to Database Systems, Pearson: Addison-Wesley, Boston, 2004, 983 pp.
[28] Charles T. Meadow, The Analysis of Information Systems, Melville Pub. Co., Los Angeles, 1973, 420 pp.
[29] Gerard Salton, Automatic Information Organization and Retrieval, McGraw-Hill, New York, 1968, 514 pp.
[30] Gerard Salton, Dynamic Information and Library Processing, Prentice-Hall, New York, 1975, 523 pp.
[31] Christopher D. Manning, Prabhakar Raghavan and Hinrich Schütze, Introduction to Information Retrieval, Cambridge University Press, Cambridge, England, 2008, 504 pp.
[32] M. Ushold and М. Gruninger, Ontologies: Principles, Methods and Applications, Knowledge Engineering Review 11(2) (1996), 115-121.
[33] O. V. Kuzmin and T. A. Loginov, Constructing the relevance index with the help of generalized Pascal’s pyramids, The Bulletin of Buryat State University, Series 13: Mathematics and Information Science (3) (2006), 40-45 (in Russian).
[34] M. L. Platonov and V. N. Dokin, Triangular scheme of population evolution, Investigations on Geomagnetics, Aeronomy and Solar Physics, Nauka Publ., Moscow, (35) (1975), 26-31 (in Russian).
[35] O. V. Kuzmin and M. V. Seregina, Upper unit of the generalized Pascal pyramid and their interpretations, Journal of Siberian Federal University, Mathematics and Physics 3(4) (2010), 533-543 (in Russian).
|
