|
|
Publications in Math-Net.Ru
-
Computational complexity of two problems of cognitive data analysis
Diskretn. Anal. Issled. Oper., 29:1 (2022), 18–32
-
NP-hardness of some data cleaning problem
Diskretn. Anal. Issled. Oper., 28:2 (2021), 60–73
-
Cleaning data sets with diagnostic errors in the high-dimensional feature spaces
Mat. Biolog. Bioinform., 14:2 (2019), 464–476
-
The problem of correction diagnostic errors in the target attribute with the function of rival similarity
Mat. Biolog. Bioinform., 13:1 (2018), 38–49
-
Constructing the compressed description of dataset by the function of rival similarity
Sib. Zh. Ind. Mat., 16:1 (2013), 29–41
-
A quantitative measure of compactness and similarity in competitive space
Sib. Zh. Ind. Mat., 13:1 (2010), 59–71
-
Recognition methods based on the algorithm AdDel
Sib. Zh. Ind. Mat., 7:1 (2004), 39–47
-
A lower bound for the error probability of recognizing a quasiperiodic sequence of pulses that is distorted by Gaussian uncorrelated noise
Sib. Zh. Ind. Mat., 1:2 (1998), 113–126
© , 2024