Computing formal concepts by attribute sorting

MaRDI QIDQ2893337zbMATH OpenFDO

Authors Petr Krajca, Jan Outrata, Vilem Vychodil

Publication date 20 June 2012

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL http://iospress.metapress.com/content/v3w622406w07k246/fulltext.html

Mathematics Subject Classification ID

Knowledge representation (68T30)

Recommendations

• Decompositional approach to research of formal contexts
• An Algorithm to Find Frequent Concepts of a Formal Context with Taxonomy
• Efficient approximation for counting of formal concepts generated from formal context
• A Boolean computation approach of formal concepts
• Formal Concept Analysis

Cited in

(10)

• Making use of empty intersections to improve the performance of CbO-type algorithms
• scientific article; zbMATH DE number 3888944 (Why is no real title available?)
• A comprehensive survey on formal concept analysis, its research trends and applications
• Formal concept analysis with hierarchically ordered attributes
• Discovery of the D-basis in binary tables based on hypergraph dualization
• Decompositional approach to research of formal contexts
• scientific article; zbMATH DE number 975695 (Why is no real title available?)
• Efficient approximation for counting of formal concepts generated from formal context
• An Algorithm to Find Frequent Concepts of a Formal Context with Taxonomy
• On Decomposition of a Binary Context Without Losing Formal Concepts

This page was built for publication: Computing formal concepts by attribute sorting

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