Formal concept analysis. Foundations and applications.

zbMath1087.68003MaRDI QIDQ2369286

No author found.

Publication date: 9 May 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Knowledge representation (68T30)

Related Items (28)

Information efficient learning of complexly structured preferences: elicitation procedures and their application to decision making under uncertainty ⋮ Relating attribute reduction in formal, object-oriented and property-oriented concept lattices ⋮ Graded cubes of opposition in fuzzy formal concept analysis ⋮ Maximal closed set and half-space separations in finite closure systems ⋮ Retículos teóricos y el análisis de conceptos formales, herramientas para el estructuralismo metateórico ⋮ An axiomatizable logical foundation for lattice-ordered qualitative linguistic approach for reasoning with words ⋮ \(\mathcal{K}\)-formal concept analysis as linear algebra over idempotent semifields ⋮ On the efficient stability computation for the selection of interesting formal concepts ⋮ The Infinite-Valued Łukasiewicz Logic and Probability ⋮ Query-based association rule mining supporting user perspective ⋮ Itemset mining: a constraint programming perspective ⋮ Formalizing and enriching phenotype signatures using Boolean networks ⋮ Formal Concept Analysis with Constraints by EM Operators ⋮ A sharing-based approach to supporting adaptation in service compositions ⋮ Probabilistic Interpretations of Predicates ⋮ Graded polygons of opposition in fuzzy formal concept analysis ⋮ Characterization and reduction of concept lattices through matroid theory ⋮ An application of formal concept analysis to semantic neural decoding ⋮ Constructing a Knowledge Base for Gene Regulatory Dynamics by Formal Concept Analysis Methods ⋮ Actionability and Formal Concepts: A Data Mining Perspective ⋮ Mathematical Morphology on Soft Sets for Application to Metabolic Networks ⋮ A representation of continuous domains via relationally approximable concepts in a generalized framework of formal concept analysis ⋮ Countably many weakenings of Belnap-Dunn logic ⋮ Attribute reduction in formal contexts based on a new discernibility matrix ⋮ Quantifying sequential subsumption ⋮ Handling high dimensionality contexts in formal concept analysis via binary decision diagrams ⋮ A Conceptual Approach for Relational IR: Application to Legal Collections ⋮ Clustering of Links and Clustering of Nodes: Fusion of Knowledge in Social Networks

This page was built for publication: Formal concept analysis. Foundations and applications.