On concise representations of frequent patterns admitting negation

DOI10.1007/978-3-642-05179-1_13MaRDI QIDQ5305728zbMATH OpenOpenAlexFDO

Authors Marzena Kryszkiewicz, Henryk Rybiński, Katarzyna Cichoń

Publication date 23 March 2010

Published in Advances in Machine Learning II (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-05179-1_13

zbMATH Keywords

algorithmsdata mining

Mathematics Subject Classification ID

Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Recommendations

• Generalized disjunction-free representation of frequent patterns with negation
• scientific article; zbMATH DE number 2088085
• Mining concise representations of frequent multidimensional patterns
• scientific article; zbMATH DE number 2089463
• scientific article; zbMATH DE number 2084826

Cited in

(9)

• Generalization of association rules through disjunction
• scientific article; zbMATH DE number 2089463 (Why is no real title available?)
• The role of semantics in mining frequent patterns from knowledge bases in description logics with rules
• scientific article; zbMATH DE number 1934545 (Why is no real title available?)
• scientific article; zbMATH DE number 2084826 (Why is no real title available?)
• scientific article; zbMATH DE number 2088085 (Why is no real title available?)
• Generalized disjunction-free representation of frequent patterns with negation
• Constraint-Based Mining and Inductive Databases
• Mining concise representations of frequent multidimensional patterns

This page was built for publication: On concise representations of frequent patterns admitting negation

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