• Aucun résultat trouvé

Random Concept Lattices

N/A
N/A
Info
Télécharger
Protected

Academic year: 2022

Partager "Random Concept Lattices"

Copied!
1
0
0

Chargement.... (Voir le texte intégral maintenant)

Texte intégral

(1)

Random concept lattices

Richard Emilion

MAPMO, University of Orl´eans, France

Abstract. After presenting an algorithm providing concepts and frequent concepts, we will study the random size of concept lattices in the case of a Bernoulli(p) context.

Next, for random lines which are independent and identically distributed or more generally outcomes of a Markov chain, we will show the almost everywhere convergence of the random closed intents towards deterministic intents. Finally we will consider the problem of predicting the number of concepts before choosing any algorithm.

Références

Télécharger maintenant ( PDF - 1 Page - 124.88 KB )

Documents relatifs

RANDOM GROUPS AND NONARCHIMEDEAN LATTICES

We also note that random groups in the density model admit an infinite quotient with property T, independently of the order, as soon as we are given a deterministic data with

A local limit theorem for random walks in random scenery and on randomly oriented lattices

Random walk in random scenery; random walk on randomly oriented lattices; local limit theorem; stable process.. This research was supported by the french ANR projects MEMEMO

Abstract Concept Lattices

This leads to define abstract modal logics and to define an extended abstract concept lattice relat- ing P(O) to a language whose elements have abstract and non abstract parts...

Size of random Galois lattices and number of frequent itemsets

Given a sample of binary random vectors with i.i.d. 1 − p), we first establish a formula for the mean of the size of the random Galois lattice built from this sample, and a more

Why Concept Lattices Are Large - Extremal Theory for the Number of Minimal Generators and Formal Concepts

We make this precise by giving an upper bound for the number of minimal generators (and thereby for the number of concepts) of contexts without contranom- inal scales larger than

Concept Lattices of RDF Graphs

Choosing any of the nodes as a distinguished variable gives rise to a pattern intent, and this way concepts can be identified with triple graph nodes.. The gray nodes

Algebraicity and the tensor product of concept lattices

In this paper we prove that the tensor product of complete lattices, as it is defined in formal context analysis, preserves algebraicity.. The proof of this fact is based on

The size of random fragmentation intervals

In section 2 we consider a random fragmentation process introduced by Krapivsky, Ben-Naim and Grosse [5] where fragmentation stops stochastically, with a probability q of