Structuring probabilistic data by Galois lattices
In this paper we address the problem of organising probabilistic data by Galois concept lattices. Two lattices are proposed, the union lattice and the intersection lattice, corresponding to two distinct semantics, by choosing accordingly the join and meet operators. A new algorithm is proposed to co...
Guardat en:
| Publicat a: | URI:https://journals.openedition.org/msh, |
|---|---|
| Autors principals: | , |
| Format: | Article ou chapitre numérique |
| Idioma: | Anglais |
| Publicat: |
Mathématiques et sciences humaines
2006
|
| Matèries: | |
| Accés en línia: | Accès Université d'Orléans et IFPM Accès Université d'Orléans et IFPM |
| Sumari: | In this paper we address the problem of organising probabilistic data by Galois concept lattices. Two lattices are proposed, the union lattice and the intersection lattice, corresponding to two distinct semantics, by choosing accordingly the join and meet operators. A new algorithm is proposed to construct the concept lattice. Two real data examples illustrate the presented approach. |
|---|