Comparison of Performances of Galois Subhierarchy-building Algorithms

Abstract : The Galois Sub-hierarchy (GSH) is a polynomial-size repre- sentation of a concept lattice which has been applied to several fields, such as software engineering and linguistics. In this paper, we analyze the performances, in terms of computation time, of three GSH-building algorithms with very different algorithmic strategies: Ares, Ceres and Pluton. We use Java and C++ as imple- mentation languages and Galicia as our development platform. Our results show that implementations in C++ are significantly faster, and that in most cases Pluton is the best algorithm.
Type de document :
Communication dans un congrès
Kuznetsov, Sergei O.; Schmidt, Stefan. ICFCA'07: 5th International Conference Formal Concept Analysis, Feb 2007, Clermont-Ferrand, France, France. SPRINGER, 4390, pp.166-180, 2007, LNCS/LNAI (Lecture Notes in Artificial Intelligence). 〈http://www.isima.fr/icfca07/〉
Liste complète des métadonnées

Littérature citée [9 références]  Voir  Masquer  Télécharger

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00163381
Contributeur : Marianne Huchard <>
Soumis le : mardi 17 juillet 2007 - 13:53:52
Dernière modification le : jeudi 24 mai 2018 - 15:59:22
Document(s) archivé(s) le : jeudi 8 avril 2010 - 23:27:13

Identifiants

  • HAL Id : lirmm-00163381, version 1

Citation

Gabriela Arévalo, Anne Berry, Marianne Huchard, Guillaume Perrot, Alain Sigayret. Comparison of Performances of Galois Subhierarchy-building Algorithms. Kuznetsov, Sergei O.; Schmidt, Stefan. ICFCA'07: 5th International Conference Formal Concept Analysis, Feb 2007, Clermont-Ferrand, France, France. SPRINGER, 4390, pp.166-180, 2007, LNCS/LNAI (Lecture Notes in Artificial Intelligence). 〈http://www.isima.fr/icfca07/〉. 〈lirmm-00163381〉

Partager

Métriques

Consultations de la notice

267

Téléchargements de fichiers

320