Association Rule Discovery in Data Mining by Implementing Principal Component Analysis
This paper presents the Principal Component Analysis (PCA) which is integrated in the proposed architectural model and the utilization of apriori algorithm for association rule discovery. The scope of this study includes techniques such as the use of devised data reduction technique and the deployment of association rule algorithm in data mining to efficiently process and generate association patterns. The evaluation shows that interesting association rules were generated based on the approximated data which was the result of dimensionality reduction, thus, implied rigorous and faster computation than the usual approach. This is attributed to the PCA method which reduces the dimensionality of the original data prior to the processing. Furthermore, the proposed model had verified the premise that it could handle sparse information and suitable for data of high dimensionality as compared to other technique such as the wavelet transform.
KeywordsData Mining Association Rule Frequent Itemsets Data Cube Data Mining Algorithm
Unable to display preview. Download preview PDF.
- 1.Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Proc. of International Conference on Very Large Databases VLDB, pp. 487–499 (1994)Google Scholar
- 2.Han, J., Kamber, M.: Data mining concepts & techniques. Morgan Kaufmann, USA (2001)Google Scholar
- 3.Hellerstein, J.L., Ma, S., Perng, C.S.: Discovering actionable patterns in event data. IBM Systems Journal 41(3) (2002)Google Scholar
- 4.Multi-Dimensional Constrained Gradient Mining, ftp://fas.sfu.ca/pub/cs/theses/2001/JoyceManWingLamMSc.pdf
- 5.Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proc. of ACM SIGMOD International Conference on Mngt. of Data (1993)Google Scholar
- 6.Chen, B., Haas, P., Scheuermann, P.: A new two-phase sampling based algorithm for discovering association rules. In: Proceedings of ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (2002)Google Scholar
- 7.Bronnimann, H., Chen, B., Dash, M., Hass, P., Qiao, Y., Scheuermann, P.: Efficient Data-Reduction Methods for On-Line Association Rule Discovery. In: Data Mining: Next Generation Challenges & Future Directions (2004) (in press)Google Scholar
- 8.Margaritis, D., Faloutsos, C., Thrun, S.: NetCube: A Scalable Tool for Fast Data Mining and Compression. In: 27th Conference on Very Large Databases (VLDB) Roma, Italy (September 2001)Google Scholar
- 9.Korn, F., Labrinidis, A., Kotidis, Y., Faloutsos, C., Kaplunovich, A., Perkovic, D.: Quantifiable Data Mining Using Principal Component Analysis Technical Report, University of Maryland, College Park, Number CS-TR-3754 (February 1997)Google Scholar
- 10.Han, E.H., Karypis, G., Kumar, V., Mobasher, B.: Clustering in a high-dimensional space using hypergraph models (1998), Available at, http://www.informatik.uni-siegen.de/~galeas/papers/general/Clustering_in_a_High-Dimensional_Space_Using_Hypergraphs_Models_%28Han1997b%29.pdf
- 12.Principal Component Analysis, http://www.unesco.org/webworld/idams/advguide/Chapt6_2.htm