Performances of Galois sub-hierarchy-building algorithms
| Autor Principal: | |
|---|---|
| Otros autores o Colaboradores: | , , , |
| Formato: | Capítulo de libro |
| Lengua: | inglés |
| Series: | ^p Datos electrónicos (1 archivo : 924 KB)
|
| Temas: | |
| Acceso en línea: | www.lifia.info.unlp.edu.ar/papers/2007/Arevalo2007.pdf Consultar en el Cátalogo |
| 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. |
| Notas: | Formato de archivo: PDF. -- Este documento es producción intelectual de la Facultad de Informática-UNLP (Colección BIPA / Biblioteca.) -- Disponible también en línea (Cons. 10-03-2008) |