Quantitative Redundancy in Partial Implications

DOI10.1007/978-3-319-19545-2_1MaRDI QIDQ5255640zbMATH OpenOpenAlexFDO

Authors José L. Balcázar

Publication date 16 June 2015

Published in Formal Concept Analysis (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1504.03620

zbMATH Keywords

association rulespartial implicationsrule mining

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Abstract: We survey the different properties of an intuitive notion of redundancy, as a function of the precise semantics given to the notion of partial implication. The final version of this survey will appear in the Proceedings of the Int. Conf. Formal Concept Analysis, 2015.

Cites work

• Discovering significant patterns
• Entailment among probabilistic implications
• Frequent Pattern Mining
• scientific article; zbMATH DE number 61569 (Why is no real title available?)
• scientific article; zbMATH DE number 1249514 (Why is no real title available?)
• scientific article; zbMATH DE number 2033349 (Why is no real title available?)
• scientific article; zbMATH DE number 7635224 (Why is no real title available?)
• scientific article; zbMATH DE number 6403512 (Why is no real title available?)
• Krimp: mining itemsets that compress
• On selecting interestingness measures for association rules: user oriented description and multiple criteria decision aid
• Redundancy, deduction schemes, and minimum-size bases for association rules
• The GUHA method and its meaning for data mining

Cited in

(1)

• On the reducibility of hypotheses and consequences

This page was built for publication: Quantitative Redundancy in Partial Implications

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