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

DOI10.17223/20710410/36/9MaRDI QIDQ5151065zbMATH OpenOpenAlexFDO

Authors 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, http://elib.sfu-kras.ru/handle/2311/69877

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

• scientific article; zbMATH DE number 3823168 (Why is no real title available?)
• scientific article; zbMATH DE number 877297 (Why is no real title available?)
• scientific article; zbMATH DE number 3341950 (Why is no real title available?)
• Association rule mining. Models and algorithms
• Attribute-incremental construction of the canonical implication basis
• Discovery Science
• Generating a condensed representation for association rules
• Machine learning on the basis of formal concept analysis
• Probabilistic generalization of formal concepts
• Some Notes on Pseudo-closed Sets

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

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