Dyukova Elena Vsevolodovna

Publications in Math-Net.Ru

1. On the complexity of realizating logical supervised classification procedures
   
   Zh. Vychisl. Mat. Mat. Fiz., 65:8 (2025),  1443–1450
2. Correct supervised classification: JSM-method over product of partial orders
   
   Inform. Primen., 18:3 (2024),  61–68
3. Recognition of genome special regions by machine learning methods
   
   Artificial Intelligence and Decision Making, 2024, no. 4,  45–54
4. Logical methods of correct data classification
   
   Inform. Primen., 17:3 (2023),  64–70
5. One approach to decoding monotone logical function
   
   Avtomat. i Telemekh., 2022, no. 10,  134–143
6. On the complexity of logical classification learning procedures
   
   Inform. Primen., 16:4 (2022),  57–62
7. Finding maximal frequent and minimal infrequent sets in partially ordered data
   
   Inform. Primen., 16:1 (2022),  82–87
8. Mining frequent items in a product of partial orders using parallel calculations
   
   Avtomat. i Telemekh., 2021, no. 10,  13–24
9. On the choice of partial orders on feature values sets in the supervised classification problem
   
   Inform. Primen., 15:4 (2021),  72–78
10. On the number of maximal independent elements of partially ordered sets (the case of chains)
    
    Inform. Primen., 13:1 (2019),  25–32
11. On the logical analysis of partially ordered data in the supervised classification problem
    
    Zh. Vychisl. Mat. Mat. Fiz., 59:9 (2019),  1605–1616
12. Monotone dualization problem and its generalizations: asymptotic estimates of the number of solutions
    
    Zh. Vychisl. Mat. Mat. Fiz., 58:12 (2018),  2153–2168
13. On parallelization of asymptotically optimal dualization algorithms
    
    Inform. Primen., 11:3 (2017),  113–122
14. Logical correctors in the problem of classification by precedents
    
    Zh. Vychisl. Mat. Mat. Fiz., 57:11 (2017),  1906–1927
15. Asymptotically optimal dualization algorithms
    
    Zh. Vychisl. Mat. Mat. Fiz., 55:5 (2015),  895–910
16. On asymptotically optimal enumeration for irreducible coverings of Boolean matrix
    
    Prikl. Diskr. Mat., 2014, no. 1(23),  96–105
17. On the optimal correct recoding of integer data in recognition
    
    Inform. Primen., 6:4 (2012),  61–65
18. On the complexity of the dualization problem
    
    Zh. Vychisl. Mat. Mat. Fiz., 52:10 (2012),  1926–1935
19. Classification based on full decision trees
    
    Zh. Vychisl. Mat. Mat. Fiz., 52:4 (2012),  750–761
20. Asymptotic estimates for the number of solutions of the dualization problem and its generalizations
    
    Zh. Vychisl. Mat. Mat. Fiz., 51:8 (2011),  1531–1540
21. On the construction of irredundant coverings of an integer matrix
    
    Zh. Vychisl. Mat. Mat. Fiz., 47:3 (2007),  538–546
22. On the number of irreducible coverings of an integer matrix
    
    Zh. Vychisl. Mat. Mat. Fiz., 45:5 (2005),  935–940
23. On the implementation complexity of discrete (logical) recognition procedures
    
    Zh. Vychisl. Mat. Mat. Fiz., 44:3 (2004),  562–572
24. Classification procedures based on the construction of class coverings
    
    Zh. Vychisl. Mat. Mat. Fiz., 43:12 (2003),  1884–1895
25. Search for informative fragments in descriptions of objects in discrete recognition procedures
    
    Zh. Vychisl. Mat. Mat. Fiz., 42:5 (2002),  741–753
26. Discrete analysis of feature descriptions in recognition problems of high dimensionality
    
    Zh. Vychisl. Mat. Mat. Fiz., 40:8 (2000),  1264–1278
27. Algebraic-logic synthesis of correct recognition procedures based on elementary algorithms
    
    Zh. Vychisl. Mat. Mat. Fiz., 36:8 (1996),  215–223
28. Asymptotic estimates of some characteristics of a set of representative systems and the problem of stability
    
    Zh. Vychisl. Mat. Mat. Fiz., 35:1 (1995),  122–134
29. Complexity of realization of some pattern recognition procedures
    
    Zh. Vychisl. Mat. Mat. Fiz., 27:1 (1987),  114–127
30. The construction of irredundant tests for $k$-valued tables
    
    Dokl. Akad. Nauk SSSR, 238:6 (1978),  1279–1282
31. On an asymptotically optimal algorithm for constructing irredundant tests
    
    Dokl. Akad. Nauk SSSR, 233:4 (1977),  527–530


32. Поправки к статье “Об асимптотически оптимальном алгоритме построения тупиковых тестов” (ДАН, т. 233, № 4, 1977 г.)
    
    Dokl. Akad. Nauk SSSR, 237:6 (1977),  1264