Bounding negative information in frequent sets algorithms

DOI10.1007/3-540-45650-3_8MaRDI QIDQ4736021zbMATH OpenFDO

Authors I. Fortes, José L. Balcázar, Rafael Morales-Bueno

Publication date 9 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/2226/22260050.htm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• On concise representations of frequent patterns admitting negation
• Uncovering hidden associations through negative itemsets correlations
• Generalized disjunction-free representation of frequent patterns with negation
• scientific article; zbMATH DE number 1041844

Cited in

(9)

• Jumping emerging patterns with negation in transaction databases -- classification and discovery
• Uncovering hidden associations through negative itemsets correlations
• A new algorithm based on bit-matrix for mining negative association rules
• Finding association rules with some very frequent attributes
• Axiomatization of frequent sets
• Research on algorithm for mining negative association rules based on frequent pattern tree
• Minimal frequent correlated pattern mining
• On concise representations of frequent patterns admitting negation
• Database Support for Data Mining Applications

This page was built for publication: Bounding negative information in frequent sets algorithms

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