Skip to main content
SpringerLink
Log in

An Optimization of Apriori Algorithm through the Usage of Parallel I/O and Hints

  • Conference paper
  • First Online:
Rough Sets and Current Trends in Computing (RSCTC 2002)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2475))

Included in the following conference series:

Abstract

Association rules are very useful and interesting patterns in many data mining scenarios. Apriori algorithm is the best-known association rule algorithm. This algorithm interacts with a storage system in order to access input data and output the results. This paper shows how to optimize this algorithm adapting the underlying storage system to this problem through the usage of hints and parallel features.

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 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.

References

  1. Christian Borgelt’s Homepage http://fuzzy.cs.uni-magdeburg.de/borgelt .

  2. Maria S. Perez et al. A New MultiAgent Based Architecture for High Performance I/O in clusters. In Proceedings of the 2nd International Workshop on MSA’01, 2001.

    Google Scholar 

  3. Maria S. Perez et al. A Proposal for I/O Access Profiles in Parallel Data Mining Algorithms. In 3rd ACIS International Conference on SNPD’02, June 2002.

    Google Scholar 

  4. Rakesh Agrawal et al. Mining Association Rules between Sets of Items in Large Databases. In The ACM SIGMOD International Conference on Management of Data, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DATSI. FI. Universidad Politécnica de Madrid, Spain

    Marίa S. Pérez, Ramón A. Pons & Marίa L. Córdoba

  2. Departamento de Informática, Universidad Carlos III de Madrid, Spain

    Félix Garcίa & Jesús Carretero

Authors
  1. Marίa S. Pérez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ramón A. Pons
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Félix Garcίa
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jesús Carretero
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Marίa L. Córdoba
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Penn State Great Valley School of Professional Graduate Studies, 30 East Swedesford Road, Malvern, PA, 19355, USA

    James J. Alpigini

  2. Department of Electrical and Computer Engineering, University of Manitoba, Winnipeg, MB, R3T 5V6, Canada

    James F. Peters

  3. Institute of Mathematics, Warsaw University, Banacha 2, 02-097, Warsaw, Poland

    Andrzej Skowron

  4. Department of Systems and Information Engineering, Maebashi Institute of Technology, 460-1 Kamisadori-Cho, Maebashi-City, 371-0816, Japan

    Ning Zhong

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pérez, M.S., Pons, R.A., Garcίa, F., Carretero, J., Córdoba, M.L. (2002). An Optimization of Apriori Algorithm through the Usage of Parallel I/O and Hints. In: Alpigini, J.J., Peters, J.F., Skowron, A., Zhong, N. (eds) Rough Sets and Current Trends in Computing. RSCTC 2002. Lecture Notes in Computer Science(), vol 2475. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45813-1_59

Download citation

  • DOI: https://doi.org/10.1007/3-540-45813-1_59

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44274-5

  • Online ISBN: 978-3-540-45813-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation