Concise representation of frequent patterns based on generalized disjunction-free generators

DOI10.1007/3-540-47887-6_15MaRDI QIDQ4739186zbMATH OpenFDO

Authors Marzena Kryszkiewicz, Marcin Gajek

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/23360159.htm

Mathematics Subject Classification ID

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

Recommendations

• Generalized disjunction-free representation of frequent patterns with negation
• Why to apply generalized disjunction-free generators representation of frequent patterns?
• On concise representations of frequent patterns admitting negation
• Mining concise representations of frequent multidimensional patterns
• Constraint-Based Mining and Inductive Databases

Cited in

(8)

• Sampling frequent and minimal Boolean patterns: theory and application in classification
• Mining triadic association rules from ternary relations
• Why to apply generalized disjunction-free generators representation of frequent patterns?
• On concise representations of frequent patterns admitting negation
• Construction efficace du treillis des motifs fermés fréquents et extraction simultanée des bases génériques de règles
• 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: Concise representation of frequent patterns based on generalized disjunction-free generators

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