Approximation polynomial algorithm for the data editing and data cleaning problem

Approximation polynomial algorithm for the data editing and data cleaning problem Full article

Journal

Pattern Recognition and Image Analysis
ISSN: 1054-6618 , E-ISSN: 1555-6212

Output data

Year: 2017, Volume: 27, Number: 3, Pages: 365-370 Pages count : 6 DOI: 10.1134/s1054661817030038

Tags

data analysis; Euclidean space; maximal cardinality; NP-hard problem; polynomial approximation algorithm; square variation; subset of similar elements

Authors

Ageev A.A. ¹ , Kel’manov A.V. ^1,2 , Pyatkin A.V. ^1,2 , Khamidullin S.A. ² , Shenmaier V.V. ¹

Affiliations

1	Sobolev Institute of Mathematics
2	Novosibirsk State University

Ageev A.A. , Kel’manov A.V. , Pyatkin A.V. , Khamidullin S.A. , Shenmaier V.V.
Approximation polynomial algorithm for the data editing and data cleaning problem
Pattern Recognition and Image Analysis. 2017. V.27. N3. P.365-370. DOI: 10.1134/s1054661817030038 Scopus OpenAlex

Scopus:	2-s2.0-85029482767
OpenAlex:	W2755156293

DB	Citing
Scopus	17
OpenAlex	16