Arévalo, Gabriela; Berry, Anne; Huchard, Marianne; Perrot, Guillaume; Sigayret, Alain Performances of Galois sub-hierarchy-building algorithms. (English) Zbl 1187.68576 Kuznetsov, Sergei O. (ed.) et al., Formal concept analysis. 5th international conference, ICFCA 2007, Clermont-Ferrand, France, February 12–16, 2007. Proceedings. (ISBN 978-3-540-70828-5/pbk). Lecture Notes in Computer Science 4390. Lecture Notes in Artificial Intelligence, 166-180 (2007). Summary: The Galois Sub-Hierarchy (GSH) is a polynomial-size representation 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 implementation 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.For the entire collection see [Zbl 1115.68004]. Cited in 2 Documents MSC: 68T30 Knowledge representation 68Q25 Analysis of algorithms and problem complexity Keywords:Galois sub-hierarchy; AOC-poset; performance analysis PDFBibTeX XMLCite \textit{G. Arévalo} et al., Lect. Notes Comput. Sci. 4390, 166--180 (2007; Zbl 1187.68576) Full Text: DOI Link