Inferring knowledge from frequent patterns

DOI10.1007/3-540-46019-5_19MaRDI QIDQ4736952zbMATH OpenFDO

Authors Marzena Kryszkiewicz

Publication date 11 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/2311/23110247.htm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• CLOSED SET BASED DISCOVERY OF MAXIMAL COVERING RULES
• scientific article; zbMATH DE number 1041844
• Why to apply generalized disjunction-free generators representation of frequent patterns?
• Generalized disjunction-free representation of frequent patterns with negation
• PATTERN EXTRACTION FROM BAG DATABASES

Cited in

(2)

• Interactive knowledge discovery from hidden data through sampling of frequent patterns
• CLOSED SET BASED DISCOVERY OF MAXIMAL COVERING RULES

This page was built for publication: Inferring knowledge from frequent patterns

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