The following pages link to (Q4674794):
Displayed 17 items.
- Discovery of optimal factors in binary data via a novel method of matrix decomposition (Q131470) (← links)
- Valuations and closure operators on finite lattices (Q548273) (← links)
- Horn axiomatizations for sequential data (Q870272) (← links)
- An incremental algorithm to construct a lattice of set intersections (Q1001808) (← links)
- Associative models for storing and retrieving concept lattices (Q1958821) (← links)
- Efficient algorithms for the periodic subgraphs mining problem (Q2376786) (← links)
- Optimal decompositions of matrices with grades into binary and graded matrices (Q2430346) (← links)
- Factorization of fuzzy concept lattices with hedges by modification of input data (Q2430349) (← links)
- Parallel algorithm for computing fixpoints of Galois connections (Q2430355) (← links)
- Fast factorization by similarity in formal concept analysis of data with fuzzy attributes (Q2643021) (← links)
- Formal concept analysis with background knowledge: a case study in paleobiological taxonomy of belemnites (Q2871584) (← links)
- Selecting Important Concepts Using Weights (Q3003409) (← links)
- Fuzzy Concept Lattices with Incomplete Knowledge (Q3143397) (← links)
- Modeling Ceteris Paribus Preferences in Formal Concept Analysis (Q4924394) (← links)
- From Concepts to Concept Lattice: A Border Algorithm for Making Covers Explicit (Q5445325) (← links)
- Direct Factorization by Similarity of Fuzzy Concept Lattices by Factorization of Input Data (Q5452414) (← links)
- Graded LinClosure and Its Role in Relational Data Analysis (Q5452420) (← links)