Pruning redundant association rules using maximum entropy principle

DOI10.1007/3-540-47887-6_13MaRDI QIDQ4739183zbMATH OpenFDO

Authors Szymon Jaroszewicz, Dan A. Simovici

Publication date 12 August 2004

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/2336/23360135.htm

Mathematics Subject Classification ID

Database theory (68P15) Information storage and retrieval of data (68P20) Computing methodologies and applications (68U99)

Recommendations

• AI 2005: Advances in Artificial Intelligence
• Minimum-redundant and lossless association rule-set representation
• scientific article; zbMATH DE number 2219694
• Reduction of Redundant Rules in Statistical Implicative Analysis
• scientific article; zbMATH DE number 2148116

Cited in

(6)

• Itemset frequency satisfiability: complexity and axiomatization
• scientific article; zbMATH DE number 2101256 (Why is no real title available?)
• Association Rules Network: Definition and Applications
• Reduction of Redundant Rules in Statistical Implicative Analysis
• AI 2005: Advances in Artificial Intelligence
• What to expect from a set of itemsets?

This page was built for publication: Pruning redundant association rules using maximum entropy principle

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