Formal concept analysis: from knowledge discovery to knowledge processing
From MaRDI portal
Publication:6602260
Recommendations
Cites work
- scientific article; zbMATH DE number 1670907 (Why is no real title available?)
- scientific article; zbMATH DE number 1670908 (Why is no real title available?)
- scientific article; zbMATH DE number 1670913 (Why is no real title available?)
- scientific article; zbMATH DE number 1808289 (Why is no real title available?)
- scientific article; zbMATH DE number 3852463 (Why is no real title available?)
- scientific article; zbMATH DE number 1054727 (Why is no real title available?)
- scientific article; zbMATH DE number 1936671 (Why is no real title available?)
- scientific article; zbMATH DE number 194916 (Why is no real title available?)
- scientific article; zbMATH DE number 2090123 (Why is no real title available?)
- scientific article; zbMATH DE number 7635224 (Why is no real title available?)
- scientific article; zbMATH DE number 3420808 (Why is no real title available?)
- scientific article; zbMATH DE number 2243401 (Why is no real title available?)
- A Finite Basis for the Set of $\mathcal{EL}$ -Implications Holding in a Finite Model
- A Proposal for Combining Formal Concept Analysis and Description Logics for Mining Relational Data
- A conceptual approach for relational IR: application to legal collections
- A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes
- A proposal for extending formal concept analysis to knowledge graphs
- A proposition for combining pattern structures and relational concept analysis
- A semantic approach to concept lattice-based information retrieval
- A survey of formal concept analysis support for software engineering activities
- An incremental algorithm to construct a lattice of set intersections
- Approximating concept stability
- Attribute-incremental construction of the canonical implication basis
- Automated Enzyme Classification by Formal Concept Analysis
- Axiomatisation of general concept inclusions from finite interpretations
- Biclustering meets triadic concept analysis
- Biclustering numerical data in formal concept analysis
- Camelis: a logical information system to organise and browse a collection of documents
- Characterizing functional dependencies in formal concept analysis with pattern structures
- Combining formal concept analysis and translation to assign frames and semantic role sets to French verbs
- Comparing performance of algorithms for generating concept lattices
- Computing iceberg concept lattices with Titanic
- Computing premises of a minimal cover of functional dependencies is intractable
- Concept Lattices of a Relational Structure
- Concept lattices and order in fuzzy logic
- Conceptual Structures at Work
- Conceptual Structures at Work
- Conceptual Structures at Work
- Conceptual exploration
- Conceptual navigation in RDF graphs with SPARQL-like queries
- Cubes of concepts: multi-dimensional exploration of multi-valued contexts
- Discovery Science
- Exceptional contextual subgraph mining
- Exploring pattern structures of syntactic trees for relation extraction
- FCA in a logical programming setting for visualization-oriented graph compression
- Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data
- Finding robust itemsets under subsampling
- Fitting pattern structures to knowledge discovery in big data
- Formal Concept Analysis Enhances Fault Localization in Software
- Formal Concept Analysis of Social Networks
- Formal concept analysis and information retrieval -- a survey
- Formal concept analysis. 9th international conference, ICFCA 2011, Nicosia, Cyprus, May 2--6, 2011. Proceedings
- Formal concept analysis. Foundations and applications.
- Graph-FCA in practice
- Handbook on ontologies
- Handling Spatial Relations in Logical Concept Analysis to Explore Geographical Data
- Hermes: a simple and efficient algorithm for building the AOC-poset of a binary relation
- Hierarchies of weighted closed partially-ordered patterns for enhancing sequential data analysis
- Inductive Logic Programming
- Inductive Logic Programming: Theory and methods
- Introduction to logical information systems
- Lattice-based biclustering using partition pattern structures
- Lexico-Logical Acquisition of OWL DL Axioms
- Machine learning on the basis of formal concept analysis
- On categorial grammars as logical information systems
- On interestingness measures of formal concepts
- On mining complex sequential data by means of FCA and pattern structures
- On stability of a formal concept
- On the complexity of enumerating pseudo-intents
- On the intractability of computing the Duquenne-Guigues base
- Performance-friendly rule extraction in large water data-sets with AOC posets and relational concept analysis
- Polyadic concept analysis
- Relational concept analysis: mining concept lattices from multi-relational data
- Relational concept discovery in structured datasets
- Revisiting pattern structure projections
- SPARQL query containment under RDFS entailment regime
- Scalable estimates of concept stability
- The multiple facets of the canonical direct unit implicational basis
- Towards a navigation paradigm for triadic concepts
- Triadic formal concept analysis and triclustering: searching for optimal patterns
- Two basic algorithms in concept analysis
- Why can concept lattices support knowledge discovery in databases?
Cited in
(3)
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)
