Skip to main content

Frequent Item-Set Mining Using Lexicographical Sequential Tree Construction on Map Reduce Framework

  • Conference paper
  • First Online:
Advances in Computational and Bio-Engineering (CBE 2019)

Abstract

Frequent itemset mining is playing an important research role for many aspirants all over the world. In all the research aspects efficiency and scalability are main retrospects which are being improved in FIM which is intensive. In the current scenario, the implementation of a sequential growth algorithm on the big data map reduce framework the lexicographic sequential tree construction for the identification of the frequent itemsets using the lexicographical order over the databases of transaction without incorporating any extreme search methodologies. The result signifies a wide variety of large database executions to prove the execution of this methodology as an efficient and improved scalability of the methodology. Further the incorporation of this technique with other pattern mining is quite beneficial on big data.

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

References

  1. R. Agrawal, R. Srikant, Mining sequential patterns, in Proceedings of the 11th International Conference on Data Engineering (ICDE95) (1995)

    Google Scholar 

  2. R. Agrawal, S. Ramakrishnan, Fast algorithms for mining association rules, in Proceedings of 20th International Conference on Very Large Data Bases, VLDB, vol. 1215 (1994)

    Google Scholar 

  3. M.J. Zaki, S. Parthasarathy, M. Ogihara, W. Li, New algorithms for fast discovery of association rules, in Proceedings of the Third International Conference on Knowledge Discovery in Databases and Data Mining (1997), pp. 283–286

    Google Scholar 

  4. D.C. Anastasiu, J. Iverson, S. Smith, G. Karypis, Big data frequent pattern mining, in Frequent Pattern Mining (Springer International Publishing, 2014), pp. 225–259

    Google Scholar 

  5. J. Dean, G. Sanjay, Map reduce: simplified data processing on large clusters. Commun. ACM 51, 107–113 (2008)

    Article  Google Scholar 

  6. C. Chen, C. Tseng, M. Chen, Highly scalable sequential pattern mining based on Map Reduce model on the cloud, in 2013 IEEE International Congress on Big Data (Big Data Congress) (IEEE, 2013)

    Google Scholar 

  7. Z. Zhang, J. Genlin, T. Mengmeng, MREclat: an algorithm for parallel mining frequent item sets, in 2013 International Conference on Advanced Cloud and BigData (CBD) (IEEE, 2013)

    Google Scholar 

  8. L. Li, M. Zhang, The strategy of mining association rule based on cloud computing, in 2011 International Conference on Business Computing and Global Informatization (BCGIN) (IEEE, 2011), pp. 475–478

    Google Scholar 

  9. N. Li, L. Zeng, Q. He, Z. Shi, Parallel implementation of apriori algorithm based on Map Reduce, in 2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel and Distributed Computing (SNPD) (IEEE, 2012)

    Google Scholar 

  10. O. Yahya, O. Hegazy, E. Ezat, An efficient implementation of Apriori algorithm based on Hadoop-Map Reduce model. Int. J. Rev. Comput. 12, 59–67 (2012)

    Google Scholar 

  11. S. Hammoud, Map Reduce network enabled algorithms for classification based on association rules. Ph.D. thesis (2011)

    Google Scholar 

  12. S. Moens, E. Aksehirli, B. Goethals, Frequent item set mining for big data, in 2013 IEEE International Conference on Big Data (IEEE, 2013), pp. 111–118

    Google Scholar 

  13. D. Huang, Y. Song, R. Routray, F. Qin, Smart cache: an optimized Map Reduce implementation of frequent item set mining. To appear in IC2E (2015)

    Google Scholar 

  14. A distributed Java-based file system for storing large volumes of data. http://hortonworks.com/hadoop/hdfs/

  15. J. Han, J. Pei, Y. Yin, Mining frequent patterns without candidate generation, in ACM SIGMOID Record, vol. 29, No. 2 (ACM, 2000)

    Google Scholar 

  16. J. Pei et al., Mining sequential patterns by pattern growth: the fixspan approach. IEEE Trans. Knowl. Data Eng. 16(11), 1424–1440 (2004)

    Article  Google Scholar 

  17. Y. Liang, S. Wu, A scalable and effective frequent item set mining algorithm for big data based on Map Reduce framework, in IEEE International Congress on Big Data (2015)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to V. Sucharita .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Venkateswara Rao, P., Srinivasa Rao, D., Sucharita, V. (2020). Frequent Item-Set Mining Using Lexicographical Sequential Tree Construction on Map Reduce Framework. In: Jyothi, S., Mamatha, D., Satapathy, S., Raju, K., Favorskaya, M. (eds) Advances in Computational and Bio-Engineering. CBE 2019. Learning and Analytics in Intelligent Systems, vol 15. Springer, Cham. https://doi.org/10.1007/978-3-030-46939-9_12

Download citation

Publish with us

Policies and ethics