Efficiently Computing a Linear Extension of the Sub-hierarchy of a Concept Lattice-Reference-Cited by-同舟云学术

Efficiently Computing a Linear Extension of the Sub-hierarchy of a Concept Lattice

Published:2005 Issue: Volume: Page:208-222
ISSN:0302-9743
Container-title:Formal Concept Analysis
language:
Short-container-title:

Author:

Berry Anne,Huchard Marianne,McConnell Ross M.,Sigayret Alain,Spinrad Jeremy P.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-32262-7_14.pdf

Reference22 articles.

1. Barbut, M., Monjardet, B.: Ordre et classification. Classiques Hachette (1970)

2. Berry, A., Sigayret, A.: Representing a concept lattice by a graph. In: Proc. Discrete Maths and Data Mining Workshop, 2nd SIAM Conference on Data Mining (SDM 2002), Arlington, VA, USA (April 2002);

3. Discrete Applied Mathematics, special issue on Discrete Maths and Data Mining 144(1-2), 27???42 (2004)

4. Lecture Notes in Computer Science;A. Berry,2002

5. Berry, A., Bordat, J.-P., Sigayret, A.: Concepts can’t afford to stammer. In: INRIA Proc. International Conference Journées de l’Informatique Messine (JIM 2003), Metz (France), Submitted as ‘A local approach to concept generation’ (September 2003)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Dealing with Large Volumes of Complex Relational Data Using RCA;Complex Data Analytics with Formal Concept Analysis;2021-12-08

2. On-Demand Generation of AOC-Posets: Reducing the Complexity of Conceptual Navigation;Lecture Notes in Computer Science;2017

3. Hierarchical Organization of Agents Based on Galois Sub-Hierarchy for Complex Tasks Allocation in Massive MAS;Agent and Multi-Agent Systems: Technologies and Applications;2009

4. Performances of Galois Sub-hierarchy-building Algorithms;Formal Concept Analysis;2007