ON THE NON-REDUNDANT REPRESENTATION OF THE MINIMAX BASIS OF STRONG ASSOCIATIONS

DOI10.17223/20710410/36/9OpenAlexW2731933180MaRDI QIDQ5151065

Valentina Vladimirovna Bykova, A. V. Kataeva

Publication date: 16 February 2021

Published in: Prikladnaya diskretnaya matematika (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/pdm579

zbMATH Keywords

Galois connectionclosed setsminimax basisnon-redundantstrong association rules

Mathematics Subject Classification ID

Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Association rule mining. Models and algorithms
• Probabilistic generalization of formal concepts
• Generating a condensed representation for association rules
• Machine learning on the basis of formal concept analysis
• Attribute-incremental construction of the canonical implication basis
• Some Notes on Pseudo-closed Sets
• Discovery Science

This page was built for publication: ON THE NON-REDUNDANT REPRESENTATION OF THE MINIMAX BASIS OF STRONG ASSOCIATIONS