On formal concepts of random formal contexts
Taro Sakurai (Chiba University)
TL;DR
This paper introduces a probabilistic model for random formal contexts in formal concept analysis and proves that, on average, the number of formal concepts grows superpolynomially, highlighting complexity concerns.
Contribution
It presents a new probabilistic model for analyzing the average number of formal concepts in formal contexts, revealing superpolynomial growth.
Findings
Average number of formal concepts is superpolynomial
Probabilistic model for random formal contexts
Complexity implications for formal concept analysis
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.