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

DOI10.1016/j.dam.2012.03.013zbMath1245.68072OpenAlexW2023406898WikidataQ113877262 ScholiaQ113877262MaRDI QIDQ444438

Utz-Uwe Haus, Elke Eisenschmidt

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 functionssystems biologydata discriminationfrequent sets

Mathematics Subject Classification ID

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

Uses Software

• LCM

Cites Work

• Unnamed Item
• Decomposition of regular matroids
• On maximal frequent and minimal infrequent sets in binary matrices
• On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions
• Complexity of identification and dualization of positive Boolean functions
• On the Complexity of Dualization of Monotone Disjunctive Normal Forms
• Two-mode clustering methods: astructuredoverview
• Data Mining and Knowledge Discovery Handbook

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