Very Fast Instances for Concept Generation - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2006

Very Fast Instances for Concept Generation

Résumé

Computing the maximal bicliques of a bipartite graph is equivalent to generating the concepts of the binary relation defined by the matrix of this graph. We study this problem for special classes of input relations for which concepts can be generated much more efficiently than in the general case; in some special cases, we can even say that the number of concepts is polynomially bounded, and all concepts can be generated particularly quickly.
Fichier non déposé

Dates et versions

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

Identifiants

  • HAL Id : hal-00522391 , version 1

Citer

Anne Berry, Ross M. Mc Connell, Alain Sigayret, Jeremy P. Spinrad. Very Fast Instances for Concept Generation. Fourth International Conference on Formal Concept Analysis, Feb 2006, Dresden, Germany. pp 119-129. ⟨hal-00522391⟩
46 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More