Obtaining and maintaining polynomial-sized concept lattices - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2002

Obtaining and maintaining polynomial-sized concept lattices

Résumé

We use our definition of an underlying co-bipartite graph which encodes a given binary relation to propose a new approach to defining a sub-relation or incrementally maintaining a relation which will define only a polynomial number of concepts.
Fichier non déposé

Dates et versions

hal-00522336 , version 1 (30-09-2010)

Identifiants

  • HAL Id : hal-00522336 , version 1

Citer

Anne Berry, Alain Sigayret. Obtaining and maintaining polynomial-sized concept lattices. 15th European Conference on Artificial Intelligence / Workshop FCAKDD'02 (Advances in Formal Concept Analysis for Knowledge Dicovery in Databases), Jul 2002, Lyon, France. pp 3-6. ⟨hal-00522336⟩
41 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More