A Synthesis of Pseudo-Boolean Empirical Models by Precedential Information

DOI10.14529/MMP180208MaRDI QIDQ4963243zbMATH OpenOpenAlexWikidataFDO

Authors V. I. Donskoy

Publication date 1 November 2018

Published in Bulletin of the South Ural State University. Series "Mathematical Modelling, Programming and Computer Software" (Search for Journal in Brave)

Full work available at URL http://mathnet.ru/eng/vyuru434

zbMATH Keywords

machine learningdecision treespseudo-Boolean optimizationdisjunctive constraint

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Applications of mathematical programming (90C90)

Recommendations

• scientific article; zbMATH DE number 20667
• scientific article; zbMATH DE number 1785997
• The conditional Boolean model revisited
• Towards a Theory of Valid Inferential Models with Partial Prior Information
• Representations of mixed measures with applications to Boolean models
• The Problem of Judgment Aggregation in the Framework of Boolean-Valued Models

Cites work

• scientific article; zbMATH DE number 53549 (Why is no real title available?)
• scientific article; zbMATH DE number 3214054 (Why is no real title available?)
• Complexity of families of learning algorithms and estimation of the nonrandomness of extraction of empirical regularities
• Dar's conjecture and the log-Brunn-Minkowski inequality
• Data Mining with Decision Trees

Cited in

(1)

• Pseudo-Boolean conditional optimization models for a class of multiple traveling salesmen problems

This page was built for publication: A Synthesis of Pseudo-Boolean Empirical Models by Precedential Information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4963243)