The week's pick
Random Articles
Reseach Article
Methods for Mining Cross Level Association Rule In Taxonomy Data Structures
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 7 - Number 3 |
| Year of Publication: 2010 |
| Authors: V. Venkata Ramana, M V Rathnamma, A. Rama Mohan Reddy |
10.5120/1144-1497
|
V. Venkata Ramana, M V Rathnamma, A. Rama Mohan Reddy . Methods for Mining Cross Level Association Rule In Taxonomy Data Structures. International Journal of Computer Applications. 7, 3 ( September 2010), 28-35. DOI=10.5120/1144-1497
Abstract
Mining of association rules mainly focuses at a single conceptual level. In a large database of transaction, where each transaction consists of a set of items, and taxonomy on items, it is required to find out the associations at multiple conceptual levels. In this paper, multilevel association rule mining algorithms have been evaluated and compared. And we will discover additional strong association rules in taxonomy data items. The performance indices used for performance comparisons are minimum support threshold at different levels and varying number of transactions.
References
- R. Agrawal and R. Srikant, “Fast Algorithms for mining Association Rules”, Proceeding of the 20th VLDB Conference, Chile, Sept. 1994, Page(s): 487-499.W.-K. Chen, Linear
- Networks and Systems (Book style). Belmont, CA: Wadsworth, 1993, pp. 123–135.
- M. S. Chen, J. Han, and P. S. Yu, “Data Mining: An Overview from a Database Prespective”, IEEE Transaction on Knowledge and Data Engineering, Vol. 8, No. 4, July/Aug 1996, Page(s): 866-833.
- Charu C. Aggarwal and Philip S. Yu, “Mining Associations with the Collective Strength Approach”, IEEE Transaction on Knowledge and Data Engineering, Vol. 13, No. 6, Nov./Dec. 2001, Page(s): 863-873.
- fig Liu, Wynne Hsu and Yiming Ma, “Mining Association Rules with Multiple Minimum Support”, IEEE Transaction on Knowledge and Data Engineering, Vol 13, No. 1, Jan/Feb 2001, Page(s): 64-78.
- N. Rajkumar, M.R. Karthik and S. N. Sivananadam, “Fast Algorithm for Mining Multilevel Association Rules”, IEEE Transaction on Knowledge and Data Engineering, Vol 13, No. 1, Nov./Dec 2003, Page(s): 64-69.
- Edith Cohen, Mayur Datar and Shinji Fajiwara, “Finding Interesting Associations without support Pruning”, IEEE Transaction on Knowledge and Data Engineering, Vol 13, No. 1, Jan/Feb 2001, Page(s): 64-78.
- Charu C. Aggarwal and Philip S. Yu, “Mining Associations with the Collective Strength Approach”, IEEE Transaction on Knowledge and Data Engineering, Vol. 13, No. 6, Nov./Dec. 2001, Page(s): 863-873.
Index Terms
Keywords