Доступ предоставлен для: Guest
Journal of Automation and Information Sciences

Выходит 12 номеров в год

ISSN Печать: 1064-2315

ISSN Онлайн: 2163-9337

SJR: 0.173 SNIP: 0.588 CiteScore™:: 2

Indexed in

Complexity of Bayesian Procedure of Inductive Inference. Discrete Case

Том 38, Выпуск 11, 2006, pp. 56-73
DOI: 10.1615/J Automat Inf Scien.v38.i11.60
Get accessGet access

Краткое описание

Behavior of inductive procedures depending on content of learning sampling is studied. We demonstrate, that if the learning sampling contains no information about some class of objects or statistical information about a priori probabilities of classes, then any procedure works badly and its error is strictly positive. An estimate of error of Bayesian recognition procedure depending on size of learning sampling and other parameters is derived. Suboptimality of Bayesian approach is proved, complexity of class of problems is assessed.

ЦИТИРОВАНО В
  1. Sergienko I. V., Gupal A. M., Vagis A. A., Bayesian approach, theory of empirical risk minimization. Comparative analysis, Cybernetics and Systems Analysis, 44, 6, 2008. Crossref

  2. Sergienko I. V., Gupal A. M., Optimal pattern recognition procedures and their application, Cybernetics and Systems Analysis, 43, 6, 2007. Crossref

  3. Biletskyy B., Distributed Bayesian Machine Learning Procedures, Cybernetics and Systems Analysis, 55, 3, 2019. Crossref

Портал Begell Электронная Бибилиотека e-Книги Журналы Справочники и Сборники статей Коллекции Цены и условия подписки Begell House Контакты Language English 中文 Русский Português German French Spain