Zobrazeno 1 - 10
of 144
pro vyhledávání: '"Lev V. Utkin"'
Autor:
Lev V. Utkin, Vladimir S. Zaborovsky, Maxim S. Kovalev, Andrei V. Konstantinov, Natalia A. Politaeva, Alexey A. Lukashin
Publikováno v:
IEEE Access, Vol 9, Pp 120158-120175 (2021)
A method for interpreting uncertainty of predictions provided by machine learning survival models is proposed. It is called UncSurvEx and aims to determine which features of an analyzed example lead to uncertain predictions of an explainable black-bo
Externí odkaz:
https://doaj.org/article/6c0edcc9b0e9490cb60ec34f81e6af05
Autor:
Lev V. Utkin
Publikováno v:
Advances in Fuzzy Systems, Vol 2012 (2012)
A fuzzy classification model is studied in the paper. It is based on the contaminated (robust) model which produces fuzzy expected risk measures characterizing classification errors. Optimal classification parameters of the models are derived by mini
Externí odkaz:
https://doaj.org/article/02ad9b700d92482395591ffde9d6688f
Publikováno v:
Progress in Artificial Intelligence.
Autor:
Andrei V. Konstantinov, Lev V. Utkin, Stanislav R. Kirpichenko, Boris V. Kozlov, Andrey Y. Ageev
Publikováno v:
Procedia Computer Science. 212:454-463
Publikováno v:
International Journal of Information Technology & Decision Making. 19:963-986
A new adaptive weighted deep forest algorithm which can be viewed as a modification of the confidence screening mechanism is proposed. The main idea underlying the algorithm is based on adaptive weigting of every training instance at each cascade lev
Publikováno v:
COMPUTING AND INFORMATICS; Vol. 39 No. 6 (2020): Computing and Informatics; 1172–1202
A new method for explaining the Siamese neural network (SNN) as a black-box model for weakly supervised learning is proposed under condition that the output of every subnetwork of the SNN is a vector which is accessible. The main problem of the expla
Autor:
Andrei V. Konstantinov, Lev V. Utkin
A new multi-attention based method for solving the MIL problem (MAMIL), which takes into account the neighboring patches or instances of each analyzed patch in a bag, is proposed. In the method, one of the attention modules takes into account adjacen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5766631ca0b7aa64cf1ea6c78c967d70
http://arxiv.org/abs/2112.06071
http://arxiv.org/abs/2112.06071
Publikováno v:
National Science Review
Autor:
Ernest M. Kasimov, Viktor Kryshtapovich, Lev V. Utkin, Viktor Tiulpin, Maxim S. Kovalev, Anna A. Meldo
Publikováno v:
Robotics and Technical Cybernetics. 7:196-207
Autor:
Lev V. Utkin, Mikhail A. Ryabinin, Andrei V. Konstantinov, Anna A. Meldo, Viacheslav S. Chukanov, Mikhail V. Kots
Publikováno v:
Knowledge-Based Systems. 177:136-144
A weighted random survival forest is presented in the paper. It can be regarded as a modification of the random forest improving its performance. The main idea underlying the proposed model is to replace the standard procedure of averaging used for e