Skip to main content

An Exploratory Program Package for Non-Linear Data-Smoothers

  • Conference paper
COMPSTAT 1982 5th Symposium held at Toulouse 1982
  • 301 Accesses

Abstract

A special algorithm for running medians, called “TABLE” is developed and compared with the usual available sorting-algorithms. The algorithm is particularly useful for repeated sorting-algorithms of nearly sorted list. Time comparisons with other algorithms show the superiority of the new algorithm. The program package INDSMO (interactive non-linear data smoothers) is designed to allow a quick and comfortable application of such problems in exploratory data analysis.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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.

Similar content being viewed by others

References

  • Cooke C.R. and D.J. Kim (1980), Best Sorting Algorithm for Nearly Sorted Lists, Comm.ACM, Vol. 23, No. 11, 620–624.

    Article  Google Scholar 

  • Hoffinger H. (1982), Nichtlineare Datenglätter: Algorithmenvergleich and Computerprogramme, Diploma at the Institute of Statistics.

    Google Scholar 

  • Hoperoft J.E. (1974), Complexity of Computer Computations, Information Processing 74, North-Holland Publ.Co. 620–626.

    Google Scholar 

  • Knuth D.E. (1978), The Art of Computer Programming, Vol.3, Sorting and Searching, Addisson-Wesley, Reading MA (2nd ed).

    Google Scholar 

  • Mallows C.L. (1980), Some Theory of Non-Linear Smoothers, Annals of Statistics, Vol. 8, No. 4, p. 695–715.

    Article  MathSciNet  MATH  Google Scholar 

  • Polasek W. (1982), Exploratory Business Cycles Analysis, to appear in Empirica, Austrian Institute of Economic Research.

    Google Scholar 

  • Schönhage A., M. Paterson and N. Pippenger (1976), Finding the Median, Journal of Computer and System Sci. 13, 184–199.

    Article  MathSciNet  MATH  Google Scholar 

  • Tukey, J.W. (1977), Exploratory Data Analysis, Addison Wesley.

    Google Scholar 

  • Velleman P.F. (1980), Definition and Comparison of Robust Non-Linear Data Smoothing Algorithms, JASA, Vol. 75, No. 371, 609–615.

    MathSciNet  MATH  Google Scholar 

  • Velleman P.F. and D.C. Hoaglin (1980), Implementation of Some Resistant Non-Linear Smoothers, Cornell University, No.878/018, Preprint Series.

    Google Scholar 

  • Wirth, N. (1975), Algorithms and Data Structures, Prentice Hall, Englewood Cliffs.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Physica-Verlag, Vienna for IASC (International Association for Statistical Computing)

About this paper

Cite this paper

Polasek, W. (1982). An Exploratory Program Package for Non-Linear Data-Smoothers. In: Caussinus, H., Ettinger, P., Tomassone, R. (eds) COMPSTAT 1982 5th Symposium held at Toulouse 1982. Physica, Heidelberg. https://doi.org/10.1007/978-3-642-51461-6_57

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-51461-6_57

  • Publisher Name: Physica, Heidelberg

  • Print ISBN: 978-3-7051-0002-2

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics