Formal concept analysis: from knowledge discovery to knowledge processing
From MaRDI portal
Publication:6602260
DOI10.1007/978-3-030-06167-8_13zbMATH Open1547.68734MaRDI QIDQ6602260
Marianne Huchard, Amedeo Napoli, Sergei O. Kuznetsov, Mehdi Kaytoue, S. Ferré
Publication date: 11 September 2024
Cites Work
- Relational concept analysis: mining concept lattices from multi-relational data
- Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data
- Formal concept analysis. 9th international conference, ICFCA 2011, Nicosia, Cyprus, May 2--6, 2011. Proceedings
- On the complexity of enumerating pseudo-intents
- Triadic formal concept analysis and triclustering: searching for optimal patterns
- The multiple facets of the canonical direct unit implicational basis
- An incremental algorithm to construct a lattice of set intersections
- Exceptional contextual subgraph mining
- Machine learning on the basis of formal concept analysis
- Polyadic concept analysis
- Concept lattices and order in fuzzy logic
- Introduction to logical information systems
- Computing premises of a minimal cover of functional dependencies is intractable
- Graph-FCA in practice
- On interestingness measures of formal concepts
- Biclustering meets triadic concept analysis
- A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes
- Combining formal concept analysis and translation to assign frames and semantic role sets to French verbs
- Hermes: a simple and efficient algorithm for building the AOC-poset of a binary relation
- Characterizing functional dependencies in formal concept analysis with pattern structures
- A semantic approach to concept lattice-based information retrieval
- Formal concept analysis. Foundations and applications.
- On stability of a formal concept
- Relational concept discovery in structured datasets
- Attribute-incremental construction of the canonical implication basis
- FCA in a logical programming setting for visualization-oriented graph compression
- Hierarchies of weighted closed partially-ordered patterns for enhancing sequential data analysis
- On mining complex sequential data by means of FCA and pattern structures
- Performance-friendly rule extraction in large water data-sets with AOC posets and relational concept analysis
- Conceptual Exploration
- Handbook on Ontologies
- Approximating Concept Stability
- Cubes of Concepts: Multi-dimensional Exploration of Multi-valued Contexts
- SPARQL Query Containment under RDFS Entailment Regime
- Biclustering Numerical Data in Formal Concept Analysis
- Conceptual Navigation in RDF Graphs with SPARQL-Like Queries
- On Categorial Grammars as Logical Information Systems
- Two Basic Algorithms in Concept Analysis
- A Proposal for Combining Formal Concept Analysis and Description Logics for Mining Relational Data
- Camelis: a logical information system to organise and browse a collection of documents
- Inductive Logic Programming: Theory and methods
- Why can concept lattices support knowledge discovery in databases?
- Comparing performance of algorithms for generating concept lattices
- Computing iceberg concept lattices with Titanic
- Axiomatisation of general concept inclusions from finite interpretations
- Formal Concept Analysis of Social Networks
- Fitting Pattern Structures to Knowledge Discovery in Big Data
- A Proposition for Combining Pattern Structures and Relational Concept Analysis
- Scalable Estimates of Concept Stability
- Automated Enzyme Classification by Formal Concept Analysis
- Finding Robust Itemsets under Subsampling
- Formal Concept Analysis and Information Retrieval – A Survey
- Exploring Pattern Structures of Syntactic Trees for Relation Extraction
- Revisiting Pattern Structure Projections
- Towards a Navigation Paradigm for Triadic Concepts
- A Proposal for Extending Formal Concept Analysis to Knowledge Graphs
- A Conceptual Approach for Relational IR: Application to Legal Collections
- Conceptual Structures at Work
- Conceptual Structures at Work
- Conceptual Structures at Work
- Inductive Logic Programming
- A Finite Basis for the Set of $\mathcal{EL}$ -Implications Holding in a Finite Model
- Lexico-Logical Acquisition of OWL DL Axioms
- Handling Spatial Relations in Logical Concept Analysis to Explore Geographical Data
- Formal Concept Analysis Enhances Fault Localization in Software
- Discovery Science
- Concept Lattices of a Relational Structure
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Related Items (2)
Concepts of neighbors and their application to instance-based learning on relational data ⋮ Synergies between machine learning and reasoning -- an introduction by the Kay R. Amel group
This page was built for publication: Formal concept analysis: from knowledge discovery to knowledge processing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6602260)
