Skip to main content
SpringerLink
Log in

Approximating Points by a Piecewise Linear Function: II. Dealing with Outliers

  • Conference paper
Algorithms and Computation (ISAAC 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5878))

Included in the following conference series:

Abstract

In this paper, we study the violation versions of the planar points approximation problems, which deal with outliers in the input points. We present efficient algorithms for both the step function and the more general piecewise linear function cases, and for both non-weighted and weighted points. Most of our results are first-known. Our algorithms are based on interesting and nontrivial geometric techniques and data structures, which may find other applications.

This research was supported in part by NSF under Grants CCF-0515203 and CCF-0916606.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aggarwal, A., Klawe, M., Moran, S., Shor, P., Wilbur, R.: Geometric applications of a matrix-searching algorithm. Algorithmica 2, 195–208 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  2. Aggarwal, A., Park, J.: Notes on searching in multidimensional monotone arrays. In: Proc. of 29th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 497–512 (1988)

    Google Scholar 

  3. Buragohain, C., Shrivastava, N., Suri, S.: Space efficient streaming algorithms for the maximum error histogram. In: Proc. of the 23rd International Conference on Data Engineering (ICDE), pp. 1026–1035 (2007)

    Google Scholar 

  4. Chan, T.M.: Output-sensitive results on convex hulls and extreme points, and related problems. Discrete & Computational Geometry 16(3), 369–387 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  5. Chan, T.M.: Low-dimensional linear programming with violations. In: Proc. of 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 570–579 (2002)

    Google Scholar 

  6. Chen, D.Z., Wang, H.: Approximating points by a piecewise linear function (manuscript, 2009)

    Google Scholar 

  7. Chen, D.Z., Wang, H.: Approximating points by a piecewise linear function: I. In: Proc. of the 20th International Symposium on Algorithms and Computation, ISAAC (2009)

    Google Scholar 

  8. Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)

    MATH  Google Scholar 

  9. Driscoll, J., Sarnak, N., Sleator, D., Tarjan, R.E.: Making data structures persistent. Journal of Computer and System Sciences 38(1), 86–124 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  10. Everett, H., Robert, J.-M., van Kreveld, M.: An optimal algorithm for the (≤ k)-levels and with applications to separation and transversal problems. International Journal of Computational Geometry and Applications 6(3), 247–261 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  11. Fournier, H., Vigneron, A.: Fitting a step function to a point set. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol. 5193, pp. 442–453. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  12. Frederickson, G.: Optimal algorithms for tree partitioning. In: Proc. of the 2nd Annual ACM-SIAM Symposium of Discrete Algorithms (SODA), pp. 168–177 (1991)

    Google Scholar 

  13. Frederickson, G., Johnson, D.: Generalized selection and ranking: Sorted matrices. SIAM Journal on Computing 13(1), 14–30 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  14. Gabow, H.N., Bentley, J., Tarjan, R.E.: Scaling and related techniques for geometry problems. In: Proc. of the 16th Annual ACM Symposium on Theory of Computing (STOC), pp. 135–143 (1984)

    Google Scholar 

  15. Guha, S.: On the space—time of optimal, approximate and streaming algorithms for synopsis construction problems. The VLDB Journal – The International Journal on Very Large Data Bases 17(6), 1509–1535 (2008)

    Article  MathSciNet  Google Scholar 

  16. Guha, S., Shim, K.: A note on linear time algorithms for maximum error histograms. IEEE Transactions on Knowledge and Data Engineering 19(7), 993–997 (2007)

    Article  Google Scholar 

  17. Guha, S., Shim, K., Woo, J.: Rehist: Relative error histogram construction algorithms. In: Proc. of the 30th International Conference on Very Large Data Bases (VLDB), pp. 300–311 (2004)

    Google Scholar 

  18. Jagadish, H.V., Koudas, N., Muthukrishnan, S., Poosala, V., Sevcik, K.C., Suel, T.: Optimal histograms with quality gurantees. In: Proc. of the 24th International Conference on Very Large Data Bases (VLDB), pp. 275–286 (1998)

    Google Scholar 

  19. Karras, P., Sacharidis, D., Mamoulis, N.: Exploiting duality in summarization with deterministic guarantees. In: Proc. of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 380–389 (2007)

    Google Scholar 

  20. Matoušek, J.: On geometric optimization with few violated constraints. In: Proc. of the 10th Annual Symposium on Computational Geometry, pp. 312–321 (1994)

    Google Scholar 

  21. Overmars, M., van Leeuwen, J.: Maintenance of configurations in the plane. Journal of Computer System Sciences 23(2), 166–204 (1981)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN, 46556, USA

    Danny Z. Chen & Haitao Wang

Authors
  1. Danny Z. Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Haitao Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Electrical and Computer Engineering, University of Hawaii, Holmes Hall 483, 2540 Dole Street, 96822, Honolulu, HI, USA

    Yingfei Dong

  2. Department of Computer Science, University of Texas at Dallas, 75083, Dallas, TX, USA

    Ding-Zhu Du

  3. Department of Computer Science, University of California, 93106, Santa Barbara, CA, USA

    Oscar Ibarra

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, D.Z., Wang, H. (2009). Approximating Points by a Piecewise Linear Function: II. Dealing with Outliers. In: Dong, Y., Du, DZ., Ibarra, O. (eds) Algorithms and Computation. ISAAC 2009. Lecture Notes in Computer Science, vol 5878. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10631-6_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10631-6_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10630-9

  • Online ISBN: 978-3-642-10631-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation