Informatika i Ee Primeneniya [Informatics and its Applications]
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Inform. Primen.:
Year:
Volume:
Issue:
Page:
Find






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


Informatika i Ee Primeneniya [Informatics and its Applications], 2021, Volume 15, Issue 4, Pages 79–86
DOI: https://doi.org/10.14357/19922264210411
(Mi ia760)
 

This article is cited in 4 scientific papers (total in 4 papers)

Statistics and clusters for detection of anomalous insertions in Big Data environment

A. A. Grushoa, N. A. Grushoa, M. I. Zabezhailoa, D. V. Smirnovb, E. E. Timoninaa, S. Ya. Shorgina

a Federal Research Center “Computer Science and Control” of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119133, Russian Federation
b Sberbank of Russia, 19 Vavilov Str., Moscow 117999, Russian Federation
Full-text PDF (157 kB) Citations (4)
References:
Abstract: The paper builds algorithms for reducing the level of “false alarms” when searching for anomalies in complex heterogeneous sequences of objects (Big Data). Traditionally, in mathematical statistics, such a decrease is achieved by minimizing the error of “false alarms.” However, in the problems of detecting anomalies (rare intrusions of anomalous data), this approach leads to an increase in the probability of losing the required anomalies. In this paper, in order not to lose the required anomalies, on the contrary, in criteria designed for the least complexity of calculations, it is proposed to make a large error of the appearance of “false alarms” but use the fact that the number of objects allocated by such criteria is much smaller than the number of original objects in Big Data. The selected objects can then be grouped into a single cluster and additional information related to the objects in the cluster can be used to identify the required anomalies. The sense of these actions is that more difficult-to-compute characteristics of objects for dropping out “false alarms” will not require large computational resources on a smaller cluster of objects relative to the original data. It is shown that when certain conditions are satisfied, the order of using additional information does not affect the result of its use when filtering “false alarms.” The results of the filtering algorithm in the sequence of objects are generalized to filtering “false alarms” in the form of causal schemes in the initial data. Known schemes show how “false alarms” can be filtered identifying only fragments of schemes.
Keywords: information security, search for anomalies, algorithms for filtering “false alarms”.
Funding agency Grant number
Russian Foundation for Basic Research 18-29-03081_мк
The paper was partially supported by the Russian Foundation for Basic Research (project 18-29-03081).
Received: 17.09.2021
Document Type: Article
Language: Russian
Citation: A. A. Grusho, N. A. Grusho, M. I. Zabezhailo, D. V. Smirnov, E. E. Timonina, S. Ya. Shorgin, “Statistics and clusters for detection of anomalous insertions in Big Data environment”, Inform. Primen., 15:4 (2021), 79–86
Citation in format AMSBIB
\Bibitem{GruGruZab21}
\by A.~A.~Grusho, N.~A.~Grusho, M.~I.~Zabezhailo, D.~V.~Smirnov, E.~E.~Timonina, S.~Ya.~Shorgin
\paper Statistics and clusters for~detection of~anomalous insertions in~Big Data environment
\jour Inform. Primen.
\yr 2021
\vol 15
\issue 4
\pages 79--86
\mathnet{http://mi.mathnet.ru/ia760}
\crossref{https://doi.org/10.14357/19922264210411}
Linking options:
  • https://www.mathnet.ru/eng/ia760
  • https://www.mathnet.ru/eng/ia/v15/i4/p79
  • This publication is cited in the following 4 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Информатика и её применения
    Statistics & downloads:
    Abstract page:157
    Full-text PDF :44
    References:28
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024