Discovering all associations in discrete data using frequent minimally infrequent attribute sets

DOI10.1016/J.DAM.2012.03.013MaRDI QIDQ444438zbMATH OpenOpenAlexWikidataFDO

Authors Elke Eisenschmidt, Utz-Uwe Haus

Publication date 14 August 2012

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2012.03.013

zbMATH Keywords

Boolean functionsdata discriminationfrequent setssystems biology

Mathematics Subject Classification ID

Data structures (68P05) Systems biology, networks (92C42)

Recommendations

• Computing minimal sets of descriptive conditions for binary data
• On maximal frequent and minimal infrequent sets in binary matrices
• scientific article; zbMATH DE number 1934547
• Association Rules for Categorical and Tree Data
• scientific article; zbMATH DE number 2086380

Cites work

• Complexity of identification and dualization of positive Boolean functions
• Data Mining and Knowledge Discovery Handbook
• Decomposition of regular matroids
• scientific article; zbMATH DE number 53949 (Why is no real title available?)
• On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions
• On maximal frequent and minimal infrequent sets in binary matrices
• On the Complexity of Dualization of Monotone Disjunctive Normal Forms
• Two-mode clustering methods: astructuredoverview

Describes a project that uses

Uses Software

• LCM

This page was built for publication: Discovering all associations in discrete data using frequent minimally infrequent attribute sets

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