Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find




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

Diskretnyi Analiz i Issledovanie Operatsii, 2021, Volume 28, Issue 2, Pages 60–73
DOI: https://doi.org/10.33048/daio.2021.28.692 (Mi da1277) 		 
NP-hardness of some data cleaning problem

O. A. Kutnenkoab, A. V. Plyasunovab

a Sobolev Institute of Mathematics, 4 Acad. Koptyug Avenue, 630090 Novosibirsk, Russia
b Novosibirsk State University, 2 Pirogov Street, 630090 Novosibirsk, Russia
Full-text PDF (318 kB)
References:
PDF
HTML
DOI: https://doi.org/10.33048/daio.2021.28.692
Abstract: We prove the NP-hardness of the problem of outliers detection considered in this paper, to solving which a data analysis problem is reduced. As a quantitative assessment of the compactness of the image, the function of rival similarity (FRiS-function) is used, which evaluates the local similarity of objects with their closest neighbors. Illustr. 1, bibliogr. 23.
Keywords: NP-hardness, detecting outliers, image compactness, function of rival similarity.
Funding agency Grant number
Ministry of Science and Higher Education of the Russian Federation 0314-2019-0015
0314-2019-0014
This research is carried out within the framework of the state contract of the Sobolev Institute of Mathematics (Projects 0314–2019–0015, 0314–2019–0014).
Received: 10.06.2020
Revised: 22.12.2020
Accepted: 24.12.2020
English version:
Journal of Applied and Industrial Mathematics, 2021, Volume 15, Issue 2, Pages 285–291
DOI: https://doi.org/10.1134/S1990478921020095
Bibliographic databases:
Document Type: Article
UDC: 519.87+519.854
Language: Russian
Citation: O. A. Kutnenko, A. V. Plyasunov, “NP-hardness of some data cleaning problem”, Diskretn. Anal. Issled. Oper., 28:2 (2021), 60–73; J. Appl. Industr. Math., 15:2 (2021), 285–291
Citation in format AMSBIB
\Bibitem{KutPly21}
\by O.~A.~Kutnenko, A.~V.~Plyasunov
\paper NP-hardness of~some data cleaning problem
\jour Diskretn. Anal. Issled. Oper.
\yr 2021
\vol 28
\issue 2
\pages 60--73
\mathnet{http://mi.mathnet.ru/da1277}
\crossref{https://doi.org/10.33048/daio.2021.28.692}
\transl
\jour J. Appl. Industr. Math.
\yr 2021
\vol 15
\issue 2
\pages 285--291
\crossref{https://doi.org/10.1134/S1990478921020095}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85116188441}
Linking options:
  • https://www.mathnet.ru/eng/da1277
  • https://www.mathnet.ru/eng/da/v28/i2/p60
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024