RUS  ENG
Full version
JOURNALS // Sibirskii Zhurnal Industrial'noi Matematiki // Archive

Sib. Zh. Ind. Mat., 2009 Volume 12, Number 3, Pages 66–74 (Mi sjim568)

This article is cited in 2 papers

An Adaptive Search Method for a Logical Solving Function

G. S. Lbova, V. M. Nedel'koa, S. V. Nedel'kob

a Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk
b Novosibirsk State Technical University, Novosibirsk

Abstract: A method is proposed for seeking the optimal logical solving function in the problems of data analysis, which is a modification of adaptive random search. The method uses a metric in the space of logical solving functions and seeks solutions in accordance with an adaptable probability measure.

Keywords: pattern recognition, machine learning, solution trees, global extremum search, optimization, adaptive random search, genetic algorithms.

UDC: 519.9

Received: 18.11.2008
Revised: 10.03.2009



© Steklov Math. Inst. of RAS, 2024