Open Access Open Access  Restricted Access Subscription or Fee Access

A Novel Approach for Mining High Dimensional Association Rules Using Frequent K-Dimension Set

K. Prasanna, Dr.M. Seetha, M. Sankara Prasanna Kumar


Association rule mining aims at generating association rules between sets of items in a database. Now a day, due to huge accumulation in the database technology and incredible growth in high dimensional dataset, conventional data base methods are inadequate in extracting useful information. Such large high dimensional data gives rise to a number of new computational challenges not only the increased in number of data objects but also in the increased in number of features/attributes. However, it is becoming very tedious to generate association rules from high dimensional data, because it contains different dimensions or attributes in the large data bases. To improve the high dimensional data mining task, it must be preprocessed efficiently and accurately. In this paper, an Apriori based method for generating association rules from large high dimensional data is proposed. It constitutes 1) Preprocessing and generalizing the data base dimensions; 2) generating high dimensional strong association rules using support and confidence. It can be seen from experiments that the mining algorithm is elegant and efficient, which can obtain more rapid computing speed and sententious rules at the same time It was ascertained that the proposed method is proved to be better in support of generating association rules.


Association Analysis, Apriori Algorithm, Pre Processing, High Dimensional Data, Support, Confidence, Data Mining.

Full Text:



Rakesh Agrawal, Tomasz Imielinski and Arun Swami,” Mining association rules between sets of items in large data bases”, in proceedings of the ACM SIGMOD Conference on Management of Data, pp 207-216, Washington, D.C., May 1993.

Bodon, F., “A Fast Apriori Implementation”, In the proceedings of FIMI‟03, November 2003.

Rakesh Agrawal, Tomasz Imielinski and Arun Swami,” Data base Mining- A performance perspective”, In the proceedings IEEE transactions on knowledge and data engineering, vol 5 1993.

K.Prasanna, Dr. M.Seetha ,“Association rule mining algorithms for high dimensional data- A review”, in the proceedings of IJAET,Vol 2 Issue 1, pp 443-454, 2012.

M J Zaki and C J Hsiao,” CHARM- an Efficient algorithm for closed itemset mining``, in the proceedings of SDM 2002, p 457-473., 2002

Aggrawal, C.C., Hinnwburg, A., and Keim, D.A. “On the surprising behavior of distance metrics in high dimensional space”. IBM Research report, RC 21739, 2000.

Beyer K., Goldstein, J.Ramakrishnan, R., and Shaft, U. “When is nearest neighbor meaningful?” In Proceedings of the 7th International Conference ICDT, Jerusalem, Israel. 1999.

Beyer K and Ramakrishnan. “Bottom-up computation of sparse and iceberg cubes”. In: Proceeding of the ACM-SIGMOD 1999 International Conference on Management of Data (SIGMOD‟99)”, Philadelphia, PA, pp 359–370, 1999.

Mardia.K, Kent, J and Bibby.J.”Multivariate Analysis”. Academic Press, San Diego, CA, 1980.

McCullum. A., Nigam, K., and Ungar, L.H.” Efficient clustering of high dimensional data sets with application to reference matching”. In proceedings of the 6th ACM SIGKDD, 167-178, Boston., MA, 2000.

Anjana Pandey and KamalRaj Pardasani “Rough Set Model for Discovering Multidimensional Association Rules “ in the proceedings of IJCSNS, 2009.

Rama kirshna Srikant, Rakesh agrawal ,” Mining quantitative association ures in large relational tables”, in the proceedings of ACM SIGMOD , USA 1996.

Agrawal, R. and Srikant,R. 1994. Fast algorithms for mining association rules. In Proceedings of International Conference on Very Lar ge Data Bases (VLDB 94), p p .487-499.


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.