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

DOI10.17223/20710410/36/9OpenAlexW2731933180MaRDI QIDQ5151065FDOQ5151065

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

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Association rule mining. Models and algorithms
• Probabilistic generalization of formal concepts
• Some Notes on Pseudo-closed Sets
• Title not available (Why is that?)
• Discovery Science
• Generating a condensed representation for association rules
• Attribute-incremental construction of the canonical implication basis
• Machine learning on the basis of formal concept analysis

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)