On formal concepts of random formal contexts
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.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
A Modal Logic for Possibilistic Reasoning with Fuzzy Formal Contexts
We introduce a two-sort weighted modal logic for possibilistic reasoning with fuzzy formal contexts. The syntax of the logic includes two types of weighted modal operators corresponding to classical necessity ($\Box$) an…
Concept and Attribute Reduction Based on Rectangle Theory of Formal Concept
Based on rectangle theory of formal concept and set covering theory, the concept reduction preserving binary relations is investigated in this paper. It is known that there are three types of formal concepts: core concep…
AttributeToward a Formal Model of the Shifting Relationship between Concepts and Contexts during Associative Thought
The quantum inspired State Context Property (SCOP) theory of concepts is unique amongst theories of concepts in offering a means of incorporating that for each concept in each different context there are an unlimited num…
Conceptual Collectives
The notions of formal contexts and concept lattices, although introduced by Wille only ten years ago, already have proven to be of great utility in various applications such as data analysis and knowledge representation.…
Scalable Formal Concept Analysis algorithm for large datasets using Spark
In the process of knowledge discovery and representation in large datasets using formal concept analysis, complexity plays a major role in identifying all the formal concepts and constructing the concept lattice(digraph …
graph construction