Conceptual Exploration

DOI10.1007/978-3-662-49291-8zbMath1357.68004OpenAlexW2911564247MaRDI QIDQ2826625

Sergei Obiedkov, Bernhard Ganter

Publication date: 17 October 2016

Full work available at URL: https://doi.org/10.1007/978-3-662-49291-8

zbMATH Keywords

formal concept analysisattribute exploration

Mathematics Subject Classification ID

Knowledge representation (68T30) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items (32)

Formal Concept Analysis and Extensions for Complex Data Analytics ⋮ Scalable Visual Analytics in FCA ⋮ Attribute reduction of SE-ISI concept lattices for incomplete contexts ⋮ All centralising monoids with majority witnesses on a four-element set ⋮ From equivalence queries to PAC learning: the case of implication theories ⋮ Rules acquisition of formal decision contexts based on three-way concept lattices ⋮ Compressed representation of learning spaces ⋮ On the number of maximal antichains in Boolean lattices for \(n\) up to 7 ⋮ Attribute exploration with multiple contradicting partial experts ⋮ The rectangle complex of a relation ⋮ Compression with wildcards: Abstract simplicial complexes ⋮ Order-preserving self-maps of complete lattices ⋮ Three views on dependency covers from an FCA perspective ⋮ Examples of clique closure systems ⋮ On the maximal independence polynomial of the covering graph of the hypercube up to \(n=6\) ⋮ Representing concept lattices with Euler diagrams ⋮ Cost-aware sequential diagnostics ⋮ Formal concept analysis for the generation of plural referring expressions ⋮ DECOMPOSITIONAL APPROACH TO RESEARCH OF FORMAL CONTEXTS ⋮ Algorithms for tight spans and tropical linear spaces ⋮ Unnamed Item ⋮ Probably approximately correct learning of Horn envelopes from queries ⋮ Most specific consequences in the description logic \(\mathcal{E} \mathcal{L} \) ⋮ Set visualisations with Euler and Hasse diagrams ⋮ A study of algorithms relating distributive lattices, median graphs, and Formal Concept Analysis ⋮ On Decomposition of a Binary Context Without Losing Formal Concepts ⋮ On Shapley value interpretability in concept-based learning with formal concept analysis ⋮ A new kind of implication to reason with unknown information ⋮ Approximate computation of exact association rules ⋮ Triadic exploration and exploration with multiple experts ⋮ Exploring scale-measures of data sets ⋮ Towards Collaborative Conceptual Exploration

This page was built for publication: Conceptual Exploration