A Synthesis of Pseudo-Boolean Empirical Models by Precedential Information

DOI10.14529/MMP180208zbMATH Open1486.68148OpenAlexW2884684352WikidataQ129487366 ScholiaQ129487366MaRDI QIDQ4963243FDOQ4963243

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)

Cites Work

• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Data Mining with Decision Trees

Cited In (1)

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

   Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• 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 👍 👎

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)