On formal concepts of random formal contexts

DOI10.1016/J.INS.2021.07.065arXiv2101.11023MaRDI QIDQ6089963FDOQ6089963

Authors: Taro Sakurai 

Publication date: 15 December 2023

Published in: Information Sciences (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/2101.11023

Recommendations

• Probabilistic concepts in formal contexts
• Probabilistic generalization of formal concepts
• Formal context generation using Dirichlet distributions
• Concepts of a Discrete Random Variable
• Probabilistic formal concepts with negation

zbMATH Keywords

formal concept analysisaverage-case analysisasymptotic lower boundformal conceptsrandom formal contexts

Mathematics Subject Classification ID

Knowledge representation (68T30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Probability theory. Translated from the German by Robert B. Burckel
• On computing the size of a lattice and related decision problems
• Size of random Galois lattices and number of closed frequent itemsets
• Approaches to the selection of relevant concepts in the case of noisy data
• Efficient approximation for counting of formal concepts generated from formal context

Cited In (3)

• Title not available (Why is that?)
• On stability of fuzzy formal concepts over randomized one-sided formal context
• Formal context generation using Dirichlet distributions

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)