Tolerant property testing and distance approximation

In this paper we study a generalization of standard property testing where the algorithms are required to be more tolerant with respect to objects that do not have, but are close to having, the property. Specifically, a tolerant property testing algorithm is required to accept objects that are ϵ 1 -...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of computer and system sciences Jg. 72; H. 6; S. 1012 - 1042
Hauptverfasser: Parnas, Michal, Ron, Dana, Rubinfeld, Ronitt
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier Inc 01.09.2006
Schlagworte:
Approximation
Clustering
Property testing
Sublinear algorithms
Approximation
Clustering
Sublinear algorithms
Property testing
ISSN:0022-0000, 1090-2724
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper we study a generalization of standard property testing where the algorithms are required to be more tolerant with respect to objects that do not have, but are close to having, the property. Specifically, a tolerant property testing algorithm is required to accept objects that are ϵ 1 -close to having a given property P and reject objects that are ϵ 2 -far from having P , for some parameters 0 ⩽ ϵ 1 < ϵ 2 ⩽ 1 . Another related natural extension of standard property testing that we study, is distance approximation. Here the algorithm should output an estimate ϵ ˆ of the distance of the object to P , where this estimate is sufficiently close to the true distance of the object to P . We first formalize the notions of tolerant property testing and distance approximation and discuss the relationship between the two tasks, as well as their relationship to standard property testing. We then apply these new notions to the study of two problems: tolerant testing of clustering and distance approximation for monotonicity. We present and analyze algorithms whose query complexity is either polylogarithmic or independent of the size of the input.
ISSN:0022-0000
1090-2724
DOI:10.1016/j.jcss.2006.03.002