Propositional Satisfiability Algorithm to Find Minimal Reducts for Data Mining

DOI10.1080/00207160210938MaRDI QIDQ4531355zbMATH OpenOpenAlexFDO

Authors

Publication date 2002

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160210938

zbMATH Keywords

data miningpropositional satisfiability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15)

Recommendations

• MineReduce: an approach based on data mining for problem size reduction
• scientific article; zbMATH DE number 1926649
• Approximate Boolean Reasoning: Foundations and Applications in Data Mining
• A data mining formalization to improve hypergraph minimal transversal computation
• Data mining and constraint programming. Foundations of a cross-disciplinary approach
• Mining propositional simplification proofs for small validating clauses
• Toward a procedure for data mining proofs
• Minimal covering problem and redundancy reduction in databases

Cited in

(3)

• Optimization on the complementation procedure towards efficient implementation of the index generation function
• MineReduce: an approach based on data mining for problem size reduction
• Vapnik's learning theory applied to energy consumption forecasts in residential buildings

This page was built for publication: Propositional Satisfiability Algorithm to Find Minimal Reducts for Data Mining

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