The following pages link to (Q4674794):
Displaying 50 items.
- Discovery of optimal factors in binary data via a novel method of matrix decomposition (Q131470) (← links)
- Block relations in formal fuzzy concept analysis (Q274444) (← links)
- Discovery of the \(D\)-basis in binary tables based on hypergraph dualization (Q507518) (← links)
- Characterization and reduction of concept lattices through matroid theory (Q507667) (← links)
- A `best-of-breed' approach for designing a fast algorithm for computing fixpoints of Galois connections (Q527183) (← links)
- Valuations and closure operators on finite lattices (Q548273) (← links)
- Constraint heterogeneous concept lattices and concept lattices with heterogeneous hedges (Q679835) (← links)
- Decision implication canonical basis: a logical perspective (Q743121) (← links)
- On attribute reduction in concept lattices: methods based on discernibility matrix are outperformed by basic clarification and reduction (Q778428) (← links)
- Horn axiomatizations for sequential data (Q870272) (← links)
- A logic of graded attributes (Q892134) (← links)
- Granularity of attributes in formal concept analysis (Q903595) (← links)
- An incremental algorithm to construct a lattice of set intersections (Q1001808) (← links)
- Exploratory knowledge discovery over web of data (Q1800378) (← links)
- Associative models for storing and retrieving concept lattices (Q1958821) (← links)
- General framework for consistencies in decision contexts (Q2023271) (← links)
- Document plagiarism detection using a new concept similarity in formal concept analysis (Q2039881) (← links)
- Typicality: a formal concept analysis account (Q2076997) (← links)
- A study of algorithms relating distributive lattices, median graphs, and Formal Concept Analysis (Q2076999) (← links)
- Interface between logical analysis of data and formal concept analysis (Q2178106) (← links)
- On attribute reduction in concept lattices: experimental evaluation shows discernibility matrix based methods inefficient (Q2200602) (← links)
- On attribute reduction in concept lattices: the polynomial time discernibility matrix-based method becomes the CR-method (Q2214973) (← links)
- Boolean factors as a means of clustering of interestingness measures of association rules (Q2248543) (← links)
- A semantic approach to concept lattice-based information retrieval (Q2254623) (← links)
- L-concept analysis with positive and negative attributes (Q2279692) (← links)
- Reinventing known results in FCA: notes on two recently published algorithms for computation of formal concepts (Q2286395) (← links)
- Contribution to attributive and object subcontexts in inferring good maximally redundant tests (Q2286403) (← links)
- Knowledge structure preserving fuzzy attribute reduction in fuzzy formal context (Q2302818) (← links)
- Multicriteria prioritization and partial order in environmental and ecological statistics (Q2324131) (← links)
- Ordinally equivalent data: a measurement-theoretic look at formal concept analysis of fuzzy attributes (Q2353967) (← links)
- Efficient algorithms for the periodic subgraphs mining problem (Q2376786) (← links)
- Knowledge representation using interval-valued fuzzy formal concept lattice (Q2402109) (← 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)
- Formal concept analysis based on the topology for attributes of a formal context (Q2446428) (← links)
- Closure-based constraints in formal concept analysis (Q2446833) (← links)
- Fast factorization by similarity in formal concept analysis of data with fuzzy attributes (Q2643021) (← links)
- Improving the performance of Lindig-style algorithms with empty intersections (Q2670896) (← links)
- The structure theorem of three-way concept lattice (Q2671768) (← 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)
- Formal Concept Analysis with Constraints by EM Operators (Q5141905) (← links)
- On Fuzzy Generalizations of Concept Lattices (Q5214099) (← 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)
- A Method for Reduction of Fuzzy Relation in Fuzzy Formal Context (Q5867242) (← links)
