Generalized disjunction-free representation of frequent patterns with negation

DOI10.1080/09528130512331315882zbMath1102.68116OpenAlexW2093428478MaRDI QIDQ5696522

Marzena Krsyszkiewicz

Publication date: 18 October 2005

Published in: Journal of Experimental & Theoretical Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09528130512331315882

zbMATH Keywords

data miningknowledge discoveryconsise representations

Mathematics Subject Classification ID

Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05) Knowledge representation (68T30)

Related Items (3)

Sampling frequent and minimal Boolean patterns: theory and application in classification ⋮ Meta itemset: a new concise representation of frequent itemset ⋮ Exact and Approximate Minimal Pattern Mining

Cites Work

• CLOSED SET BASED DISCOVERY OF MAXIMAL COVERING RULES
• Unnamed Item

This page was built for publication: Generalized disjunction-free representation of frequent patterns with negation