Journal of Advances in Information Technology, Vol 3, No 1 (2012), 69-76, Feb 2012
doi:10.4304/jait.3.1.69-76

Discovery of Scalable Association Rules from Large Set of Multidimensional Quantitative Datasets

Tamanna Siddiqui, M Afshar Aalam, Sapna Jain

Abstract


In proposed approach, we introduce the problem of mining association rules in large relational tables containing both quantitative and categorical attributes. We have proposed an algorithm for Discovery of Scalable Association Rules from large set of multidimensional quantitative datasets using k-means clustering method based on the range of the attributes in the rules and Equi-depth partitioning using scale k-means for obtaining better association rules with high support and confidence. The discretization process is used to create intervals of values for every one of the attributes in order to generate the association rules. The result of the proposed algorithm discover association rules with high confidence and support in representing relevant patterns between project attributes using the scalable k-means .The experimental studies of proposed algorithm have been done and obtain results are quite encouraging.



Keywords


Data Mining, Association rules, k-means clustering, CBA tool, Discretization, Partitioning

References


María n. Moreno, Saddys Segrera, Vivian f. Lopez, M José polo, “A Method for Mining Quantitative Association Rules”, Proceedings of the 6th WSEAS International Conference on Simulation, Modeling and Optimization, Lisbon, Portugal, September 22-24, 2006.

Ramakrishnan Srikant, Rakesh Agrawal,”Quantitative Association Rules in Large Relational Tables”, IBM Alma den Research Center Mining, ISSN 2309-45 vol 4, pg 34-67, 2006.

Preetham Kumar, Ananthanarayana V S,” Discovery of Multi Dimensional Quantitative Closed Association Rules by Attributes Range Method”, Proceedings of the International MultiConference of Engineers and Computer Scientists 2008, Vol I IMECS 2008, pg 19-21 March, 2008, Hong Kong.

Yiping Ke James Cheng Wilfred Ng, “An Information-Theoretic Approach to Quantitative Association Rule Mining “, Department of Computer Science and Engineering The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong, ChinaIn Knowledge Discovery and Data Mining, pages 73-83, 1999. S.Prakash, R.M.S.Parvathi,”An Enhanced Scaling Apriori for Association Rule Mining Efficiency”, European Journal of Scientific Research ISSN 1450-216, Vol.39 No.2, pg.257-264,2010.

Agrawal R, Imielinski T, Swami,” A. Database Mining: A performance Perspective”, IEEE Trans. Knowledge and Data Engineering, vol. 5, 6, pg 914-925, 1993.
http://dx.doi.org/10.1109/69.250074

Agrawal R., Imielinski, T. Swami, “A. Mining associations between sets of items in large databases”, Proc. of ACM SIGMOD Int. Conference on Management of Data, Washington D.C., pg 207-216, 1993.

R.Agrawal, T. Imielinski, and A. Swami, “Mining association rules between sets of items in large databases”, In Proceedings of the Association for Computing Machinery, Special Interest Group on Management of Data (ACM-SIGMOD), pg 207-216, May 1993.

Coenen F., G. Goulbourne and P. Leng, “Tree Structures for Mining Association Rules”, Data Mining and Knowledge Discovery, pg 25-51, 2004.
http://dx.doi.org/10.1023/B:DAMI.0000005257.93780.3b

Agrawal R, T. Imielinski, and A. Swami, “Mining association rules between sets of items in large databases”, Proc. of the ACM SIGMOD Washington, D.C, pg 207-216, May 1993.

Grabmeier, J. and Rudolph, A., “Techniques of Cluster Algorithms in Data Mining”, Data Mining and Knowledge Discovery, 6, pg 303-360, 2002.
http://dx.doi.org/10.1023/A:1016308404627

Agrawal R., Imielinski T., Swami, “A. Database Mining: A performance Perspective “, IEEE Trans. Knowledge and Data Engineering, vol. 5, pg. 914-925, 1993.
http://dx.doi.org/10.1109/69.250074

Huang, Y.F., Wu, C.M, “Mining Generalized Association Rules Using Pruning Techniques”, Proceedings of the IEEE International Conference on Data Mining (ICDM'02), Japan, pg 227-234, 2002.

Imielinski T., A. Virmani and A. Abdulghani, “ Application Programming Interface and Query Language for Database Mining”, Proceedings ACM International Conference Knowledge Discovery & Data Mining, ACM Press, pg 256-261, 1996.

Han J., Y. Cai, and N Cercone,”Data Driven Discovery of Quantitative Rules in Relational Databases”, IEEE Trans Knowledge and Data Eng, Vol 5, pg 29-40, 1993.
http://dx.doi.org/10.1109/69.204089

R. Agrawal and R. Srikant, “Fast algorithms for mining association rules”, In Proceedings of the 20th International Conference on Very Large Databases (VLDB), IIEEE, pages 290-297, 2002.

Yu Wei, “Approximation to K-means-type Clustering”, In Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, pg 306-315, 2003.

Rakesh Agrawal, Ramakrishnan Srikant, “Algorithms for mining association rules in large databases”, Proceedings of the 20th VLDB Conference Santiago, Chile, Vol -2, pg 141-182,1995.

R. Agrawal and R. Srikant, “Mining sequential patterns” Proc. of 20th International Conference on Very Large Databases, Santiago de Chile, pg 487-489, 1994.

Amir Netz, Surajit Chaudhuri, Jeff Bernhardt, Usama Fayyad,” Integration of Data Mining and Relational Databases “, Proceedings of the 26th International Conference on Very Large Databases, Cairo, Egypt, 2000.

R. Srikant and R. Agarwal, “Mining quantitative association rules in large relational tables “, In Proceedings of the Association for Computing Machinery, Special Interest Group on Management of Data, pg 1-12,1996.

Agarwal R. and V. Prasad, “A Tree Projection Algorithm for Generation of Frequent Itemsets,”Parallel and Distributed Computing, 2000.

Harish Verma, Eatesh Kandpal, Bipul Pandey, Joydip Dhar, “A Novel Document Clustering Algorithm Using Squared Distance Optimization Through Genetic Algorithms “, International Journal on Computer Science and Engineering Vol. 02, No. 05, pg 1875-1879, 2010.

Heikki Mannila, Harmu Toivonen, and A. Inkeri Verkamo, “Efficient algorithms for discovering association rules”, AAAI Workshop on Knowledge Discovery in Databases, pg 181- 192, Seattle, Washington, July 1994.

Jong Soo, Park, Ming Syan Chen, and Philip S.Yu, “An effective hash based algorithm for mining association rules”, Proceedings of the ACM-SIGMOD Conference on Management of Data, San Jose, California, May 1995.

Agrawal R., Imielinski T., Swami A., “Mining associations between sets of items in large databases”, Proceedings of ACM SIGMOD International Conference on Management of Data, Washington D.C., pg 207-216, 1993.


Full Text: PDF


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

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