Vestnik Sankt-Peterburgskogo Universiteta. Seriya 10. Prikladnaya Matematika. Informatika. Protsessy Upravleniya
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Vestnik S.-Petersburg Univ. Ser. 10. Prikl. Mat. Inform. Prots. Upr.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Vestnik Sankt-Peterburgskogo Universiteta. Seriya 10. Prikladnaya Matematika. Informatika. Protsessy Upravleniya, 2015, Issue 3, Pages 96–104 (Mi vspui259)  

Computer science

Randomized algorithm for adjusting sample data

A. V. Orekhov

St. Petersburg State University, 7/9, Universitetskaya embankment, St. Petersburg, 199034, Russian Federation
References:
Abstract: One of the main problems of statistical analysis of experimental data is obtaining an unbiased (representative) sample. It is a natural desire to obtain a representative sample of computational methods. The procedure for adjusting the structure of the sample in accordance with the structure of the population is said to be “adjusted sample”. All known methods of adjusting the sample data have a significant drawback: these methods are “correct” empirical distribution functions, not the sample. In this paper we introduce the concepts of control spaces and studied traits, given the formal definition of a representative sample population; described randomized, algorithm, adjustment is sample data, not their empirical distributions. Iteration of algorithm of randomized sample corrections of data can be described as follows. Please select one spectral value of the control characteristics such that the absolute difference between the respective selective and general shares has a maximum value, then have all $k\mid 1\le k\le n$,  sought $\max|w_k-p_k|$. If spectral values of a few, then randomly selects any of them. Let it be the $i$-th component of the vector $\mathbf {W}^{X}$ and $\mathbf {P}^{X}$. Then, if $w_i-p_i>0$, of the total sample randomly is to remove some vector $\mathbf{Z_t}$, in which the component $x_i=1$, if $w_i-p_i<0 $, the total sample randomly duplicated vector $\mathbf{Z_t}$, in which the component $x_i=1$. Refs 9.
Keywords: randomized algorithm, sampling frame.
Received: April 30, 2015
Bibliographic databases:
Document Type: Article
UDC: 519.253+519.712
Language: Russian
Citation: A. V. Orekhov, “Randomized algorithm for adjusting sample data”, Vestnik S.-Petersburg Univ. Ser. 10. Prikl. Mat. Inform. Prots. Upr., 2015, no. 3, 96–104
Citation in format AMSBIB
\Bibitem{Ore15}
\by A.~V.~Orekhov
\paper Randomized algorithm for adjusting sample data
\jour Vestnik S.-Petersburg Univ. Ser. 10. Prikl. Mat. Inform. Prots. Upr.
\yr 2015
\issue 3
\pages 96--104
\mathnet{http://mi.mathnet.ru/vspui259}
\elib{https://elibrary.ru/item.asp?id=24323228}
Linking options:
  • https://www.mathnet.ru/eng/vspui259
  • https://www.mathnet.ru/eng/vspui/y2015/i3/p96
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Вестник Санкт-Петербургского университета. Серия 10. Прикладная математика. Информатика. Процессы управления
    Statistics & downloads:
    Abstract page:89
    Full-text PDF :39
    References:31
    First page:6
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024