Generalized disjunction-free representation of frequent patterns with negation

DOI10.1080/09528130512331315882MaRDI QIDQ5696522zbMATH OpenOpenAlexFDO

Authors Marzena Krsyszkiewicz

Publication date 18 October 2005

Published in Journal of Experimental & Theoretical Artificial Intelligence (Search for Journal in Brave)

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

zbMATH Keywords

consise representationsdata miningknowledge discovery

Mathematics Subject Classification ID

Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05) Knowledge representation (68T30)

Recommendations

• On concise representations of frequent patterns admitting negation
• scientific article; zbMATH DE number 2088085
• scientific article; zbMATH DE number 2089463
• Mining concise representations of frequent multidimensional patterns
• scientific article; zbMATH DE number 2033349

Cites work

• CLOSED SET BASED DISCOVERY OF MAXIMAL COVERING RULES
• scientific article; zbMATH DE number 1943768 (Why is no real title available?)

Cited in

(10)

• Sampling frequent and minimal Boolean patterns: theory and application in classification
• Generalization of association rules through disjunction
• scientific article; zbMATH DE number 2089463 (Why is no real title available?)
• Meta itemset: a new concise representation of frequent itemset
• scientific article; zbMATH DE number 2084826 (Why is no real title available?)
• scientific article; zbMATH DE number 2086479 (Why is no real title available?)
• scientific article; zbMATH DE number 2088085 (Why is no real title available?)
• Exact and approximate minimal pattern mining
• On concise representations of frequent patterns admitting negation
• Mining concise representations of frequent multidimensional patterns

This page was built for publication: Generalized disjunction-free representation of frequent patterns with negation

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