Abstract
In this work, we present a method that will allow us to remove outliers from a data set. Given the measurements of a function f = g + e on a set of sample points \(X \subset \mathbb {R}^{d}\), where \(g \in C^{M+1}(\mathbb {R}^{d})\) is the function of interest and e is the deviation from the function g. We will say that a sample point x ∈ X is an outlier if the difference e(x) = f(x) − g(x) is large. We show that by analyzing the approximation errors on our sample set X, we may predict which of the sample points are outliers. Furthermore, we can identify outliers of very small deviations, as well as ones with large deviations.
Similar content being viewed by others
References
Amir, A., Levin, D.: High order approximation to non-smooth multivariate functions. ArXiv e-prints (2016)
Bos, L., Salkauskas, K.: Moving least-squares are backus-gilbert optimal. J. Approximation Theory 59(3), 267–275 (1989)
Chandola, V., Banerjee, A., Kumar, V.: Anomaly detection: a survey. ACM Comput. Surv. 41(3), 15 (2009)
Hodge, V.J., Austin, J.: A survey of outlier detection methodologies. Artif. Intell. Rev. 22(2), 85–126 (2004)
Levin, D.: The approximation power of moving least-squares. Math. Comput. Am. Math. Soc. 67(224), 1517–1531 (1998)
Levin, D.: Between moving least-squares and moving least- l 1. BIT Numerical Mathematics pp. 1–16. https://doi.org/10.1007/s10543-014-0522-0 (2014)
Natarajan, B.K.: Sparse approximate solutions to linear systems. SIAM J. Comput. 24(2), 227–234 (1995)
Wendland, H.: Scattered data approximation. Cambridge Monographs on Applied and Computational Mathematics. University Press, Cambridge (2004). https://books.google.co.il/books?id=i9nQnQEACAAJ
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Amir, A., Levin, D. Quasi-interpolation and outliers removal. Numer Algor 78, 805–825 (2018). https://doi.org/10.1007/s11075-017-0401-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11075-017-0401-2