A Synthesis of Pseudo-Boolean Empirical Models by Precedential Information

DOI10.14529/mmp180208zbMath1486.68148OpenAlexW2884684352WikidataQ129487366 ScholiaQ129487366MaRDI QIDQ4963243

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

decision treesmachine learningpseudo-Boolean optimizationdisjunctive constraint

Mathematics Subject Classification ID

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

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Dar's conjecture and the log-Brunn-Minkowski inequality
• Complexity of families of learning algorithms and estimation of the nonrandomness of extraction of empirical regularities
• Data Mining with Decision Trees

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