Why to apply generalized disjunction-free generators representation of frequent patterns?

DOI10.1007/3-540-48050-1_42MaRDI QIDQ3046881zbMATH 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/2366/23660383.htm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Concise representation of frequent patterns based on generalized disjunction-free generators
• Generalized disjunction-free representation of frequent patterns with negation
• On concise representations of frequent patterns admitting negation
• Closed set based discovery of representative association rules
• Using closed itemsets for discovering representative association rules

Cited in

(4)

• Inferring knowledge from frequent patterns
• Concise representation of frequent patterns based on generalized disjunction-free generators
• On concise representations of frequent patterns admitting negation
• Generalized disjunction-free representation of frequent patterns with negation

This page was built for publication: Why to apply generalized disjunction-free generators representation of frequent patterns?

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