Open Access Open Access  Restricted Access Subscription or Fee Access

Association Rule Mining-the Effective Data Mining Technique for Exploring Large Databases

Biswaranjan Nayak, Dr. Prasant Ku. Pattnaik, Srinivas Prasad

Abstract


The basic purpose of association rule mining is to explore large databases for association rules. In this paper we have discussed about the effectiveness and importance of association rule mining that helps in decision making process and how the efficiency of association rule algorithms in data mining can be enhanced. Also advanced association rule mining techniques used in recent times have been emphasized in this paper. This paper, we hope definitely help to know about association rule mining in a broader sense.

Keywords


Association Rule Mining, Confidence, Data Mining, Support.

Full Text:

PDF

References


P. Velvadivu, Dr. K. Duraisamy, An optimized weighted association rule mining on dynamic content. IJCSI International Journal of Computer Science Issues, Vol. 7, Issue 2, No 5, March 2010.

Anandhavalli M.*, Suraj Kumar Sudhanshu, Ayush Kumar and Ghose M.K. Optimized association rule mining using genetic algorithm. Advances in Information Mining, ISSN: 0975–3265, Volume 1, Issue 2, 2009, pp-01-04.

Stuart J. Russell, Peter Norvig (2008), Artificial Intelligence: A Modern Approach.

Kotsiantis, S., & Kanellopoulos, R. (2006). Association Rules Mining: A Recent Overview. GESTS International Transactions on Computer Science and Engineering, 32(1), 71-82.

Chuang, K., Chen, M., Yang, W., Progressive Sampling for Association Rules Based on Sampling Error Estimation, Lecture Notes in Computer Science, Volume 3518, Jun 2005, Pages 505 – 515.

Tseng, M., Lin, W., Jeng, R., Maintenance of Generalized Association Rules Under Transaction Update and Taxonomy Evolution, Lecture Notes in Computer Science, Volume 3589, Sep 2005, Pages 336 – 345.

Ashrafi, M., Taniar, D., Smith, K., Redundant Association Rules Reduction Techniques, Lecture Notes in Computer Science, Volume 3809, 2005, pp. 254 – 263.

Sharma, L.K., Vyas, O.P., Tiwary, U.S., Vyas, R. A Novel Approach of Multilevel Positive and Negative Association Rule Mining for Spatial Databases, Lecture Notes in Computer Science, Volume 3587, Jul 2005, Pages 620 – 629.

Ashrafi, M., Taniar, D. Smith, K. A New Approach of Eliminating Redundant Association Rules, Lecture Notes in Computer Science, Volume 3180, 2004, Pages 465 – 474.

Tien Dung Do, Siu Cheung Hui, Alvis Fong, Mining Frequent Itemsets with Category- Based Constraints, Lecture Notes in Computer Science, Volume 2843, 2003, pp. 76 – 86.

Jaroszewicz, S., Simovici, D., Pruning Redundant Association Rules Using Maximum Entropy Principle, Lecture Notes in Computer Science, Volume 2336, Jan 2002, pp 135-142.

Wojciechowski, M., Zakrzewicz, M., Dataset Filtering Techniques in Constraint-Based Frequent Pattern Mining, Lecture Notes in Computer Science, Volume 2447, 2002, pp.77-83.

Parthasarathy, S., Efficient Progressive Sampling for Association Rules. ICDM 2002:354-361.

Agarwal, R. Aggarwal, C. and Prasad V., A tree projection algorithm for generation of frequent itemsets. In J. Parallel and Distributed Computing, 2000.

P. Shenoy, J. Haritsa, S. Sudarshan, G. Bhalotia, M. Bawa, and D. Shah. Turbo-charging vertical mining of large databases. In Proc. Of ACM SIGMOD Intl. Conf. on Management of Data, May 2000.

J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proc. Of ACM SIGMOD Intl. Conf. on Management of Data, May 2000.

Zaki, M. J., Parallel and distributed association mining: A survey. IEEE Concurrency, Special Issue on Parallel Mechanisms for Data Mining, 7(4):14--25, December 1999.

C. Hidber. Online association rule mining. In Proc. Of ACM SIGMOD Intl. Conf. on Management of Data, June 1999.

S Lawrence, C Lee Giles. Accessibility of Information on the Web [J].1999, 403:107-109.

M. J. Zaki and M. Ogihara. Theoretical foundations of association rules. In 3rd ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, June 1998.

D. Gunopulos, H. Mannila, and S. Saluja. Discovering all the most specific sentences by randomized algorithms. In Intl. Conf. on Database Theory, January 1997.

M. J. Zaki, S. Parthasarathy, M. Ogihara, and W. Li. New algorithms for fast discovery of association rules. In Proc. Of Intl. conf. on Knowledge Discovery and Data Mining (KDD), August 1997.

S. Brin, R. Motwani, J. Ulman, and S. Tsur, Dynamic itemset counting implication rules for market basket data. In Proc. Of ACM SIGMOD Intl. Conf. on Management of Data, May 1997.

Cheung, D., Han, J., Ng, V., Fu, A. and Fu, Y. (1996), A fast distributed algorithm for mining association rules, in `Proc. of 1996 Int'l. Conf. on Parallel and Distributed Information Systems', Miami Beach, Florida, pp. 31 – 44.

H. Toivonen. Sampling large databases for association rules. In Proc. Of Intl. Conf. on very Large Databases ((VLDB), 1996.

R. Agrawal and R. Srikant. Fast Algorithms for mining Association rules. In Proc. Of Intl. Conf. on Very Large Databases (VLDB), September 1994.

Agrawal, R., Imielinski, T., and Swami, A. N. 1993. Mining association rules between sets of items in large databases. In Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, 207-211.


Refbacks

  • There are currently no refbacks.


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