Discovering all associations in discrete data using frequent minimally infrequent attribute sets
type: Item
instance of: scholarly article
title: Discovering all associations in discrete data using frequent minimally infrequent attribute sets
zbMATH Open document ID: 1245.68072
author: Elke Eisenschmidt
author: Utz-Uwe Haus
published in: Discrete Applied Mathematics
publication date: 2012-08-14T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 92C42
zbMATH DE Number: 6065735
zbMATH Keywords: data discrimination
zbMATH Keywords: frequent sets
zbMATH Keywords: Boolean functions
zbMATH Keywords: systems biology
describes a project that uses: LCM
MaRDI profile type: Publication
full work available at URL: j.dam.2012.03.013
OpenAlex ID: W2023406898
Wikidata QID: Q113877262
cites work: Complexity of identification and dualization of positive Boolean functions
cites work: On maximal frequent and minimal infrequent sets in binary matrices
cites work: On the Complexity of Dualization of Monotone Disjunctive Normal Forms
cites work: Data Mining and Knowledge Discovery Handbook
cites work: On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions
cites work: Decomposition of regular matroids
cites work: Q4004142
cites work: Two-mode clustering methods: astructuredoverview
DOI: 10.1016/J.DAM.2012.03.013
description: scientific article; zbMATH DE number 6065735