Vestnik Yuzhno-Ural'skogo Universiteta. Seriya Matematicheskoe Modelirovanie i Programmirovanie
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Vestnik YuUrGU. Ser. Mat. Model. Progr.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Vestnik Yuzhno-Ural'skogo Universiteta. Seriya Matematicheskoe Modelirovanie i Programmirovanie, 2018, Volume 11, Issue 2, Pages 96–107
DOI: https://doi.org/10.14529/mmp180208
(Mi vyuru434)
 

This article is cited in 1 scientific paper (total in 1 paper)

Programming & Computer Software

A synthesis of pseudo-Boolean empirical models by precedential information

V. I. Donskoy

Crimean Federal University, Simferopol, Russian Federation
Full-text PDF (613 kB) Citations (1)
References:
Abstract: The problem of decision-making based on partial, precedential information is the most important when the creation of artificial intelligence systems. According to the results of observations over the behaviour of external objects or systems it is necessary to synthesize or, more precisely, extract from the data a mathematical model of optimization of the object on the basis of accumulated empirical information in the form of a finite set of triples: "a state vector, the value of the quality of functioning of the object, a binary indicator of the admissibility of this state". The aim of the work is to create and substantiate mathematical methods and algorithms that allow to synthesize models of scalar pseudo-Boolean optimization with a constraint in the form of disjunctive normal form (DNF) using this precedential information. The peculiarity of pseudo-Boolean optimization models with separable objective functions and DNF constraint, which has a bounded constant length, is their polynomial solvability. However, the complexity of bringing the problem to the form with a DNF constraint in general case is exponential. When extracting the model from the data the DNF constraint is synthesized approximately but with polynomial complexity and the number of conjunctions in the extracted DNF does not exceed the number of examples in the initial precedential information. In the paper is shown how to use binary decision trees to construct a disjunctive constraint, proposed the methods to identify the properties of monotonicity and linearity of the partially defined objective functions, and developed algorithms for solving problems pseudo-Boolean scalar optimization in the presence of incomplete, precedential initial information. The scope of application of the obtained results includes intelligent control systems, intelligent agents. Although the control models derived from the data are approximate, their application can be more successful than the use of less realistic, inconsistent with the objects models which are chosen on the base of subjective considerations.
Keywords: pseudo-Boolean optimization; disjunctive constraint; machine learning; decision trees.
Received: 25.02.2018
Bibliographic databases:
Document Type: Article
UDC: 519.854
MSC: 68R99
Language: English
Citation: V. I. Donskoy, “A synthesis of pseudo-Boolean empirical models by precedential information”, Vestnik YuUrGU. Ser. Mat. Model. Progr., 11:2 (2018), 96–107
Citation in format AMSBIB
\Bibitem{Don18}
\by V.~I.~Donskoy
\paper A synthesis of pseudo-Boolean empirical models by precedential information
\jour Vestnik YuUrGU. Ser. Mat. Model. Progr.
\yr 2018
\vol 11
\issue 2
\pages 96--107
\mathnet{http://mi.mathnet.ru/vyuru434}
\crossref{https://doi.org/10.14529/mmp180208}
\elib{https://elibrary.ru/item.asp?id=35250093}
Linking options:
  • https://www.mathnet.ru/eng/vyuru434
  • https://www.mathnet.ru/eng/vyuru/v11/i2/p96
  • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:183
    Full-text PDF :41
    References:18
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024