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

DOI10.1016/J.DAM.2012.03.013zbMATH Open1245.68072OpenAlexW2023406898WikidataQ113877262 ScholiaQ113877262MaRDI QIDQ444438FDOQ444438

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

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

zbMATH Keywords

systems biologyBoolean functionsdata discriminationfrequent sets

Mathematics Subject Classification ID

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

Cites Work

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

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)