Maximal and Stochastic Galois Lattices

We present a general formula for the intent-extent mappings of a Galois lattice generated by individual descriptions which lie in any arbitrary lattice.The formulation is unique if a natural maximality condition is required. This formulation yields, as particular cases, formal concept binary Galois lattices of Wille, those defined by Brito or Blyth-Janowitz, as well as fuzzy or stochastic Galois lattices.For the case of random descriptors we show that the nodes of Galois lattices defined by distributions are limit of empirical Galois lattices nodes. Choquet capacities, t-norms and t-conorms appear as natural valuations of these lattices.

[1]  Rokia Missaoui,et al.  Learning algorithms using a Galois lattice structure , 1991, [Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91.

[2]  G. Grisetti,et al.  Further Reading , 1984, IEEE Spectrum.

[3]  Horst Herrlich,et al.  Galois Connections , 1985, Mathematical Foundations of Programming Semantics.

[4]  Bernhard Ganter,et al.  Formal Concept Analysis: Mathematical Foundations , 1998 .

[5]  Richard Emilion Différentiation des capacités et des intégrales de Choquet , 1997 .

[6]  Czeslaw Bylinski,et al.  Galois Connections , 1985, Mathematical Foundations of Programming Semantics.

[7]  A. Guénoche Construction du treillis de Galois d'une relation binaire , 1990 .

[8]  Glenn Shafer,et al.  A Mathematical Theory of Evidence , 2020, A Mathematical Theory of Evidence.

[9]  G. Choquet Theory of capacities , 1954 .

[10]  Peter L. Hammer,et al.  Discrete Applied Mathematics , 1993 .

[11]  L. Beran,et al.  [Formal concept analysis]. , 1996, Casopis lekaru ceskych.