The following pages link to (Q3149779):
Displaying 50 items.
- Discovery of the \(D\)-basis in binary tables based on hypergraph dualization (Q507518) (← links)
- On the definition of suitable orderings to generate adjunctions over an unstructured codomain (Q508629) (← links)
- A greedy clustering algorithm based on interval pattern concepts and the problem of optimal box positioning (Q670431) (← links)
- An efficient method to factorize fuzzy attribute-oriented concept lattices (Q723260) (← links)
- Lattices, closures systems and implication bases: a survey of structural aspects and algorithms (Q1659991) (← links)
- Similarity relations in fuzzy attribute-oriented concept lattices (Q1677216) (← links)
- On the connection of hypergraph theory with formal concept analysis and rough set theory (Q1750616) (← links)
- On efficient factorization of standard fuzzy concept lattices and attribute-oriented fuzzy concept lattices (Q1795368) (← links)
- Exploratory knowledge discovery over web of data (Q1800378) (← links)
- Characterizing approximate-matching dependencies in formal concept analysis with pattern structures (Q1800380) (← links)
- On closure operators related to maximal tricliques in tripartite hypergraphs (Q1800387) (← links)
- Rough-set concept analysis: interpreting RS-definable concepts based on ideas from formal concept analysis (Q1991892) (← links)
- General framework for consistencies in decision contexts (Q2023271) (← links)
- Steps towards causal Formal Concept Analysis (Q2076995) (← links)
- Fixed-point semantics for barebone relational concept analysis (Q2117114) (← links)
- Extracting relations in texts with concepts of neighbours (Q2117129) (← links)
- Sandwich: an algorithm for discovering relevant link keys in an LKPS concept lattice (Q2117140) (← links)
- Fuzzy closure systems: motivation, definition and properties (Q2169193) (← links)
- A general theory of concept lattice with tractable implication exploration (Q2193284) (← links)
- A note on similarity relations between fuzzy attribute-oriented concept lattices (Q2198206) (← links)
- \(\mathcal{K}\)-formal concept analysis as linear algebra over idempotent semifields (Q2200609) (← links)
- \textsc{NextPriorityConcept}: a new and generic algorithm computing concepts from complex and heterogeneous data (Q2207493) (← links)
- Multi-adjoint concept lattices with heterogeneous conjunctors and hedges. (Q2254615) (← links)
- Characterizing functional dependencies in formal concept analysis with pattern structures (Q2254619) (← links)
- Generalized pattern extraction from concept lattices (Q2254621) (← links)
- Link key candidate extraction with relational concept analysis (Q2286378) (← links)
- Graph-FCA: an extension of formal concept analysis to knowledge graphs (Q2286389) (← links)
- Conjunctive query pattern structures: a relational database model for formal concept analysis (Q2286397) (← links)
- On the size of \(\exists \)-generalized concept lattices (Q2286401) (← links)
- Contribution to attributive and object subcontexts in inferring good maximally redundant tests (Q2286403) (← links)
- \textsc{RCA-seq}: an original approach for enhancing the analysis of sequential data based on hierarchies of multilevel closed partially-ordered patterns (Q2286407) (← links)
- Enumerating all maximal biclusters in numerical datasets (Q2292925) (← links)
- A theoretical study on the object (property) oriented concept lattices based on three-way decisions (Q2296040) (← links)
- Data meaning and knowledge discovery: semantical aspects of information systems (Q2300442) (← links)
- On stability of a formal concept (Q2385428) (← links)
- Dichotomic lattices and local discretization for Galois lattices (Q2418288) (← links)
- Gene Expression Array Exploration Using $\mathcal{K}$ -Formal Concept Analysis (Q3003414) (← links)
- Biclustering Numerical Data in Formal Concept Analysis (Q3003415) (← links)
- Abstract Concept Lattices (Q3003422) (← links)
- Viewing Morphisms Between Pattern Structures via Their Concept Lattices and via Their Representations (Q3388220) (← links)
- From Meaningful Orderings in the Web of Data to Multi-level Pattern Structures (Q3388221) (← links)
- Axiomatisation of general concept inclusions from finite interpretations (Q4586152) (← links)
- Using Pattern Structures for Analyzing Ontology-Based Annotations of Biomedical Data (Q4924387) (← links)
- Formal Concept Analysis and Extensions for Complex Data Analytics (Q5054972) (← links)
- Analysis of Complex and Heterogeneous Data Using FCA and Monadic Predicates (Q5054978) (← links)
- Computing Dependencies Using FCA (Q5054980) (← links)
- On Fuzzy Generalizations of Concept Lattices (Q5214099) (← links)
- Formal Concept Analysis from the Standpoint of Possibility Theory (Q5255641) (← links)
- Extensional Confluences and Local Closure Operators (Q5255653) (← links)
- A Note on Pattern Structures and Their Projections (Q5255654) (← links)
