The following pages link to (Q3952147):
Displaying 50 items.
- Discovery of optimal factors in binary data via a novel method of matrix decomposition (Q131470) (← links)
- Yoneda philosophy in engineering (Q275932) (← links)
- A comprehensive survey on formal concept analysis, its research trends and applications (Q326255) (← links)
- Relational concept analysis: mining concept lattices from multi-relational data (Q354609) (← links)
- Relating attribute reduction in formal, object-oriented and property-oriented concept lattices (Q356097) (← links)
- On limits and colimits of variety-based topological systems (Q409742) (← links)
- Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data (Q425555) (← links)
- On lower and upper intension order relations by different cover concepts (Q433038) (← links)
- The correspondence between the concepts in description logics for contexts and formal concept analysis (Q439795) (← links)
- Multi-adjoint property-oriented and object-oriented concept lattices (Q454881) (← links)
- Knowledge reduction in real decision formal contexts (Q454993) (← links)
- Multi-confidence rule acquisition and confidence-preserved attribute reduction in interval-valued decision systems (Q459050) (← links)
- Connections between covering-based rough sets and concept lattices (Q473370) (← links)
- Formal query systems on contexts and a representation of algebraic lattices (Q497110) (← links)
- Bipolar fuzzy graph representation of concept lattice (Q508759) (← links)
- Three-way concept learning based on cognitive operators: an information fusion viewpoint (Q518620) (← links)
- Concept learning via granular computing: a cognitive viewpoint (Q528687) (← links)
- The use of two relations in \( L\)-fuzzy contexts (Q528724) (← links)
- Relations of reduction between covering generalized rough sets and concept lattices (Q528775) (← links)
- Valuations and closure operators on finite lattices (Q548273) (← links)
- A heuristic knowledge-reduction method for decision formal contexts (Q552269) (← links)
- A new algebraic structure for formal concept analysis (Q621606) (← links)
- On the complexity of enumerating pseudo-intents (Q628340) (← links)
- Power contexts and their concept lattices (Q641167) (← links)
- The use of linguistic variables and fuzzy propositions in the \(L\)-fuzzy concept theory (Q662230) (← links)
- The conjunctive model of hierarchical classes (Q676547) (← links)
- On multi-adjoint concept lattices based on heterogeneous conjunctors (Q690922) (← links)
- An application of formal concept analysis to semantic neural decoding (Q693291) (← links)
- Formal concept analysis based on fuzzy granularity base for different granulations (Q695251) (← links)
- Minimal bases of temporal attribute implications (Q722104) (← links)
- An efficient method to factorize fuzzy attribute-oriented concept lattices (Q723260) (← links)
- Decision implication canonical basis: a logical perspective (Q743121) (← links)
- Use of Choquet integrals in multivalued contexts (Q781372) (← links)
- On cognitive preferences and the plausibility of rule-based models (Q782445) (← links)
- Subdirect decomposition of concept lattices (Q793764) (← links)
- The jump number and the lattice of maximal antichains (Q807648) (← links)
- Logical handling of uncertain, ontology-based, spatial information (Q835161) (← links)
- Approaches to the representations and logic operations of fuzzy concepts in the framework of axiomatic fuzzy set theory. II. (Q867663) (← links)
- Fuzzy inference based on fuzzy concept lattice (Q869118) (← links)
- On the order dimension of convex polytopes (Q915134) (← links)
- Some decision and counting problems of the Duquenne-Guigues basis of implications (Q943835) (← links)
- Algebras for Galois-style connections and their discrete duality (Q969585) (← links)
- Fuzzy graph representation of a fuzzy concept lattice (Q983036) (← links)
- Reduction about approximation spaces of covering generalized rough sets (Q985142) (← links)
- An incremental algorithm to construct a lattice of set intersections (Q1001808) (← links)
- Treatment of L-fuzzy contexts with absent values (Q1007849) (← links)
- Covering graphs with few complete bipartite subgraphs (Q1019181) (← links)
- Enumeration aspects of maximal cliques and bicliques (Q1028116) (← links)
- Attribute reduction in formal contexts based on a new discernibility matrix (Q1032017) (← links)
- Formal concept analysis via multi-adjoint concept lattices (Q1037849) (← links)
