Size of random Galois lattices and number of closed frequent itemsets

DOI10.1016/j.dam.2009.02.025zbMath1187.68389OpenAlexW2152650223MaRDI QIDQ967342

Gérard Lévy, Richard Emilion

Publication date: 28 April 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2009.02.025

zbMATH Keywords

classificationdata miningassociation ruleBernoulli distributionfrequent itemsetGalois latticewinning coalition

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Galois correspondences, closure operators (in relation to ordered sets) (06A15)

Related Items (3)

On formal concepts of random formal contexts ⋮ On stability of fuzzy formal concepts over randomized one-sided formal context ⋮ Randomized Fuzzy Formal Contexts and Relevance of One-Sided Concepts

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
• Maximal and stochastic Galois lattices
• Two Basic Algorithms in Concept Analysis
• Comparing performance of algorithms for generating concept lattices

This page was built for publication: Size of random Galois lattices and number of closed frequent itemsets