Abstract
We initiate a new line of investigation into online property-preserving data reconstruction. Consider a dataset which is assumed to satisfy various (known) structural properties; eg, it may consist of sorted numbers, or points on a manifold, or vectors in a polyhedral cone, or codewords from an error-correcting code. Because of noise and errors, however, an (unknown) fraction of the data is deemed unsound, ie, in violation with the expected structural properties. Can one still query into the dataset in an online fashion and be provided data that is always sound? In other words, can one design a filter which, when given a query to any item I in the dataset, returns a sound item J that, although not necessarily in the dataset, differs from I as infrequently as possible. No preprocessing should be allowed and queries should be answered online. We consider the case of a monotone function. Specifically, the dataset encodes a function f:{1,...n} ↦R that is at (unknown) distance ε from monotone, meaning that f can—and must—be modified at εn places to become monotone.
Our main result is a randomized filter that can answer any query in O(log2 n log log n) time while modifying the function f at only O(εn) places. The amortized time over n function evaluations is O(log n). The filter works as stated with probability arbitrarily close to 1. We also provide an alternative filter with O(log n) worst case query time and O(εn log n) function modifications.
This work was supported in part by NSF grants CCR-998817, 0306283, ARO Grant DAAH04-96-1-0181.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ailon, N., Chazelle, B., Comandur, S., Liu, D.: Estimating the distance to a monotone Function. In: Proc. 8th RANDOM (2004)
Fischer, E.: The art of uninformed decisions: A primer to property testing. Bulletin of EATCS 75, 97–126 (2001)
Goldreich, O.: Combinatorial property testing - A survey. In: Randomization Methods in Algorithm Design, pp. 45–60 (1998)
Goldreich, O., Goldwasser, S., Ron, D.: Property testing and its connection to learning and approximation. J. ACM 45, 653–750 (1998)
Hoffmann, C.M., Hopcroft, J.E., Karasick, M.S.: Towards implementing robust geometric computations. In: Proc. 4th SOCG, pp. 106–117 (1988)
Parnas, M., Ron, D., Rubinfeld, R.: Tolerant property testing and distance approximation. In: ECCC (2004)
Ron, D.: Property testing. In: Handbook on Randomization, vol. II, pp. 597–649 (2001)
Rubinfeld, R., Sudan, M.: Robust characterization of polynomials with applications to program testing. SIAM J. Comput. 25, 647–668 (1996)
Salesin, S., Stolfi, J., Guibas, L.J.: Epsilon geometry: building robust algorithms from imprecise computations. In: Proc. 5th SOCG, pp. 208–217 (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ailon, N., Chazelle, B., Comandur, S., Liu, D. (2004). Property-Preserving Data Reconstruction. In: Fleischer, R., Trippen, G. (eds) Algorithms and Computation. ISAAC 2004. Lecture Notes in Computer Science, vol 3341. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30551-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-30551-4_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24131-7
Online ISBN: 978-3-540-30551-4
eBook Packages: Computer ScienceComputer Science (R0)