Performances of galois sub-hierarchy-building algorithms

Authors:
Gabriela Arévalo;Anne Berry;Marianne Huchard;Guillaume Perrot;Alain Sigayret
Affiliations:
LIRMM, CNRS UMR, Université de Montpellier II, Montpellier, France and LIFIA, Facultad de Informática, UNLP, La Plata, Argentina;LIMOS, CNRS UMR, Univ. Blaise Pascal, Clermont-Ferrand II, France;LIRMM, CNRS UMR, Université de Montpellier II, Montpellier, France;LIRMM, CNRS UMR, Université de Montpellier II, Montpellier, France;LIMOS, CNRS UMR, Univ. Blaise Pascal, Clermont-Ferrand II, France
Venue:
ICFCA'07 Proceedings of the 5th international conference on Formal concept analysis
Year:
2007

Citing 7
Cited 4

Building and maintaining analysis-level class hierarchies using Galois Lattices

OOPSLA '93 Proceedings of the eighth annual conference on Object-oriented programming systems, languages, and applications
Design of class hierarchies based on concept (Galois) lattices

Theory and Practice of Object Systems - Special issue high availability in CORBA
Formal Concept Analysis: Mathematical Foundations

Formal Concept Analysis: Mathematical Foundations
Automatic Structuring of Knowledge Bases by Conceptual Clustering

IEEE Transactions on Knowledge and Data Engineering
iO2 - An Algorithmic Method for Building Inheritance Graphs in Object Database Design

ER '96 Proceedings of the 15th International Conference on Conceptual Modeling
A New Approach to Factorization - Introducing Metrics

METRICS '02 Proceedings of the 8th International Symposium on Software Metrics
Efficiently computing a linear extension of the sub-hierarchy of a concept lattice

ICFCA'05 Proceedings of the Third international conference on Formal Concept Analysis

Hierarchical Organization of Agents Based on Galois Sub-Hierarchy for Complex Tasks Allocation in Massive MAS

KES-AMSTA '09 Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications
Concept lattice-based mutation control for reactive motifs discovery

PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
Recommendation of environmental and industrial services

MACMESE'10 Proceedings of the 12th WSEAS international conference on Mathematical and computational methods in science and engineering
Cooperative agents-based decentralised and scalable approach for complex task allocation pro massive multi-agent system

International Journal of Intelligent Information and Database Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.