Skip to main content

A Traditional Analysis for Efficient Data Mining with Integrated Association Mining into Regression Techniques

  • Conference paper
  • First Online:
ICCCE 2020

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

Abstract

A Wal-Mart salesman was trying to surge the sales data of the store by combining the commodities together and putting discounts on those products. The goods are clearly distinct thus he found that nurturing kids is exhausting. And to release pain, guardian decided to buy beer. Data Mining, also known as KDD, to find irregularities, associations, arrangements, and tendencies to forecast consequences. Apriori algorithm is a standard process in data mining. It is utilised for mining recurrent sets of items and related association rubrics. It is formulated to work on a database comprising of a lot of transactions. It is very vital for operative Market Basket Investigation and this assistance the patrons in buying their substances with more effortlessness which escalates the sales of the markets. While finding goods to be associated together, it is imperative to have some association on which the commodities can be listed together. In this research work a hybrid method has been proposed to attenuate association rules using optimization algorithm Differential Evolution with Apriori Algorithm. Firstly, Apriori algorithm is applied to get frequent itemsets and association rules. Then, AMO is employed to scale back the amount of association rules with a brand new fitness function that comes with frequent rules. it’s observed from the experiments that, as compared with the opposite relevant techniques, ARMAMO greatly reduce the computational time for frequent item set generation, memory for association rule generation, and also the number of rules generated. Data mining could be a process that uses a spread of information analysis tools to find patterns and relationships in data which will be accustomed make valid predictions. Association rule is one in every of the favored techniques used for mining data for pattern discovery is that the KDD. Rule mining is a very important component of information mining. to seek out regularities/patterns in data, the foremost effective class is association rule mining. Mining has been utilized in many application domains. during this paper, an efficient mining based algorithm for rule generation is presented.

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 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Han J, Kamber M (2001) Data mining concepts and techniques. Morgan Kaufmann Publishers, San Francisco. ISBN 1558604898

    Google Scholar 

  2. Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proceedings of VLDB 1994, Santiago, Chile, pp 487–499, September 1994

    Google Scholar 

  3. Vaidya J, Clifton C (2002) Privacy preserving association rule mining in vertically partitioned data. In: Proceedings of conference knowledge discovery and data mining, pp 639–644, July 2002

    Google Scholar 

  4. Shah K, Thakkar A, Ganatra A (2012) Association rule hiding by heuristic approach to reduce side effects & hide multiple R.H.S. items. Int J Comput Appl (0975–8887) 45(1):1–7

    Google Scholar 

  5. Hatefi E, Mirzaei A, Safayani M (2014) Privacy preserving quantitative association rule mining using convex optimization technique. In: 2014 7th international symposium on telecommunications (IST 2014)

    Google Scholar 

  6. Sirole T, Choudhary J (2014) A survey of various methodologies for hiding sensitive association rules. Int J Comput Appl (0975–8887) 96(18):12–15

    Google Scholar 

  7. Chaudari M, Varmora J (2016) Advance privacy preserving in association rule mining. In: IEEE conference (ICEEOT) 2016

    Google Scholar 

  8. Singh T, Sethi M (2015) Sandwich-apriori: a combine approach of apriori and reverse-apriori. In: 2015 annual IEEE India conference (INDICON)

    Google Scholar 

  9. Li Z-C, He P-L, Lei M (2005) A high efficient AprioriTid algorithm for mining association rule. In: 2005 international conference on machine learning and cybernetics, vol 3, pp 1812–1815

    Google Scholar 

  10. Chadokar SK, Singh D, Singh A (2013) Optimizing network traffic by generating association rules using hybrid apriori-genetic algorithm In: 2013 tenth international conference on wireless and optical communications networks (WOCN), pp 1–5

    Google Scholar 

  11. Manjitkaur UG (2014) ECLAT algorithm for frequent itemsets generation. Int J Comput Syst 01(03):82–84 (ISSN: 2394-1065)

    Google Scholar 

  12. Li M, Wang C, Yan Y (2010) The research of FPGrowth method based on apriori algorithm in MDSS. In: 2010 international conference on digital manufacturing and automation (ICDMA), vol 2, pp 770–773

    Google Scholar 

  13. Sunita BA, Lobo LMRJ (2012) A comparative study of association rule algorithms for course recommender system in e-learning. Int J Comput Appl (0975–8887) 39(1):48–52

    Google Scholar 

  14. Harman R (1995) A very brief introduction to particle swarm optimization

    Google Scholar 

  15. Agarwal R, Imielinski T, Swami A (1993) Mining association rules between stes of items in large databases. In: SIGMOD 1993 proceedings of management of data

    Google Scholar 

  16. Gkoulalas-Divanis A, Verykios VS (2006) An inter programming approach for frequent itemset hiding (CIKM 2006)

    Google Scholar 

  17. Guo Y (2007) Reconstruction-based association rule hiding. In: IDAR-workshop on innovative database research

    Google Scholar 

  18. Kapil S, Chawla M, Ansari MD. (2016) On K-means data clustering algorithm with genetic algorithm. In: 2016 fourth international conference on parallel, distributed and grid computing (PDGC), December 2016, pp 202–206. IEEE

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to G. SuryaNarayana .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

SuryaNarayana, G., Kolli, K., Ansari, M.D., Gunjan, V.K. (2021). A Traditional Analysis for Efficient Data Mining with Integrated Association Mining into Regression Techniques. In: Kumar, A., Mozar, S. (eds) ICCCE 2020. Lecture Notes in Electrical Engineering, vol 698. Springer, Singapore. https://doi.org/10.1007/978-981-15-7961-5_127

Download citation

  • DOI: https://doi.org/10.1007/978-981-15-7961-5_127

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-15-7960-8

  • Online ISBN: 978-981-15-7961-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics