Home
→
Browsing by Author

Browsing by Author "Kareev I."

Now showing items 1-8 of 8

Confidence sets based on the positive part James–Stein estimator with the asymptotically constant coverage probability

Ahmed S.; Kareev I.; Suraphee S.; Volodin A.; Volodin I. (2015)

© 2014 Taylor & Francis. The asymptotic expansions for the coverage probability of a confidence set centred at the James–Stein estimator presented in our previous publications show that this probability depends on the ...
James-Stein confidence set: Equal area approach to the global approximation of coverage probability

Volodin I.; Kareev I. (2011)

In [S. A. Ahmed, A. K. MD. E. Saleh, A. I. Volodin, and I. N. Volodin, "Asymptotic Expansion of the Coverage Probability of James-Stein Estimators," Theory Probab. Appl. 51, 683-695 (2007)], an asymptotic expansion of ...
Lower bound for the average sample size and the efficiency of ranking sequential procedures

Kareev I. (2014)

© 2014 Society for Industrial and Applied Mathematics. Some bounds for the average sample size are established for procedures of ranking of populations in the increase of the order of the value of a real parameter when the ...
Lower bounds for average sample size and efficiency of sequential selection procedures

Kareev I. (2013)

In this paper we establish lower bounds for average sample size in procedures for selecting a population with the largest value of scalar parameter, when the given probability of the correct solution is guaranteed. In ...
Lower bounds for expected sample size of sequential procedures for the multinomial selection problems

Kareev I. (2017)

© 2017 Taylor & Francis Group, LLC. In this article, lower bounds for expected sample size of sequential selection procedures are constructed for the problem of selecting the most probable event of k-variate multinomial ...
Lower bounds for the expected sample size of sequential procedures for selecting and ranking of binomial and Poisson populations

Kareev I. (2016)

© 2016, Pleiades Publishing, Ltd.In this paper we consider selection and ranking problems for the cases of binomial and Poisson populations. Our main goal is to construct lower bounds for the expected sample size of ...
Minimax Modifications of Linear Discriminant Analysis for Classification with Rare Classes

Bratanova K.; Kareev I.; Salimov R. (2020)

© 2020 IEEE. We consider the problem of classification for imbalanced samples with rare classes. A common problem for machine learning methods in such setting is that a rare class would have extremely high classification ...
Sequentual First-Crossing Look-Ahead Procedure for Selecting a Population with the Largest Meanin Normal-Normal Model

Kareev I.; Zaikin A. (2019)

© 2019, Pleiades Publishing, Ltd. The problem of statistical selection of a population with the largest mean value is considered. We introduce a sequential selection procedure, which we call first-crossing look-ahead (FCLA), ...

Now showing items 1-8 of 8

Search DSpace

Advanced Search

Browse

All of Kazan Federal University Digital Repository

Browsing by Author "Kareev I."

Browsing by Author "Kareev I."

Search DSpace

Browse

All of Kazan Federal University Digital Repository

My Account