Performances of Galois sub-hierarchy-building algorithms

Título:

Performances of Galois sub-hierarchy-building algorithms

Autor:

Arévalo, Gabriela Beatriz

Colaboradores:

; Perrot, Guillaume; Sigayret, Alain; Berry, Anne; Huchard, Marianne

Temas:

ALGORITMOSANÁLISIS DE RENDIMIENTOINGENIERÍA DE SOFTWARE

En:

Formal concepts analysis. 5th International Conference, ICFCA 2007, Clermont-Ferrand, France, February 12-16, 2007. Proceedings. Lecture Notes in Computer Science Volume 4390, p. 166-180. Springer, 2007.

Resumen:

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. Keywords: Galois Sub-hierarchy, AOC-Poset, Performance Analysis.

URL/DOI:

Medio:

Soporte electrónico

Tipo de documento:

Artículo

Idioma:

Inglés

Publicación:

, 2007

Puede solicitar más fácilmente el ejemplar con: A0035

Ver estantes