|
Optimal spanning tree reconstruction in symbolic regression
R. G. Neycheva, I. A. Shibaeva, V. V. Strijovb a Moscow Institute of Physics and Technology, 9 Institutskiy Per., Dolgoprudny, Moscow Region 141700, Russian Federation
b Federal Research Center “Computer Science and Control” of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
Abstract:
The paper investigates the problem of regression model generation. A model is a superposition of primitive functions. The model structure is described by a weighted colored graph. Each graph vertex corresponds to a primitive function. An edge assigns a superposition of two functions. The weight of an edge is equal to the probability of superposition. To generate an optimal model, one has to reconstruct its structure from its graph adjacency matrix. The proposed algorithm reconstructs the minimum spanning tree from the weighted colored graph. The paper presents a novel solution based on the prize-collecting Steiner tree algorithm. This algorithm is compared with its alternatives.
Keywords:
symbolic regression, linear programming, superposition, minimum spanning tree, adjacency matrix.
Received: 23.01.2022
Citation:
R. G. Neychev, I. A. Shibaev, V. V. Strijov, “Optimal spanning tree reconstruction in symbolic regression”, Inform. Primen., 17:1 (2023), 35–42
Linking options:
https://www.mathnet.ru/eng/ia827 https://www.mathnet.ru/eng/ia/v17/i1/p35
|
Statistics & downloads: |
Abstract page: | 64 | Full-text PDF : | 36 | References: | 11 |
|