Skip to main content

Using MapReduce Framework for Mining Association Rules

  • Conference paper
Information Technology Convergence

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 253))

Abstract

Data mining in knowledge discovery helps people discover unknown patterns from the collected data. PIETM (Principle of Inclusion–Exclusion and Transaction Mapping) algorithmis a novel frequent item sets mining algorithm, which scans database twice. To cope with big transaction database in the cloud, this paper proposes a method that parallelizes PIETM by the MapReduce framework. The method has three modules. Module I counts the supports of frequent 1-item sets. Module II constructs transaction interval lists. Module III discovers all the frequent item sets iteratively.

This research is supported in part by NSC in Taiwan under Grant No. NSC-101-2221-E-025-014.

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 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover 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

Similar content being viewed by others

References

  1. Han J, Kamber M, Pei J (2011) Data mining: concepts and techniques. Morgan Kaufmann, San Francisco

    Google Scholar 

  2. Agrawal R, Srikant R (1994) Fast algorithm for mining association rules in large database. In: Bocca JB, Jarke, M, Zaniolo C (eds.) VLDB’94. In: Proceeding of the 20th international conference on VLDB. pp 487–499, Santiago

    Google Scholar 

  3. Agrawal R, Imielinski T, Swami A (1993) Mining association rules between sets of items in large databases, In: the ACM SIGMOD conference on management of data, pp 207–216

    Google Scholar 

  4. Lin KC, Liao IE, Lin SF, Chang TP. A frequent itemset mining algorithm base on the inclusion–exclusion principle and transaction mapping. information. Science. accepted with minor revision

    Google Scholar 

  5. Liu CL (1968) Introduction to combinatorial mathematics. McGraw-Hill, New York

    Google Scholar 

  6. Dean J, Ghemawat S (2004) MapReduce: simplied data processing on large clusters. In: In Proceedings of the 6th symposium on operating systems design and implementation (OSDI), pp 137–150

    Google Scholar 

  7. Apache hadoop. http://hadoop.apache.org

  8. Song M, Rajasekaran S (2006) A transaction mapping algorithm for frequent itemsets mining. in. IEEE Trans Knowl Data Eng 18(4):472–481

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Shih-Ying Chen .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media Dordrecht

About this paper

Cite this paper

Chen, SY., Li, JH., Lin, KC., Chen, HM., Chen, TS. (2013). Using MapReduce Framework for Mining Association Rules. In: Park, J.J., Barolli, L., Xhafa, F., Jeong, H.Y. (eds) Information Technology Convergence. Lecture Notes in Electrical Engineering, vol 253. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-6996-0_76

Download citation

  • DOI: https://doi.org/10.1007/978-94-007-6996-0_76

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-007-6995-3

  • Online ISBN: 978-94-007-6996-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics