Combinatorial GMDH algorithm with successive selection of arguments. Samoilenko O.A., Stepashko V.S. IWIM, Prague, 2007.

 Article (in pdf)

Abstract. The paper considers the problem of solving tasks with large number of arguments by combinatorial GMDH algorithm. To solve this problem, successive selection of the most informative arguments is suggested. Use of this algorithm enables to essentially accelerate the retrieval for the best subset of regressors and to solve tasks with considerably larger number of regressors compared with ordinary combinatorial GMDH algorithm of exhaustive search of arguments.

Keywords. Inductive modelling, GMDH, combinatorial algorithm, argument, successive selection.

References.

1. Ivakhnenko A.G., Ivakhnenko G.A., Savchenko E.A., and Wunsch D. Problems of Further Development of GMDH Algorithms: Part 2 // Pattern Recognition and Image Analysis , Vol. 12, № 1, 2002, p.6-18.

2. Ivahnenko A.G., Ivahnenko G.A., Savchenko E.A. Conception of the successive algorithmic approaching (lowering) to the exact decision of interpolation tasks of artificial intelligence // Cybernetics and computing engineering, № 127, 2000, p.47-58. (In Russian)

3. Stepashko V.S., Koppa Y.V. The Experience of application of the ASTRID system for the design of economic processes from statistical data // Cybernetics and computing engineering. - 1998. - V.117. – p. 24-31. (In Russian)