Conceptual exploration
From MaRDI portal
Recommendations
Cited in
(48)- Compressed representation of learning spaces
- Algorithms for tight spans and tropical linear spaces
- Set visualisations with Euler and Hasse diagrams
- A study of algorithms relating distributive lattices, median graphs, and Formal Concept Analysis
- 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
- Attribute reduction of SE-ISI concept lattices for incomplete contexts
- Probably approximately correct learning of Horn envelopes from queries
- Most specific consequences in the description logic \(\mathcal{E} \mathcal{L} \)
- From equivalence queries to PAC learning: the case of implication theories
- Rules acquisition of formal decision contexts based on three-way concept lattices
- The rectangle complex of a relation
- scientific article; zbMATH DE number 1120176 (Why is no real title available?)
- Exact learning of lightweight description logic ontologies
- scientific article; zbMATH DE number 2140440 (Why is no real title available?)
- scientific article; zbMATH DE number 1406209 (Why is no real title available?)
- Formal Concept Analysis and Extensions for Complex Data Analytics
- Scalable Visual Analytics in FCA
- Decompositional approach to research of formal contexts
- Exploring faulty data
- On Decomposition of a Binary Context Without Losing Formal Concepts
- All centralising monoids with majority witnesses on a four-element set
- Towards Collaborative Conceptual Exploration
- Concept Lattices
- On the number of maximal antichains in Boolean lattices for \(n\) up to 7
- Attribute exploration with multiple contradicting partial experts
- 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
- Information lattice learning
- Explaining data with formal concept analysis
- Computing stable extensions of argumentation frameworks using formal concept analysis
- Formal concept analysis: from knowledge discovery to knowledge processing
- Self-adhesivity in lattices of abstract conditional independence models
- Pac learning of concept inclusions for ontology-mediated query answering
- A minimal base or a direct base? That is the question!
- The language of contextual attribute logics -- introduction and survey
- Attribute implications with unknown information based on weak Heyting algebras
- Bipartite digraphs with modular concept lattices of height 2
- Faithful Logic Embeddings in HOL — Deep and Shallow (Isabelle/HOL dataset)
This page was built for publication: Conceptual exploration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2826625)
