A Fixed Point Theorem for Stronger Association Rules and Its Computational Aspects

DOI10.14232/ACTACYB.19.1.2009.10zbMATH Open1199.06013OpenAlexW197940675MaRDI QIDQ3551107

Gábor Czédli

Publication date: 8 April 2010

Published in: Acta Cybernetica (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/34750d4885a9e8026ee315234b8258c1acc3e9ad

zbMATH Keywords

latticedatabaseposetGalois connectiondata miningassociation ruleformal concept analysisfunctional dependencyconcept latticecontext

Mathematics Subject Classification ID

Database theory (68P15) Fixed-point theorems (47H10) Knowledge representation (68T30) Information storage and retrieval of data (68P20) Galois correspondences, closure operators (in relation to ordered sets) (06A15)

Related Items (1)

Computing exact permutation \(p\)-values for association rules

This page was built for publication: A Fixed Point Theorem for Stronger Association Rules and Its Computational Aspects

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