A Parameterized Algorithm for Exploring Concept Lattices

DOI10.1007/978-3-540-70901-5_8MaRDI QIDQ3590978zbMATH OpenOpenAlexFDO

Authors Peggy Cellier, S. Ferré, Olivier Ridoux, Mireille Ducassé

Publication date 3 September 2007

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

Full work available at URL https://doi.org/10.1007/978-3-540-70901-5_8

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Knowledge representation (68T30)

Recommendations

• A PARAMETERIZED ALGORITHM TO EXPLORE FORMAL CONTEXTS WITH A TAXONOMY
• An Algorithm to Find Frequent Concepts of a Formal Context with Taxonomy
• Concept Lattices
• Machine learning on the basis of formal concept analysis
• Attribute selection using contranominal scales

Cited in

(7)

• Concept lattices as a search space for graph compression
• A PARAMETERIZED ALGORITHM TO EXPLORE FORMAL CONTEXTS WITH A TAXONOMY
• Comparing performance of algorithms for generating concept lattices
• Contingency Structures and Concept Analysis
• An Algorithm to Find Frequent Concepts of a Formal Context with Taxonomy
• Concept Lattices
• Concept Lattices

This page was built for publication: A Parameterized Algorithm for Exploring Concept Lattices

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