Dualization, decision lists and identification of monotone discrete functions

DOI10.1023/A:1018993014297MaRDI QIDQ1286397zbMATH OpenOpenAlexFDO

Authors Jan C. Bioch

Publication date 3 May 1999

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1018993014297

zbMATH Keywords

machine learningdata-analysis algorithms

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Complexity of identification and dualization of positive Boolean functions
• Decision lists and related Boolean functions
• Dualization in lattices given by ordered sets of irreducibles
• Computational aspects of monotone dualization: a brief survey
• Dualization of regular Boolean functions

Cited in

(9)

• Counting and enumerating aggregate classifiers
• Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis
• Organization of enumerative search in discrete problems with monotone functionals for empirical data analysis
• On data classification by iterative linear partitioning
• Learning determining sets of finite partially defined functions
• Monotone term decision lists
• Computational aspects of monotone dualization: a brief survey
• Disjunctive and conjunctive normal forms of pseudo-Boolean functions
• Special issue: Boolean functions and related problems

This page was built for publication: Dualization, decision lists and identification of monotone discrete functions

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