NP-Hardness of Some Data Cleaning Problem Full article
| Journal |
Journal of Applied and Industrial Mathematics
ISSN: 1990-4789 , E-ISSN: 1990-4797 |
||||
|---|---|---|---|---|---|
| Output data | Year: 2021, Volume: 15, Number: 2, Pages: 285-291 Pages count : 7 DOI: 10.1134/S1990478921020095 | ||||
| Tags | data cleaning; function of rival similarity; image compactness; NP-hardness | ||||
| Authors |
|
||||
| Affiliations |
|
Abstract:
Abstract: We prove the NP-hardness of the data cleaning problem under study. One of the dataanalysis questions reduces to the problem. As a quantitative assessment of the imagecompactness, we use the function of rival similarity (FRiS-function) by which we evaluate thelocal similarity of objects with their closest neighbors. © 2021, Pleiades Publishing, Ltd.
Cite:
Kutnenko O.A.
, Plyasunov A.V.
NP-Hardness of Some Data Cleaning Problem
Journal of Applied and Industrial Mathematics. 2021. V.15. N2. P.285-291. DOI: 10.1134/S1990478921020095 Scopus OpenAlex
NP-Hardness of Some Data Cleaning Problem
Journal of Applied and Industrial Mathematics. 2021. V.15. N2. P.285-291. DOI: 10.1134/S1990478921020095 Scopus OpenAlex
Original:
Кутненко О.А.
, Плясунов А.В.
NP-трудность некоторой задачи цензурирования данных
Дискретный анализ и исследование операций. 2021. Т.28. №2. С.60-73. DOI: 10.33048/daio.2021.28.692 OpenAlex
NP-трудность некоторой задачи цензурирования данных
Дискретный анализ и исследование операций. 2021. Т.28. №2. С.60-73. DOI: 10.33048/daio.2021.28.692 OpenAlex
Identifiers:
| Scopus: | 2-s2.0-85116188441 |
| OpenAlex: | W3204397939 |