Skip to Main content Skip to Navigation
Conference papers

Performances of Galois Sub-hierarchy-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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [9 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00163381
Contributor : Marianne Huchard <>
Submitted on : Tuesday, July 17, 2007 - 1:53:52 PM
Last modification on : Monday, January 20, 2020 - 12:12:05 PM
Long-term archiving on: : Thursday, April 8, 2010 - 11:27:13 PM

Identifiers

Citation

Gabriela Arévalo, Anne Berry, Marianne Huchard, Guillaume Perrot, Alain Sigayret. Performances of Galois Sub-hierarchy-building Algorithms. ICFCA: International Conference Formal Concept Analysis, Feb 2007, Clermont-Ferrand, France. pp.166-180, ⟨10.1007/978-3-540-70901-5_11⟩. ⟨lirmm-00163381⟩

Share

Metrics

Record views

394

Files downloads

680