Skip to main content
SpringerLink
Log in
SpringerLink
Log in

A Compositional Framework for Mining Longest Ranges

  • Conference paper
  • First Online:
Discovery Science (DS 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2534))

Included in the following conference series:

Abstract

This paper proposes a compositional framework for discovering interesting range information from huge databases, where a domain specific query language is provided to specify the range of interest, and a general algorithm is given to mine the range specified in this language efficiently. A wide class of longest range problems, including the intensively studied optimized support range problem [FMMT96], can be solved systematically in this framework. Experiments with real world databases show that our framework is efficient not only in theory but also in practice.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. R. Bird. The promotion and accumulation strategies in transformational programming. ACM Transactions on Programming Languages and Systems, 6(4):487–504, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  2. T. Fukuda, Y. Morimoto, S. Morishita, and T. Tokuyama. Mining optimized association rules for numeric attributes. In Proc. ACM PODS’96, pages 182–191, Montreal Quebec, Canada, 1996.

    Google Scholar 

  3. Z. Hu, W. N. Chin, and M. Takeichi. Calculating a new data mining algorithm for market basket analysis. In Proc. of PADL2000, LNCS 1753, pages 169–184, Boston, Massachusetts, January 2000. Springer-Verlag.

    Google Scholar 

  4. J. Jeuring. Theories for Algorithm Calculation. Ph.D thesis, Faculty of Science, Utrecht University, 1993.

    Google Scholar 

  5. R. Rastogi S. Brin and K. Shim. Mining optimized gain rules for numeric attributes. In Proc. of ACM KDD’99, 1999.

    Google Scholar 

  6. H. Zantema. Longest segment problems. Science of Computer Programming, 18:36–66, 1992.

    Article  MathSciNet  Google Scholar 

  7. H. Zhao, Z. Hu, and M. Takeichi. A compositional framework for mining longest ranges. Technical Report METR 02-05, Department of Mathematcical Engineering, Univ. of Tokyo, May 2002. Document is available at ftp://www.ipl.t.u-tokyo.ac.jp/~zhhy/pub/metr0205.ps.

  8. H. Zhao, Z. Hu, and M. Takeichi. Multidimensional searching trees with minimum attribute. JSSST Computer Software, 19(1):22–28, Jan. 2002.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Engineering, School of Engineering University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, 113-8656, Tokyo, Japan

    Haiyan Zhao, Zhenjiang Hu & Masato Takeichi

  2. PRESTO 21, Japan Science and Technology Corporation, Japan

    Zhenjiang Hu

Authors
  1. Haiyan Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhenjiang Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Masato Takeichi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Deutsches Forschungszentrum für Künstliche Intelligenz, Stuhlsatzenhausweg 3, 66123, Saarbrücken, Germany

    Steffen Lange

  2. National Institute of Informatics, 2-1-2 Hitotsubashi, Chiyoda-ku, 101-8430, Tokyo, Japan

    Ken Satoh

  3. Department of Computer Science, University of Maryland, College Park, 20742, Maryland, MD, USA

    Carl H. Smith

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhao, H., Hu, Z., Takeichi, M. (2002). A Compositional Framework for Mining Longest Ranges. In: Lange, S., Satoh, K., Smith, C.H. (eds) Discovery Science. DS 2002. Lecture Notes in Computer Science, vol 2534. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36182-0_42

Download citation

  • DOI: https://doi.org/10.1007/3-540-36182-0_42

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00188-1

  • Online ISBN: 978-3-540-36182-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation