On formal concepts of random formal contexts
From MaRDI portal
Publication:6089963
Abstract: In formal concept analysis, it is well-known that the number of formal concepts can be exponential in the worst case. To analyze the average case, we introduce a probabilistic model for random formal contexts and prove that the average number of formal concepts has a superpolynomial asymptotic lower bound.
Recommendations
Cites work
- scientific article; zbMATH DE number 989379 (Why is no real title available?)
- scientific article; zbMATH DE number 1249514 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- Approaches to the selection of relevant concepts in the case of noisy data
- Efficient approximation for counting of formal concepts generated from formal context
- On computing the size of a lattice and related decision problems
- Probability theory. Translated from the German by Robert B. Burckel
- Size of random Galois lattices and number of closed frequent itemsets
Cited in
(3)
This page was built for publication: On formal concepts of random formal contexts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6089963)