Journal of Advances in Information Technology, Vol 2, No 4 (2011), 234-238, Nov 2011
doi:10.4304/jait.2.4.234-238

On Performance Evaluation of Mining Algorithm for Multiple-Level Association Rules based on Scale-up Characteristics

Suraj K Srivastava, Harsh K Verma, Deepti Gupta

Abstract


Various methods for mining association rules atmultiple conceptual levels focusing on different sets of dataand applying different thresholds at different levels havebeen proposed in literature. These are ML_T2L1,ML_T1LA, ML_TML1, and ML_T2LA. It has beenobserved that these algorithms show higher processing timeand processing cost as well as need large amount of memoryspace. This paper focuses on the comparative performanceevaluation of the ML_TMLA algorithm that generatesmultiple transaction tables for all levels in one database scanwith that of ML_T2L1 and ML_T1LA algorithms. Theperformance study has been conducted on different kinds ofdata distributions (three synthetic and one real dataset) andthresholds, which identify the conditions for algorithmselection. The Tool used for the experimental andcomparative evaluation of the proposed algorithm withother algorithms is the AR Tool. It has been concluded thatthe ML_TMLA algorithm performs better than all thealgorithms mentioned above.


Keywords


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

References


[1] Agrawal, R., Imielinski, T., and Swami, A., “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., May 1993.
http://dx.doi.org/10.1145/170035.170072

[2] Agrawal, R. and Srikant, R., “Fast algorithms for mining association rules”, in Proc. 1994 Int. Conf. Very Large Data Bases, pp. 487-499, Santiago, Chile, September 1994.

[3] Agrawal, R. and R Srikant, “Mining sequential patterns”, in Proc. 1995 Int. Conf. Data Engineering, pp. 3-14, Taipei, Taiwan, March 1995.
http://dx.doi.org/10.1109/ICDE.1995.380415

[4] Klemettinen, M., Mannila, H. and Ronkainen, P., Toivonen, H., and Verkamo, A. I., “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, Nov. 1994.

[5] Park, J.S., Chen, M.S. and Yu, P.S., “An effective hashbased algorithm for mining association rules”, in Proc. 1995 ACM-SIGMOD Int. Conf. Management of Data, pp. 175-186, San Jose, CA, May 1995.
http://dx.doi.org/10.1145/223784.223813

[6] Piatetsky-Shapiro, G., “Discovery, analysis, and presentation of strong rules”, in Knowledge Discovery in Databases, pp. 229-238, AAAIIMIT Press, 1991.

[7] Chaudhuri, S., and Dayal, U., “An Overview of Data Warehousing and OLAP Technology”, ACM SIGMOD Record, vol. 26, pp. 65±74, 1997.

[8] Liu, Bing, “Web Data Mining: Exploring Hyperlinks, Contents, and Usage Data”, Springer, 2007.

[9] Agrawal R., Srikant R., “Mining Generalized Association Rules”, Proc. 1995 Int'l Conf. Very Large Data Bases, pp. 407,419, Zurich, Sept. 1995.

[10] Han Jiwawei,Fu Yongjian, “Mining Multiple-Level Association Rules in Large Databases”, IEEE, 1999.

[11] Han, Jiawei and Yongjian, Fu, “Discovery of Multiple- Level Association Rules from Large Databases”, Proceedings of the 21st VLDB Conference, Zurich, Swizerland, 1995.

[12] Han, Jiawei, “Data Mining: Concepts and Techniques”, Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, ISBN 1558609016, 2005.

[13] Wasilewska Anita, “Mining Association Rules in Large Databases”, spring, 2007.


Full Text: PDF


Journal of Advances in Information Technology (JAIT, ISSN 1798-2340)

Copyright @ 2006-2012 by ACADEMY PUBLISHER – All rights reserved.