The following pages link to Sergei O. Kuznetsov (Q238862):
Displayed 50 items.
- Dualization in lattices given by ordered sets of irreducibles (Q507520) (← links)
- Item:Q238862 (redirect page) (← links)
- Mathematical aspects of concept analysis (Q676803) (← links)
- Mint: MDL-based approach for mining interesting numerical pattern sets (Q832644) (← links)
- Triadic formal concept analysis and triclustering: searching for optimal patterns (Q890322) (← links)
- Interactive error correction in implicative theories (Q899138) (← links)
- Some decision and counting problems of the Duquenne-Guigues basis of implications (Q943835) (← links)
- Machine learning on the basis of formal concept analysis (Q1778346) (← links)
- Complexity of learning in concept lattices from positive and negative examples (Q1878406) (← links)
- Computing premises of a minimal cover of functional dependencies is intractable (Q1946215) (← links)
- Decision concept lattice vs. decision trees and random forests (Q2117142) (← links)
- On interestingness measures of formal concepts (Q2198028) (← links)
- \textsc{NextPriorityConcept}: a new and generic algorithm computing concepts from complex and heterogeneous data (Q2207493) (← links)
- Biclustering meets triadic concept analysis (Q2248533) (← links)
- On coupling FCA and MDL in pattern mining (Q2294572) (← links)
- On stability of a formal concept (Q2385428) (← links)
- On overfitting of classifiers making a lattice (Q2399925) (← links)
- Algorithms for constructing a set of all concepts of formal context and their Hasse diagrams (Q2568136) (← links)
- Introducing the closure structure and the GDPM algorithm for mining and understanding a tabular dataset (Q2671748) (← links)
- (Q2754242) (← links)
- On mining complex sequential data by means of FCA and pattern structures (Q2817080) (← links)
- (Q2893330) (← links)
- (Q2893336) (← links)
- Approximating Concept Stability (Q2907456) (← links)
- Enumerating Minimal Hypotheses and Dualizing Monotone Boolean Functions on Lattices (Q3003407) (← links)
- Biclustering Numerical Data in Formal Concept Analysis (Q3003415) (← links)
- (Q3149779) (← links)
- (Q3352553) (← links)
- On Neural Network Architecture Based on Concept Lattices (Q3388223) (← links)
- Learning communicative actions of conflicting human agents (Q3543673) (← links)
- On Links between Concept Lattices and Related Complexity Problems (Q3552285) (← links)
- Two FCA-Based Methods for Mining Gene Expression Data (Q3630247) (← links)
- (Q3782856) (← links)
- (Q3989040) (← links)
- (Q3989059) (← links)
- (Q4218274) (← links)
- (Q4289706) (← links)
- Comparing performance of algorithms for generating concept lattices (Q4409026) (← links)
- (Q4789140) (← links)
- (Q4802633) (← links)
- (Q4851184) (← links)
- Fitting Pattern Structures to Knowledge Discovery in Big Data (Q4924398) (← links)
- Scalable Estimates of Concept Stability (Q4981133) (← links)
- Revisiting Pattern Structure Projections (Q5255658) (← links)
- Conceptual Structures at Work (Q5313136) (← links)
- Can triconcepts become triclusters? (Q5326152) (← links)
- Inductive Logic Programming (Q5394646) (← links)
- Fuzzy and rough formal concept analysis: a survey (Q5411880) (← links)
- (Q5429564) (← links)
- Scale Coarsening as Feature Selection (Q5445335) (← links)