default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaxim Kovalev
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j8]Lev V. Utkin
, Vladimir S. Zaborovsky, Maxim S. Kovalev, Andrei V. Konstantinov, Natalia A. Politaeva, Alexey Lukashin:
Uncertainty Interpretation of the Machine Learning Survival Model Predictions. IEEE Access 9: 120158-120175 (2021)- [j7]Maxim Kovalev, Lev V. Utkin, Frank P. A. Coolen, Andrei V. Konstantinov:
Counterfactual Explanation of Machine Learning Survival Models. Informatica 32(4): 817-847 (2021) - [c4]Lev V. Utkin, Pavel D. Drobintsev, Maxim Kovalev, Andrei V. Konstantinov:
Combining an Autoencoder and a Variational Autoencoder for Explaining the Machine Learning Model Predictions. FRUCT 2021: 489-494 - 2020
- [j6]Anna A. Meldo, Lev V. Utkin, Maxim Kovalev, Ernest M. Kasimov:
The natural language explanation algorithms for the lung cancer computer-aided diagnosis system. Artif. Intell. Medicine 108: 101952 (2020) - [j5]Lev V. Utkin, Maxim S. Kovalev, Frank P. A. Coolen:
Imprecise weighted extensions of random forests for classification and regression. Appl. Soft Comput. 92: 106324 (2020) - [j4]Lev V. Utkin, Maxim Kovalev, Ernest M. Kasimov:
Explanation of Siamese Neural Networks for Weakly Supervised Learning. Comput. Informatics 39(6) (2020) - [j3]Maxim S. Kovalev, Lev V. Utkin, Ernest M. Kasimov:
SurvLIME: A method for explaining machine learning survival models. Knowl. Based Syst. 203: 106164 (2020) - [j2]Maxim S. Kovalev, Lev V. Utkin:
A robust algorithm for explaining unreliable machine learning survival models using the Kolmogorov-Smirnov bounds. Neural Networks 132: 1-18 (2020) - [i5]Maxim S. Kovalev, Lev V. Utkin, Ernest M. Kasimov:
SurvLIME: A method for explaining machine learning survival models. CoRR abs/2003.08371 (2020) - [i4]Maxim S. Kovalev, Lev V. Utkin:
A robust algorithm for explaining unreliable machine learning survival models using the Kolmogorov-Smirnov bounds. CoRR abs/2005.02249 (2020) - [i3]Lev V. Utkin, Maxim S. Kovalev, Ernest M. Kasimov:
SurvLIME-Inf: A simplified modification of SurvLIME for explanation of machine learning survival models. CoRR abs/2005.02387 (2020) - [i2]Maxim S. Kovalev, Lev V. Utkin:
Counterfactual explanation of machine learning survival models. CoRR abs/2006.16793 (2020)
2010 – 2019
- 2019
- [j1]Lev V. Utkin, Maxim Kovalev, Anna A. Meldo:
A deep forest classifier with weights of class probability distribution subsets. Knowl. Based Syst. 173: 15-27 (2019) - [c3]Lev V. Utkin, Anna A. Meldo, Maxim Kovalev, Ernest M. Kasimov:
An Ensemble of Triplet Neural Networks for Differential Diagnostics of Lung Cancer. FRUCT 2019: 346-352 - [c2]Lev V. Utkin, Maxim Kovalev, Anna A. Meldo, Frank P. A. Coolen:
Imprecise Extensions of Random Forests and Random Survival Forests. ISIPTA 2019: 404-413 - [i1]Lev V. Utkin, Maxim S. Kovalev, Ernest M. Kasimov:
An explanation method for Siamese neural networks. CoRR abs/1911.07702 (2019) - 2014
- [c1]Maxim Kovalev:
Indoor positioning of mobile devices by combined Wi-Fi and GPS signals. IPIN 2014: 332-339
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
