Data Mining Tools for Generate Item Set : Critical Review

Authors

  • S V Subramanyam  Professor, Department of Artificial Intelligence and Machine Learning, School of Engineering, Mallareddy University, Hyderabad, Telangana, India

DOI:

https://doi.org//10.32628/CSEIT2390210

Keywords:

KDD, WWW, CAR, CHAID, AIS

Abstract

Most algorithms used to identify large itemsets can be classified as either sequential or parallel. In most cases, it is assumed that the itemsets are identified and stored in lexicographic order (based on item name). This ordering provides a logical manner in which itemsets can be generated and counted. This is the normal approach with sequential algorithms. On the other hand, parallel algorithms focus on how to parallelize the task of finding large itemsets. Mining Associations is one of the techniques involved in the process mentioned in chapter 1 and among the data mining problems it might be the most studied ones. Discovering association rules is at the heart of data mining. Mining for association rules between items in large database of sales transactions has been recognized as an important area of database research. These rules can be effectively used to uncover unknown relationships, producing results that can provide a basis for forecasting and decision making. Today, research work on association rules is motivated by an extensive range of application areas, such as banking, manufacturing, health care, and telecommunications. It is also used for building statistical thesaurus from the text databases, finding web access patterns from web log files, and also discovering associated images from huge sized image databases.

References

  1. Hassan M. Najadat, Mohammed Al-Maolegi, Bassam Arkok, “An Improved Apriori Algorithm for Association Rules”, International Research Journal of Computer Science and Application Vol. 1, No. 1, June 2013, PP: 01 – 08.
  2. H.Toivonen, “Sampling large databases for association rules”. In Proc. 2006 Int. Conf. Very Large Data Bases(VLDB'06),pages 134-145, Bombay, India, Sep.2006.
  3. Hu Ji-ming, Xian Xue-feng. “ The Research and Improvement of Apriori for association rules mining”,
  4. Computer Technology and Development 2006 16(4) pp. 99-104.
  5. Jiao Yabing, “Research of an Improved Apriori Algorithm in Data Mining Association Rules”, International
  6. Journal of Computer and Communication Engineering, Vol. 2, No. 1, January 2013.
  7. J. Han and M. Kamber. Data Mining: Concepts and Techniques. Morgan Kaufmann, 2000.
  8. Jaishree Singh, Hari Ram, Dr. J.S. Sodhi, “Improving Efficiency of Apriori Algorithm Using Transaction Reduction ”, International Journal of Scientific and Research Publications, Volume 3, Issue 1, January 2013.
  9. Li Qingzhong , Wang Haiyang, Yan Zhongmin, “Efficient mining of association rules by reducing the number of passes over the database”, Computer Science and Technology, 2008, pp. 182-188.
  10. L. Klemetinen, H. Mannila, P. Ronkainen, et al. (1994) “Finding interesting rules from large sets of discovered association rules”. Third International Conference on Information and Knowledge Management pp. 401-407.Gaithersburg, USA.
  11. Li Yang, Mustafa Sanver; Mining Short Association Rules with One Database Scan; Int'l Conf. on Information and Knowledge Engineering; June 2004.
  12. Mohammed M. Mazid, A.B.M. Shawkat Ali and Kevin S. Tickle(2008), “Finding a Unique Association Rule Mining Algorithm Based on Data Characteristics”, 5th International Conference on Electrical and computer science deptt.

Downloads

Published

2023-04-30

Issue

Section

Research Articles

How to Cite

[1]
S V Subramanyam, " Data Mining Tools for Generate Item Set : Critical Review, IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology(IJSRCSEIT), ISSN : 2456-3307, Volume 9, Issue 2, pp.176-183, March-April-2023. Available at doi : https://doi.org/10.32628/CSEIT2390210