Get our free extension to see links to code for papers anywhere online!

Chrome logo  Add to Chrome

Firefox logo Add to Firefox
Picture for Sergei O. Kuznetsov

Sergei O. Kuznetsov

Decision Concept Lattice vs. Decision Trees and Random Forests



Egor Dudyrev , Sergei O. Kuznetsov

Figure 1 for Decision Concept Lattice vs. Decision Trees and Random Forests
Figure 2 for Decision Concept Lattice vs. Decision Trees and Random Forests
Figure 3 for Decision Concept Lattice vs. Decision Trees and Random Forests
Figure 4 for Decision Concept Lattice vs. Decision Trees and Random Forests
* 8 pages, 2 figures. The final authenticated version is going to be published in Braud, A., Buzmakov, A., Hanika, T., Le Ber, F. (eds.) ICFCA 2021. LNCS (LNAI), vol. 12733, pp. 1-9. Springer, Heidelberg (2021). https://doi.org/10.1007/978-3-030-77867-5_16 
   Access Paper or Ask Questions

Mint: MDL-based approach for Mining INTeresting Numerical Pattern Sets



Tatiana Makhalova , Sergei O. Kuznetsov , Amedeo Napoli

Figure 1 for Mint: MDL-based approach for Mining INTeresting Numerical Pattern Sets
Figure 2 for Mint: MDL-based approach for Mining INTeresting Numerical Pattern Sets
Figure 3 for Mint: MDL-based approach for Mining INTeresting Numerical Pattern Sets
Figure 4 for Mint: MDL-based approach for Mining INTeresting Numerical Pattern Sets

   Access Paper or Ask Questions

Discovery data topology with the closure structure. Theoretical and practical aspects



Tatiana Makhalova , Sergei O. Kuznetsov , Amedeo Napoli

Figure 1 for Discovery data topology with the closure structure. Theoretical and practical aspects
Figure 2 for Discovery data topology with the closure structure. Theoretical and practical aspects
Figure 3 for Discovery data topology with the closure structure. Theoretical and practical aspects
Figure 4 for Discovery data topology with the closure structure. Theoretical and practical aspects
* 37 pages 
   Access Paper or Ask Questions

Ordered Sets for Data Analysis



Sergei O. Kuznetsov


   Access Paper or Ask Questions

On interestingness measures of formal concepts



Sergei O. Kuznetsov , Tatiana Makhalova

Figure 1 for On interestingness measures of formal concepts
Figure 2 for On interestingness measures of formal concepts
Figure 3 for On interestingness measures of formal concepts
Figure 4 for On interestingness measures of formal concepts
* 20 pages, 5 figures, 3 tables 
   Access Paper or Ask Questions

Mining Best Closed Itemsets for Projection-antimonotonic Constraints in Polynomial Time



Aleksey Buzmakov , Sergei O. Kuznetsov , Amedeo Napoli

Figure 1 for Mining Best Closed Itemsets for Projection-antimonotonic Constraints in Polynomial Time
Figure 2 for Mining Best Closed Itemsets for Projection-antimonotonic Constraints in Polynomial Time
Figure 3 for Mining Best Closed Itemsets for Projection-antimonotonic Constraints in Polynomial Time
Figure 4 for Mining Best Closed Itemsets for Projection-antimonotonic Constraints in Polynomial Time

   Access Paper or Ask Questions

Concept Stability for Constructing Taxonomies of Web-site Users



Sergei O. Kuznetsov , Dmitry I. Ignatov

Figure 1 for Concept Stability for Constructing Taxonomies of Web-site Users
Figure 2 for Concept Stability for Constructing Taxonomies of Web-site Users
* Sergei O. Kuznetsov, D.I. Ignatov, Concept Stability for Constructing Taxonomies of Web-site users, in Proc. Social Network Analysis and Conceptual Structures: Exploring Opportunities, S. Obiedkov, C. Roth (Eds.), Clermont-Ferrand (France), February 16, 2007 
   Access Paper or Ask Questions

Fast Generation of Best Interval Patterns for Nonmonotonic Constraints



Aleksey Buzmakov , Sergei O. Kuznetsov , Amedeo Napoli

Figure 1 for Fast Generation of Best Interval Patterns for Nonmonotonic Constraints
Figure 2 for Fast Generation of Best Interval Patterns for Nonmonotonic Constraints
Figure 3 for Fast Generation of Best Interval Patterns for Nonmonotonic Constraints
Figure 4 for Fast Generation of Best Interval Patterns for Nonmonotonic Constraints
* 18 pages; 2 figures; 2 tables; 1 algorithm; PKDD 2015 Conference Scientific Track 
   Access Paper or Ask Questions

Graphlet-based lazy associative graph classification



Yury Kashnitsky , Sergei O. Kuznetsov

Figure 1 for Graphlet-based lazy associative graph classification
Figure 2 for Graphlet-based lazy associative graph classification
Figure 3 for Graphlet-based lazy associative graph classification
Figure 4 for Graphlet-based lazy associative graph classification
* This paper has been withdrawn by the author due to the incomplete set of necessary definitions and experiments 
   Access Paper or Ask Questions

On mining complex sequential data by means of FCA and pattern structures



Aleksey Buzmakov , Elias Egho , Nicolas Jay , Sergei O. Kuznetsov , Amedeo Napoli , Chedy Raïssi

Figure 1 for On mining complex sequential data by means of FCA and pattern structures
Figure 2 for On mining complex sequential data by means of FCA and pattern structures
Figure 3 for On mining complex sequential data by means of FCA and pattern structures
Figure 4 for On mining complex sequential data by means of FCA and pattern structures
* An accepted publication in International Journal of General Systems. The paper is created in the wake of the conference on Concept Lattice and their Applications (CLA'2013). 27 pages, 9 figures, 3 tables 
   Access Paper or Ask Questions
1
2
>>