On formal concepts of random formal contexts
Artificial Intelligence
2021-08-02 v1 Data Structures and Algorithms
Combinatorics
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.
Keywords
Cite
@article{arxiv.2101.11023,
title = {On formal concepts of random formal contexts},
author = {Taro Sakurai},
journal= {arXiv preprint arXiv:2101.11023},
year = {2021}
}
Comments
7 pages, 2 figures, 1 table