The following pages link to Concept Lattices (Q5901756):
Displaying 23 items.
- A new algebraic structure for formal concept analysis (Q621606) (← links)
- Triadic formal concept analysis and triclustering: searching for optimal patterns (Q890322) (← links)
- An incremental algorithm to construct a lattice of set intersections (Q1001808) (← links)
- Complexity of learning in concept lattices from positive and negative examples (Q1878406) (← links)
- Possibility-theoretic extension of derivation operators in formal concept analysis over fuzzy lattices (Q1927241) (← links)
- General framework for consistencies in decision contexts (Q2023271) (← links)
- On Shapley value interpretability in concept-based learning with formal concept analysis (Q2107486) (← links)
- Extracting relations in texts with concepts of neighbours (Q2117129) (← links)
- Decision concept lattice vs. decision trees and random forests (Q2117142) (← links)
- Concept-cognitive computing system for dynamic classification (Q2140166) (← links)
- Constructing three-way concept lattice based on the composite of classical lattices (Q2191239) (← links)
- Mining closed patterns in relational, graph and network data (Q2248524) (← links)
- Concept lattices with negative information: a characterization theorem (Q2282052) (← links)
- A closed sets based learning classifier for implicit authentication in web browsing (Q2286388) (← links)
- On Neural Network Architecture Based on Concept Lattices (Q3388223) (← links)
- Connecting concept lattices with bonds induced by external information (Q6052625) (← links)
- Generalized decision directed acyclic graphs for classification tasks (Q6064259) (← links)
- Selection of appropriate bonds between \(\mathcal{L}\)-fuzzy formal contexts for recommendation tasks (Q6191154) (← links)
- Tri-level conflict analysis from the angle of three-valued concept analysis (Q6495135) (← links)
- Computing stable extensions of argumentation frameworks using formal concept analysis (Q6545530) (← links)
- Concepts of neighbors and their application to instance-based learning on relational data (Q6570280) (← links)
- An efficient method of renewing object-induced three-way concept lattices involving decreasing attribute-granularity levels (Q6570308) (← links)
- Single sample-oriented attribute reduction for rule learning with formal concept analysis (Q6588424) (← links)
