Pages that link to "Item:Q4409026"

The following pages link to Comparing performance of algorithms for generating concept lattices (Q4409026):

Displaying 50 items.

• Discovery of optimal factors in binary data via a novel method of matrix decomposition (Q131470) (← 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)
• Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data (Q425555) (← links)
• Connections between covering-based rough sets and concept lattices (Q473370) (← links)
• From-below approximations in Boolean matrix factorization: geometry and new algorithm (Q494072) (← links)
• The joy of implications, aka pure Horn formulas: mainly a survey (Q507516) (← links)
• Three-way concept learning based on cognitive operators: an information fusion viewpoint (Q518620) (← links)
• A `best-of-breed' approach for designing a fast algorithm for computing fixpoints of Galois connections (Q527183) (← links)
• Relations of reduction between covering generalized rough sets and concept lattices (Q528775) (← links)
• On attribute reduction in concept lattices: methods based on discernibility matrix are outperformed by basic clarification and reduction (Q778428) (← links)
• Handling high dimensionality contexts in formal concept analysis via binary decision diagrams (Q781866) (← links)
• Triadic formal concept analysis and triclustering: searching for optimal patterns (Q890322) (← links)
• Granularity of attributes in formal concept analysis (Q903595) (← links)
• Some decision and counting problems of the Duquenne-Guigues basis of implications (Q943835) (← links)
• Size of random Galois lattices and number of closed frequent itemsets (Q967342) (← links)
• An incremental algorithm to construct a lattice of set intersections (Q1001808) (← links)
• Enumeration aspects of maximal cliques and bicliques (Q1028116) (← links)
• Attribute reduction in formal contexts based on a new discernibility matrix (Q1032017) (← links)
• Lattices, closures systems and implication bases: a survey of structural aspects and algorithms (Q1659991) (← links)
• Constructing L-fuzzy concept lattices without fuzzy Galois closure operation (Q1697983) (← links)
• Three-way concept analysis for incomplete formal contexts (Q1721688) (← links)
• Enumeration of 2-level polytopes (Q1741129) (← links)
• Probabilistic generalization of formal concepts (Q1758720) (← links)
• Characterizing approximate-matching dependencies in formal concept analysis with pattern structures (Q1800380) (← links)
• A new algorithm for Boolean matrix factorization which admits overcovering (Q1800383) (← links)
• Parallel algorithms for enumerating closed patterns from multi-relational data (Q1800394) (← links)
• Complexity of learning in concept lattices from positive and negative examples (Q1878406) (← links)
• Vague concept lattice reduction using granular computing and vague entropy (Q1997642) (← links)
• Reducing one class of machine learning algorithms to logical operations of plausible reasoning (Q2017512) (← links)
• LCM from FCA point of view: a CbO-style algorithm with speed-up features (Q2076970) (← links)
• Decision concept lattice vs. decision trees and random forests (Q2117142) (← links)
• Interface between logical analysis of data and formal concept analysis (Q2178106) (← links)
• Constructing three-way concept lattice based on the composite of classical lattices (Q2191239) (← links)
• A general theory of concept lattice with tractable implication exploration (Q2193284) (← links)
• On attribute reduction in concept lattices: experimental evaluation shows discernibility matrix based methods inefficient (Q2200602) (← links)
• Optimizations in computing the Duquenne-Guigues basis of implications (Q2248528) (← links)
• Biclustering meets triadic concept analysis (Q2248533) (← links)
• Characterizing functional dependencies in formal concept analysis with pattern structures (Q2254619) (← links)
• A semantic approach to concept lattice-based information retrieval (Q2254623) (← links)
• On biconcepts in formal fuzzy concept analysis (Q2282288) (← links)
• Link key candidate extraction with relational concept analysis (Q2286378) (← 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)
• Three-way dual concept analysis (Q2302795) (← links)
• A reduction theorem to compute fixpoints of fuzzy closure operators (Q2328960) (← links)
• On the calculation of formal concept stability (Q2336824) (← links)
• Optimal factorization of three-way binary data using triadic concepts (Q2376908) (← links)
• Relational concept discovery in structured datasets (Q2385432) (← links)
• Attribute-incremental construction of the canonical implication basis (Q2385433) (← links)