Research Article
Mining Non-redundant Frequent Patterns in Taxonomy Datasets using Concept Lattices
|
International Journal of Applied Information Systems
Foundation of Computer Science (FCS), NY, USA
|
| Volume 3 - Issue 9 |
| Published: August 2012 |
| Authors: R. Vijaya Prakash, A. Govardhan, Ssvn Sarma |
10.5120/ijais12-450412
|
R. Vijaya Prakash, A. Govardhan, Ssvn Sarma . Mining Non-redundant Frequent Patterns in Taxonomy Datasets using Concept Lattices. International Journal of Applied Information Systems. 3, 9 (August 2012), 1-6. DOI=10.5120/ijais12-450412
@article{ 10.5120/ijais12-450412,
author = { R. Vijaya Prakash,A. Govardhan,Ssvn Sarma },
title = { Mining Non-redundant Frequent Patterns in Taxonomy Datasets using Concept Lattices },
journal = { International Journal of Applied Information Systems },
year = { 2012 },
volume = { 3 },
number = { 9 },
pages = { 1-6 },
doi = { 10.5120/ijais12-450412 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2012
%A R. Vijaya Prakash
%A A. Govardhan
%A Ssvn Sarma
%T Mining Non-redundant Frequent Patterns in Taxonomy Datasets using Concept Lattices%T
%J International Journal of Applied Information Systems
%V 3
%N 9
%P 1-6
%R 10.5120/ijais12-450412
%I Foundation of Computer Science (FCS), NY, USA
Abstract
In general frequent itemsets are generated from large data sets by applying various association rule mining algorithms, these produce many redundant frequent itemsets. In this paper we proposed a new framework for Non-redundant frequent itemset generation using closed frequent itemsets without lose of information on Taxonomy Datasets using concept lattices.
References
- Agrawal, R. , Mannila, H. , Srikant, R. , Toivonen, H. , and Inkeri Verkamo, A. 1996. "Fast discovery of association rules. In Advances in Knowledge Discovery and Data Mining", U. Fayyad et al. (Eds. ), Menlo Park, CA: AAAI Press, pp. 307–328.
- Bayardo, R. J. 1998. "Efficiently mining long patterns from databases". In ACM SIGMOD Conf. Management of Data.
- Brin, S. , Motwani, R. , Ullman, J. , and Tsur, S. 1997. "Dynamic itemset counting and implication rules for market basket data". In ACM SIGMOD Conf. Management of Data.
- Lin, D. -I. and Kedem, Z. M. "Pincer-search: A new algorithm for discovering the maximum frequent set". In IEEE Transaction on Knowledge and Data Engineering, Vol 14, Issue 3, 2002
- Agrawal, R. , Srikant, R: "Fast Algorithms for Mining Association Rules". Proc. Of the VLDB Conference (1994) 487–489, Santiago (Chile)
- Savasere, A. , Omiecinski, E. , and Navathe, S. 1995. "An efficient algorithm for mining association rules in large databases". In 21st VLDB Conf.
- D. G. Kourie, Sergei O ,B. W. Watson ,DVD Merwe "An incremental algorithm to construct a lattice of set intersections". Science of Computer Programming, Vol 74, Issue 3,2009, P 128-142.
- Toivonen, H. , Klemettinen, M. , Ronkainen, P. , H¨at¨onen, K. , and Mannila, H. 1995. "Pruning and grouping discovered association rules". In MLnet Wkshp. on Statistics, Machine Learning, and Discovery in Databases.
- Zaki, M. J. , Hsiao, C. -J. , "Efficient algorithms for mining closed itemsets and their lattice structure", IEEE Transactions on Knowledge and Data Engineering, Volume: 17 , Issue: 4 2005 , Page(s): 462 – 478
- D. W. Cheung, J. Han, V. Ng and C. Y. Wong, "Maintenance of Discovered Association Rules in Large Databases, An Incremental updating Techniques" In Proc, Intl. Conf. on Data Engineering (ICDE'96), Pages 106 – 114.
- Yonatan Aumann, Ronen Feldman, Orly Lipshtat, "Borders: An Efficient Algorithm for Association Generation in Dynamic Databases" Journal of Intelligent Information System, 12, 61 – 73 (1999).
- Lei Wen, "An efficient algorithm for mining frequent closed itemset", Fifth World Congress on Intelligent Control and Automation, (WCICA 2004). Page(s): 4296 - 4299 Vol. 5
- Pasiquir, Bastide, Y. Stemme G, & Lakhal, "Generating a Condensed Representation for Association Rule" Journal of Intellegent system 24(1), 29-60, 2005.
Index Terms
Keywords