scientific article; zbMATH DE number 1808289
From MaRDI portal
Publication:3149779
zbMATH Open0994.68147MaRDI QIDQ3149779FDOQ3149779
Authors: Bernhard Ganter, Sergei O. Kuznetsov 
Publication date: 26 September 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2120/21200129
Title of this publication is not available (Why is that?)
Recommendations
Knowledge representation (68T30) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Cited In (72)
- Precedence-inclusion patterns and relational learning
- A theoretical study on the object (property) oriented concept lattices based on three-way decisions
- A Note on Pattern Structures and Their Projections
- Extensional Confluences and Local Closure Operators
- Axiomatisation of general concept inclusions from finite interpretations
- Lattices, closures systems and implication bases: a survey of structural aspects and algorithms
- Fixed-point semantics for barebone relational concept analysis
- Extracting relations in texts with concepts of neighbours
- Sandwich: an algorithm for discovering relevant link keys in an LKPS concept lattice
- \(\mathcal{K}\)-formal concept analysis as linear algebra over idempotent semifields
- \textsc{NextPriorityConcept}: a new and generic algorithm computing concepts from complex and heterogeneous data
- Generalized pattern extraction from concept lattices
- Formal Concept Analysis from the Standpoint of Possibility Theory
- Graph-FCA: an extension of formal concept analysis to knowledge graphs
- On Fuzzy Generalizations of Concept Lattices
- Multi-adjoint concept lattices with heterogeneous conjunctors and hedges.
- A Finite Basis for the Set of $\mathcal{EL}$ -Implications Holding in a Finite Model
- Biclustering numerical data in formal concept analysis
- Projection lateral bands and lateral retracts
- Using Pattern Structures for Analyzing Ontology-Based Annotations of Biomedical Data
- An efficient method to factorize fuzzy attribute-oriented concept lattices
- General framework for consistencies in decision contexts
- A Proposal for Extending Formal Concept Analysis to Knowledge Graphs
- Characterizing functional dependencies in formal concept analysis with pattern structures
- Subsumption of vertical viewpoint patterns
- Weak Hierarchies: A Central Clustering Structure
- Fuzzy closure systems: motivation, definition and properties
- On efficient factorization of standard fuzzy concept lattices and attribute-oriented fuzzy concept lattices
- Orbital concept lattices
- \textsc{RCA-seq}: an original approach for enhancing the analysis of sequential data based on hierarchies of multilevel closed partially-ordered patterns
- Conjunctive query pattern structures: a relational database model for formal concept analysis
- On the size of \(\exists \)-generalized concept lattices
- Characterizing approximate-matching dependencies in formal concept analysis with pattern structures
- Exploratory knowledge discovery over web of data
- On closure operators related to maximal tricliques in tripartite hypergraphs
- Enumerating all maximal biclusters in numerical datasets
- From Meaningful Orderings in the Web of Data to Multi-level Pattern Structures
- Viewing Morphisms Between Pattern Structures via Their Concept Lattices and via Their Representations
- Exploring Pattern Structures of Syntactic Trees for Relation Extraction
- A note on similarity relations between fuzzy attribute-oriented concept lattices
- The diffraction pattern of projected structures
- Similarity relations in fuzzy attribute-oriented concept lattices
- Data meaning and knowledge discovery: semantical aspects of information systems
- Gene expression array exploration using \(\mathcal{K}\)-formal concept analysis
- A general theory of concept lattice with tractable implication exploration
- Steps towards causal Formal Concept Analysis
- Dichotomic lattices and local discretization for Galois lattices
- Discovery of the \(D\)-basis in binary tables based on hypergraph dualization
- On the definition of suitable orderings to generate adjunctions over an unstructured codomain
- Rough-set concept analysis: interpreting RS-definable concepts based on ideas from formal concept analysis
- Formal Concept Analysis and Extensions for Complex Data Analytics
- Generalized decision directed acyclic graphs for classification tasks
- Link key candidate extraction with relational concept analysis
- Scale Coarsening as Feature Selection
- A greedy clustering algorithm based on interval pattern concepts and the problem of optimal box positioning
- Title not available (Why is that?)
- On the connection of hypergraph theory with formal concept analysis and rough set theory
- Abstract concept lattices
- Contribution to attributive and object subcontexts in inferring good maximally redundant tests
- On stability of a formal concept
- Discovery of link keys in resource description framework datasets based on pattern structures
- Revisiting Pattern Structure Projections
- 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
- Formal concept analysis: from knowledge discovery to knowledge processing
- A triadic generalisation of the Boolean concept lattice
- Graph-FCA meets pattern structures
- Relational concept analysis in practice: capitalizing on data modeling using design patterns
- Description lattices of generalised convex hulls
- Analysis of Complex and Heterogeneous Data Using FCA and Monadic Predicates
- Computing Dependencies Using FCA
- Representations of uncertainty in artificial intelligence: probability and possibility
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3149779)
