Training for Extremum Determination of Function of Variables Measured in Names Scale
Abstract
In this paper an algorithm is given for extremum search of an unknown function F(x) when the space of variables taking discrete values is not a metric one. Function values are obtained experimentally. The given algorithm is based on the idea of adaptive random search. This algorithm has been used for the solution of a number of practical problems for choosing an effective subsystem of dependent features in pattern recognition. It is intended for solving problems which do not correspond to know problems of discrete programming.
Cite
Text
Lbov. "Training for Extremum Determination of Function of Variables Measured in Names Scale." International Joint Conference on Artificial Intelligence, 1971.Markdown
[Lbov. "Training for Extremum Determination of Function of Variables Measured in Names Scale." International Joint Conference on Artificial Intelligence, 1971.](https://mlanthology.org/ijcai/1971/lbov1971ijcai-training/)BibTeX
@inproceedings{lbov1971ijcai-training,
title = {{Training for Extremum Determination of Function of Variables Measured in Names Scale}},
author = {Lbov, G. S.},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1971},
pages = {418-423},
url = {https://mlanthology.org/ijcai/1971/lbov1971ijcai-training/}
}