We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Comparative Investigations and Performance Evaluation for Multiple-Level Association Rules Mining Algorithm

by Harsh K. Verma, Deepti Gupta, Suraj Srivastava
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 4 - Number 10
Year of Publication: 2010
Authors: Harsh K. Verma, Deepti Gupta, Suraj Srivastava
10.5120/860-1208

Harsh K. Verma, Deepti Gupta, Suraj Srivastava . Comparative Investigations and Performance Evaluation for Multiple-Level Association Rules Mining Algorithm. International Journal of Computer Applications. 4, 10 ( August 2010), 40-45. DOI=10.5120/860-1208

@article{ 10.5120/860-1208,
author = { Harsh K. Verma, Deepti Gupta, Suraj Srivastava },
title = { Comparative Investigations and Performance Evaluation for Multiple-Level Association Rules Mining Algorithm },
journal = { International Journal of Computer Applications },
issue_date = { August 2010 },
volume = { 4 },
number = { 10 },
month = { August },
year = { 2010 },
issn = { 0975-8887 },
pages = { 40-45 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume4/number10/860-1208/ },
doi = { 10.5120/860-1208 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:52:46.952107+05:30
%A Harsh K. Verma
%A Deepti Gupta
%A Suraj Srivastava
%T Comparative Investigations and Performance Evaluation for Multiple-Level Association Rules Mining Algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 4
%N 10
%P 40-45
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This paper focuses on the comparative investigation and performance evaluation of the ML_TMLA algorithm that generates multiple transaction tables for all levels in one database scan with that of ML_T2L1 and ML_T1LA algorithms. The performance study has been carried out on different kinds of data distributions (three synthetic and one real dataset) and thresholds that identify the conditions for algorithm selection. The AR Tool has been used for the experimental and comparative evaluation of the proposed algorithm with other algorithms.

References
  1. Agrawal, R., Imielinski, T., and Swami, A. 1993. Mining association rules between sets of items in large databases. In Proc. 1993 ACM-SIGMOD Int. Conf. Management of Data, pp. 207-216, Washington, D.C.
  2. Agrawal, R. and Srikant, R. 1994. Fast algorithms for mining association rules. In Proc. 1994 Int. Conf. Very Large Data Bases, pp. 487-499, Santiago, Chile.
  3. Agrawal, R. and Srikant, R. 1995. Mining sequential patterns. In Proc. 1995 Int. Conf. Data Engineering, pp. 3-14, Taipei, Taiwan.
  4. Agrawal R. ,Srikant R. 1995. Mining Generalized Association Rules. Proc. 1995 Int'l Conf. Very Large Data Bases, pp. 407±419, Zurich.
  5. Chaudhuri S. ,and Dayal, U. 1997. An Overview of Data Warehousing and OLAP Technology. ACM SIGMOD Record, vol. 26, pp. 65±74.
  6. Fu Yongjian. 1996. Discovery of Multiple-Level Rules from Large Databases. Phd Thesis.
  7. Han J., Cai Y., and Cercone N. 1993. Data-Driven Discovery of Quantitative Rules in Relational Databases. IEEE Trans. Knowledge and Data Eng., vol. 5,pp. 29±40.
  8. Han Jiwawei,Fu Yongjian. 1999. Mining Multiple-Level Association Rules in Large Databases. IEEE.
  9. Han, Jiawei and Yongjian, Fu. 1995. Discovery of Multiple-Level Association Rules from Large Databases. Proceedings of the 21st VLDB Conference Zurich, Swizerland.
  10. Han, Jiawei. 2005. Data Mining: Concepts and Techniques. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, ISBN 1558609016.
  11. Klemettinen, M., Mannila, H. and Ronkainen, P., Toivonen, H., and Verkamo, A. I. 1994. Finding interesting rules from large sets of discovered association rules. In Proc. 3rd Int '1 Conf. on Information and Knowledge Management, pp. 401-408, Gaithersburg, Maryland.
  12. Liu, Bing. 2007. Web Data Mining: Exploring Hyperlinks, Contents, and Usage Data, Springer.
  13. Park, J.S., Chen, M.S. and Yu, P.S. 1995. An effective hash-based algorithm for mining association rules. In Proc. 1995 ACM-SIGMOD Int. Conf. Management of Data, pp. 175-186, San Jose, CA.
  14. Piatetsky-Shapiro, G. 1991. Discovery, analysis, and presentation of strong rules. In Knowledge Discovery in Databases, pp. 229-238, AAAIIMIT Press.
  15. Wasilewska Anita. 2007. Mining Association Rules in Large Databases.
Index Terms

Computer Science
Information Sciences

Keywords

Data mining Knowledge discovery in databases Association rules multiple-level association rules

Powered by PhDFocusTM