Reducing rule covers with deterministic error bounds

DOI10.1007/3-540-36175-8_31MaRDI QIDQ4424020zbMATH OpenFDO

Authors Vikram Pudi, Jayant R. Haritsa

Publication date 9 September 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2637/26370313.htm

Mathematics Subject Classification ID

Database theory (68P15) Information storage and retrieval of data (68P20) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Closed-Set-Based Discovery of Representative Association Rules
• Mining minimal non-redundant association rules using frequent closed itemsets
• Closed set based discovery of representative association rules
• Generating a condensed representation for association rules
• Evaluation and optimization of frequent, closed and maximal association rule based classification

Cited in

(4)

• On Partial Covers, Reducts and Decision Rules with Weights
• On Partial Covers, Reducts and Decision Rules
• Finding robust itemsets under subsampling
• Evaluation and optimization of frequent, closed and maximal association rule based classification

This page was built for publication: Reducing rule covers with deterministic error bounds

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