On formal concepts of random formal contexts

01/26/2021
by   Taro Sakurai, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/15/2020

Monoidal Categories for Formal Concept Analysis

We investigate monoidal categories of formal contexts, in which states c...
research
02/12/2018

Average Size of Implicational Bases

Implicational bases are objects of interest in formal concept analysis a...
research
10/14/2018

Conceptual Collectives

The notions of formal contexts and concept lattices, although introduced...
research
09/28/2018

Formal Context Generation using Dirichlet Distributions

We suggest an improved way to randomly generate formal contexts based on...
research
10/14/2020

LCM is well implemented CbO: study of LCM from FCA point of view

LCM is an algorithm for enumeration of frequent closed itemsets in trans...
research
10/29/2021

A New Algorithm based on Extent Bit-array for Computing Formal Concepts

The emergence of Formal Concept Analysis (FCA) as a data analysis techni...
research
02/27/2017

Multimodal Clustering for Community Detection

Multimodal clustering is an unsupervised technique for mining interestin...

Please sign up or login with your details

Forgot password? Click here to reset