Skip to main content

Stable Distribution

  • Reference work entry
Encyclopedia of Database Systems
  • 155 Accesses

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 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Achlioptas D. Database-friendly random projections: Johnson-Lindenstrauss with binary coins.. J. Comput. Syst. Sci., 66(4):671–687, 2003.

    MATH  MathSciNet  Google Scholar 

  2. Alon N., Matias Y., and Szegedy M. The space complexity of approximating the frequency moments. In Proc. 28th Annual ACM Symp. on Theory of Computing, 1996, pp. 20–29.

    Google Scholar 

  3. Cormode G., Datar M., Indyk P., and Muthukrishnan S. Comparing data streams using hamming norms (how to zero in). In Proc. 28th Int. Conf. on Very Large Data Bases, 2002, pp. 335–345.

    Google Scholar 

  4. Datar M., Immorlica N., Indyk P., and Mirrokn V.S. Locality-sensitive hashing scheme based on p-stable distributions. In Proc. 20th Annual Symp. on Computational Geometry, 2004, pp. 253–262.

    Google Scholar 

  5. Donoho D.L. Compressed sensing. IEEE Trans. Inform. Theory, 52(4):1289–1306, 2006.

    MathSciNet  Google Scholar 

  6. Fama E.F. and Roll R. Parameter estimates for symmetric stable distributions.. J. Am. Stat. Assoc., 66(334):331–338, 1971.

    MATH  Google Scholar 

  7. Indyk P. Stable distributions, pseudorandom generators, embeddings, and data stream computation.. J. ACM, 53(3):307–323, 2006.

    MathSciNet  Google Scholar 

  8. Indyk P. and Motwani R. Approximate nearest neighbors: Towards removing the curse of dimensionality. In Proc. 30th Annual ACM Symp. on Theory of Computing, 1998, pp. 604–613.

    Google Scholar 

  9. Johnson W.B. and Lindenstrauss J. Extensions of Lipschitz mapping into Hilbert space. Contemp. Math., 26:189–206, 1984.

    MATH  MathSciNet  Google Scholar 

  10. Li P. Very sparse stable random projections for dimension reduction in l α (0 < α ≤ 2) norm. In Proc. 13th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, 2007.

    Google Scholar 

  11. Li P. Estimators and tail bounds for dimension reduction in l α (0 < α ≤ 2) using stable random projections. In Proc. 19th Annual ACM -SIAM Symp. on Discrete Algorithms, 2008.

    Google Scholar 

  12. Muthukrishnan S. Data streams: Algorithms and applications. Found. Trends Theor. Comput. Sci., 11:117–236, 2005.

    MathSciNet  Google Scholar 

  13. Samorodnitsky G. and Taqqu M.S. Stable Non-Gaussian Random Processes. Chapman & Hall, 1994.

    Google Scholar 

  14. Vempala S. The Random Projection Method. American Mathematical Society, Providence, RI, 2004.

    MATH  Google Scholar 

  15. Zolotarev V.M. One-dimensional Stable Distributions. American Mathematical Society, Providence, RI, 1986.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer Science+Business Media, LLC

About this entry

Cite this entry

Li, P. (2009). Stable Distribution. In: LIU, L., ÖZSU, M.T. (eds) Encyclopedia of Database Systems. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-39940-9_367

Download citation

Publish with us

Policies and ethics