scientific article

Sergei O. Kuznetsov, Bernhard Ganter

Publication date: 26 September 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2120/21200129

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Knowledge representation (68T30) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Related Items (62)

Formal Concept Analysis and Extensions for Complex Data Analytics ⋮ Analysis of Complex and Heterogeneous Data Using FCA and Monadic Predicates ⋮ Computing Dependencies Using FCA ⋮ On stability of a formal concept ⋮ Lattices, closures systems and implication bases: a survey of structural aspects and algorithms ⋮ Fuzzy closure systems: motivation, definition and properties ⋮ Similarity relations in fuzzy attribute-oriented concept lattices ⋮ Axiomatisation of general concept inclusions from finite interpretations ⋮ Dichotomic lattices and local discretization for Galois lattices ⋮ Orbital concept lattices ⋮ Generalized decision directed acyclic graphs for classification tasks ⋮ A general theory of concept lattice with tractable implication exploration ⋮ Discovery of link keys in resource description framework datasets based on pattern structures ⋮ Graph-FCA meets pattern structures ⋮ A triadic generalisation of the Boolean concept lattice ⋮ Relational concept analysis in practice: capitalizing on data modeling using design patterns ⋮ A note on similarity relations between fuzzy attribute-oriented concept lattices ⋮ $\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 ⋮ Gene Expression Array Exploration Using $\mathcal{K}$ -Formal Concept Analysis ⋮ Biclustering Numerical Data in Formal Concept Analysis ⋮ Abstract Concept Lattices ⋮ A greedy clustering algorithm based on interval pattern concepts and the problem of optimal box positioning ⋮ 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 ⋮ On the connection of hypergraph theory with formal concept analysis and rough set theory ⋮ Multi-adjoint concept lattices with heterogeneous conjunctors and hedges. ⋮ Characterizing functional dependencies in formal concept analysis with pattern structures ⋮ Generalized pattern extraction from concept lattices ⋮ Using Pattern Structures for Analyzing Ontology-Based Annotations of Biomedical Data ⋮ General framework for consistencies in decision contexts ⋮ An efficient method to factorize fuzzy attribute-oriented concept lattices ⋮ A Finite Basis for the Set of $\mathcal{EL}$ -Implications Holding in a Finite Model ⋮ Scale Coarsening as Feature Selection ⋮ Link key candidate extraction with relational concept analysis ⋮ Graph-FCA: an extension of formal concept analysis to knowledge graphs ⋮ Conjunctive query pattern structures: a relational database model for formal concept analysis ⋮ On the size of $\exists $-generalized concept lattices ⋮ Contribution to attributive and object subcontexts in inferring good maximally redundant tests ⋮ \textsc{RCA-seq}: an original approach for enhancing the analysis of sequential data based on hierarchies of multilevel closed partially-ordered patterns ⋮ On efficient factorization of standard fuzzy concept lattices and attribute-oriented fuzzy concept lattices ⋮ Exploratory knowledge discovery over web of data ⋮ Characterizing approximate-matching dependencies in formal concept analysis with pattern structures ⋮ On closure operators related to maximal tricliques in tripartite hypergraphs ⋮ Enumerating all maximal biclusters in numerical datasets ⋮ A theoretical study on the object (property) oriented concept lattices based on three-way decisions ⋮ On Fuzzy Generalizations of Concept Lattices ⋮ Data meaning and knowledge discovery: semantical aspects of information systems ⋮ Viewing Morphisms Between Pattern Structures via Their Concept Lattices and via Their Representations ⋮ From Meaningful Orderings in the Web of Data to Multi-level Pattern Structures ⋮ Steps towards causal Formal Concept Analysis ⋮ Formal Concept Analysis from the Standpoint of Possibility Theory ⋮ Extensional Confluences and Local Closure Operators ⋮ A Note on Pattern Structures and Their Projections ⋮ Exploring Pattern Structures of Syntactic Trees for Relation Extraction ⋮ Revisiting Pattern Structure Projections ⋮ A Proposal for Extending Formal Concept Analysis to Knowledge Graphs ⋮ Weak Hierarchies: A Central Clustering Structure ⋮ 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

This page was built for publication: