Optimizing Business Revenue by Visualisation of Demanding Product’s Sales data and Deriving Association Rules among the Products using Data Mining

Authors

  • Prof. Pradeep N. Fale   Assistant Professor, Department of Information Technology, Priyadarshini College of Engineering, Nagpur, Maharashtra, India
  • Narendra Moundekar  Department of Information Technology, Priyadarshini College of Engineering, Nagpur, Maharashtra, India
  • Ritesh Saudagar  Department of Information Technology, Priyadarshini College of Engineering, Nagpur, Maharashtra, India
  • Prajwal Kamdi  Department of Information Technology, Priyadarshini College of Engineering, Nagpur, Maharashtra, India
  • Mrunali Rode  Department of Information Technology, Priyadarshini College of Engineering, Nagpur, Maharashtra, India
  • Janvi Borkar   Department of Information Technology, Priyadarshini College of Engineering, Nagpur, Maharashtra, India

Keywords:

Production Plan Modeling, Apriori Algorithm, Data Mining

Abstract

Because of the fierce competition in the market, everyone is busy with getting the maximum attention of people. For that producer must have products which satisfies the needs of customers. Huge scale research is going in this field. In such situations, customer requirements are very important. The value of a production plan can be modeled as a function that reflects the communication of the company with different agents, for example, customers and competitors. The issue concentrated in this system is to recognize the production plan with the maximum utility for a company, where expected number of the customers for the chosen products assesses the utility of a production plan in the plan. The solution is achieved using Apriory Algorithm in Data Mining.

References

  1. Agrawal, R., Imielinski, T., Swami, A., "Mining Association Rules between Sets of Items in Large Database", In: ACM SIGMOD International Conference on Management of Data (1993).
  2. Yao, H., Hamilton, H.J., Buzz, C. J., "A Foundational Approach to Mining Itemset Utilities from Databases", In: 4th SIAM International Conference on Data Mining, Florida USA (2004).
  3. Yao, H., Hamilton, H.J., "Mining itemset utilities from transaction databases", Data & Knowledge Engineering 59(3), 603–626 (2006).
  4. Liu, Y., Liao, W.K., Choudhary, A., "A Fast High Utility Itemsets Mining Algorithm", In: 1st Workshop on Utility-Based Data Mining, Chicago Illinois (2005).
  5. Erwin, A., Gopalan, R.P., N.R. Achuthan, "CTUMine: An Efficient High Utility Itemset Mining Algorithm Using the Pattern Growth Approach", In: IEEE CIT 2007.Aizu Wakamatsu, Japan (2007).
  6. Han, J., Wang, J., Yin, Y., "Mining frequent patterns without candidate generation", In: ACM SIGMOD International Conference on Management of Data (2000).
  7. Erwin, A., Gopalan, R.P., Achuthan, N.R, "A Bottom-Up Projection Based Algorithm for Mining High Utility Itemsets", In: International Workshop on Integrating AI and Data Mining. Gold Coast, Australia (2007).
  8. CUCIS. Center for Ultra-scale Computing and Information Security, North-western University.
  9. Yao, H., Hamilton, H.J., Geng, L., "A Unified Framework for Utility Based Measures for Mining Itemsets", In: ACM SIGKDD 2nd Workshop on Utility-Based Data Mining (2006).
  10. Pei, J., "Pattern Growth Methods for Frequent Pattern Mining", Simon Fraser University (2002).S. Zhang, C. Zhu, J. K. O. Sin, and P. K. T. Mok, "A novel ultrathin elevated channel low-temperature poly-Si TFT," IEEE Electron Device Lett., vol. 20, pp. 569–571, Nov. 1999.
  11. Sucahyo, Y.G., Gopalan, R.P., CT-PRO: "A Bottom- Up Non Recursive Frequent Itemset Mining Algorithm Using Compressed FP-Tree Data Structure", In: IEEE ICDM Workshop on Frequent Itemset Mining Implementation (FIMI), Brighton UK (2004).
  12. G. Salton, Automatic Text Processing, Addison- Wesley Publishing, 1989.
  13. J. Pei, J. Han, L.V.S. Lakshmanan, "Pushing convertible constraints in frequent itemset mining", Data Mining and Knowledge Discovery 8 (3) (2004) 227–252.
  14. Bin Chen, Peter Hass, Peter Scheuermann, "A New Two-Phase Sampling Based Algorithm for Discovering Association Rules", SIGKDD '02 Edmonton, Albetra, Canada © 2002 ACM 1 58113 567 X/02/2007.
  15. Ming-Yen lin, Tzer-Fu Tu, Sue-Chen Hsueh, "High utility pattern mining using the maximal itemset property and, lexicographic tree structures", Information Science 215(2012) 1-14.
  16. Sudip Bhattacharya, DeeptyDubey, "High utility itemset mining, International Journal of Emerging Technology and advanced Engineering", ISSN 2250-2459, Volume 2, issue 8, August 2012.
  17. Y.Liu, W.K. Liao and A. Choudhary, ―A two phase algorithm for fast discovery of high utility itemset‖, Cheng, D. and Liu. H. PAKDD, LNCS. PP: 689-695, 2005.
  18. J.Hu, A. Mojsilovic, ―High utility pattern mining: A method for discovery of high utility itemssets‖, in: pattern recognition. PP: 3317-3324, 2007.
  19. Y.-C. Li,j,-s. Yeh, and C.-C. Chang, ―Isolated Items Discarding Strategy for Discovering High Utility Itemsets,‖ Data and Knowledge engg., pp: 198-217, 2008.
  20. Liu Jian-Ping, Wang Ying Fan-Ding, ‖Incremental Mining algorithm Pre-FP in Association Rule Based on FP-tree‖, Networking and Distributed Computing, International Conference, pp: 199-203, 2010.
  21. A. Erwin, R.P. Gopalan, and N.R. Achuthan, "Efficient Mining of High Utility Itemsets from Large Datasets", T. Washio et al. (Eds.): PAKDD 2008, LNAI 5012, pp. 554–561, 2008. © Springer- Verlag Berlin Heidelberg 2008.

IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology

Downloads

Published

2022-04-30

Issue

Volume 8, Issue 2, March-April-2022

Section

Research Articles

License

Copyright (c) IJSRCSEIT

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
Prof. Pradeep N. Fale , Narendra Moundekar, Ritesh Saudagar, Prajwal Kamdi, Mrunali Rode, Janvi Borkar , " Optimizing Business Revenue by Visualisation of Demanding Product’s Sales data and Deriving Association Rules among the Products using Data Mining" International Journal of Scientific Research in Computer Science, Engineering and Information Technology(IJSRCSEIT), ISSN : 2456-3307, Volume 8, Issue 2, pp.134-142, March-April-2022.