Performances of Galois Sub-hierarchy-building Algorithms

DOI10.1007/978-3-540-70901-5_11MaRDI QIDQ3590977zbMATH OpenOpenAlexFDO

Authors Gabriela Arévalo, Anne Berry, Marianne Huchard, Guillaume Perrot, Alain Sigayret

Publication date 3 September 2007

Published in Formal Concept Analysis (Search for Journal in Brave)

Full work available at URL https://hal-lirmm.ccsd.cnrs.fr/lirmm-00163381/file/Arevalo-icfca-2007.pdf

zbMATH Keywords

performance analysisAOC-posetGalois sub-hierarchy

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Knowledge representation (68T30)

Recommendations

• Formal Concept Analysis
• Galois lattice as a framework to specify building class hierarchies algorithms
• scientific article; zbMATH DE number 4016967
• scientific article; zbMATH DE number 4160798
• Comparing performance of algorithms for generating concept lattices

Cited in

(4)

• Hermes: a simple and efficient algorithm for building the AOC-poset of a binary relation
• Galois lattice as a framework to specify building class hierarchies algorithms
• On interestingness measures of formal concepts
• Formal Concept Analysis

This page was built for publication: Performances of Galois Sub-hierarchy-building Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3590977)