ALGORITHMS FOR MANAGING THE LOGICAL STRUCTURE OF THE DATABASE USING A PARAMETRIC MODEL OF COMPETITIVE ACCESS TO QUERIES BASED ON THE RANDOM FOREST METHOD
- Authors: Gromey D.D.1
-
Affiliations:
- Federal State Government Educational Institution of Higher Education "The Academy of Federal Security Guard Service of the Russian Federation"
- Issue: Vol 6, No 2 (2019)
- Pages: 41-47
- Section: Articles
- URL: https://journals.eco-vector.com/2313-223X/article/view/529716
- DOI: https://doi.org/10.336%209%203/2313-%20223X%20-%202019%20-%206%20-%202-%2041-%204
- ID: 529716
Cite item
Open Access
Access granted
Abstract
In article discusses the approach to development of mathematical software for support the process of managing the data schema in relational DBMS in terms of processing of parallel queries stream that compete for data in the hierarchy of the DBMS core memory. The necessity of the formation of a parametric model of queries competitive access. Briefly discusses methods of machine learning, allowing to solve the problem of regression recovery. The use of the random forest method as the most universal method of approximation of arbitrary functions is substantiated. A method of forming a parametric model of competitive access based on the random forest method, as well as an approach with the ensemble of sets of decision trees, which allows to provide the required generalizing ability and stability of the model to partial features and diversity of all types of queries received at the input of the DBMS. The stages of the developed algorithms are presented: ranking query parameters by total execution time and automatic data distribution, allowing you to go from approximating the target system with linear-continuous functions to a set of logical data schema objects, ordered by their effect on time, total query execution time, reducing multi-criteria optimization task to a task optimization by one criterion.
Full Text
About the authors
Dmitry Dmitrievich Gromey
Federal State Government Educational Institution of Higher Education "The Academy of Federal Security Guard Service of the Russian Federation"
Email: gromeydd@outlook.com
employee
References
- Лебеденко Е.В., Громей Д.Д. К вопросу управления схемой реляционной базы данных в задачах горизонтального масштабирования автономных СУБД // Cб. докладов 24-й междунар. открытой науч. конф. «Современные проблемы информатизации». Воронеж: ВГТУ, 2019.
- Вапник В.Н., Червоненкис А.Я. Теория распознавания образов. М.: Наука, 1974. 416 с.
- Загоруйко Н.Г. Прикладные методы анализа данных и знаний. Новосибирск: ИМ СО РАН, 1999. 270 с.
- Воронцов К.В. Обзор современных исследований по проблеме качества обучения алгоритмов // Таврический вестник информатики и математики. 2004. № 1. С. 5-24.
- Jain A.K., Duin R.P.W., Mao J. Statistical pattern recognition: A review // IEEE Transactions on Pattern Analysis and Machine Intelligence. 2000. Vol. 22. № 1. S. 4-37.
- Kanevskiy D.Y., Vorontsov K.V. Cooperati e coevoluti y ensemble learning // Multi Classifi Systems: 7th Internati Workshop, Prague, Czech Republic, May 23-25, 2007. Lecture Notes in Computer Science. Springer-Verlag, 2007. S. 469-478.
- Tresp V. Committee machines // Handbook for Neural Network Signal Processing / Ed. by Y.H. Hu, J.-N. Hwang. CRC Press, 2001.
- Breiman L. Random Forests // Machine Learning. 2001. № 45 (1). S. 5-32.
- Tin Kam Ho, Hill M. The Random Subspace Method for Constructing Decision Forests // IEEE Transactions on Pattern Analysis and Machine Intelligence. 1998. Vol. 20. Issue 8. S. 832-844.
- Elisseeff A. Stability of randomized learning algorithms / A. Elisseeff, Th. Evgeniou, M. Pontil // Journal of Machine Learning Research. 2005. № 6. S. 55-79.
- Breiman L., Friedman J., Stone C.J., Olshen R.A. Classification and Regression Trees // Belmont, California, U.S.A.: Wadsworth Publishing Company, 1984.
- Mazurov V., Khachai M., Rybin A. Committee constructions for solving problems of selection, diagnostics and prediction // Proceedings of the Steklov Institute of mathematics. 2002. Vol. 1. P. 67-101.
- Вапник В.Н., Червоненкис А.Я. О равномерной сходимости частот появления событий к их вероятностям // ДАН СССР. 1968. Т. 181. № 4. С. 781-784.
- Кочедыков Д.А. Структуры сходства в семействах алгоритмов классификации и оценки обобщающей способности // Всерос. конф. Математические методы распознавания образов. № 14. М.: МАКС Пресс, 2009. С. 45-48.
- Ботов П.В. Точные оценки вероятности переобучения для монотонных и унимодальных семейств алгоритмов / П.В. Ботов // Всерос. конф. Математические методы распознавания образов. № 14. М.: МАКС Пресс, 2009. С. 7-10.
Supplementary files
