Research Article
An Enhanced Method to Mine Rare Item Sets using Multiple Item Sets Support based on CP-Tree
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 119 - Issue 19 |
| Published: June 2015 |
| Authors: Acharya Isha Umeshbhai, Ankur N. Shah |
10.5120/21177-4192
|
Acharya Isha Umeshbhai, Ankur N. Shah . An Enhanced Method to Mine Rare Item Sets using Multiple Item Sets Support based on CP-Tree. International Journal of Computer Applications. 119, 19 (June 2015), 27-30. DOI=10.5120/21177-4192
@article{ 10.5120/21177-4192,
author = { Acharya Isha Umeshbhai,Ankur N. Shah },
title = { An Enhanced Method to Mine Rare Item Sets using Multiple Item Sets Support based on CP-Tree },
journal = { International Journal of Computer Applications },
year = { 2015 },
volume = { 119 },
number = { 19 },
pages = { 27-30 },
doi = { 10.5120/21177-4192 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2015
%A Acharya Isha Umeshbhai
%A Ankur N. Shah
%T An Enhanced Method to Mine Rare Item Sets using Multiple Item Sets Support based on CP-Tree%T
%J International Journal of Computer Applications
%V 119
%N 19
%P 27-30
%R 10.5120/21177-4192
%I Foundation of Computer Science (FCS), NY, USA
Abstract
Rare Association rule is an association rule consisting of rare items. Frequent Pattern (FP)-growth is an approach for utilizes the preceding knowledge providing by the user at the time of input and discovers frequent patterns with a two scan on the transactional dataset. We are presented a CP-tree (Compact-pattern tree), that capture database information with one scan (Insertion phase) and provided the same mining performance as the FP-growth method (Restructuring phase) by dynamic tree restructuring process. CP-tree can give functionalities for interactive and incremental mining with single database scan with our CP-tree outperforms in denominate of both execution time and memory requirements. Hence, we are going to present a generated MIS-tree based on CP-tree.
References
- Neelamadhab Padhy, Dr. Pragnyaben Mishra, "The Survey of Data Mining Applications and Feature Scope", DOI: 10. 5121, IJCSEIT-2012. Vol. 2, No. 3.
- R. Uday Kiran, P. Krishna Reddy, IN: DASFAA-2010,"Mining Rare Association Rules in the Datasets with Widely Varying Items' Frequencies".
- Weimin Ouyang, Qinhua Huang, Mining Direct and Indirect Association Patterns with Multiple Minimum Supports", H: IEEE-2010.
- Azadeh Soltani and M. R. Akbarzadeh, "Confabulation-Inspired Association Rule Mining for Rare and Frequent Item sets", IN: IEEE Transaction on Networks and Learning System-2014.
- Sandeep Singh Rawat, Lakshmi Rajamani,"Probability Apriori based Approach to Mine Rare Association Rule. "IN: IEEE-2011, 3RD Conference on Data Mining and Organization (DMO).
- N. Hoque, B. Nath, D. K Bhattacharyya, "A New Approach on Rare Association Rule Mining" International Journal of Computer Application (0975-8887) vol-53, no. -3. September-2010.
- R. Uday Kiran, P. Krishna Reddy, IN: IEEE-CIDM-2009,"An Improved Multiple Minimum Support Based Approach to Mine Rare Association Rules".
- M. Sinthuja, S. Sheeba Rachel and G. Janani, "MIS -Tree Algorithm for Mining Association Rules with Multiple Minimum Supports"-Binfring International Journal of Data Mining, Vol -1, December -2011
- Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed, Young-Koo Lee," CP-Tree: A Tree Structure for Single-Pass Frequent Pattern Mining" Springer-2008.
- R. Uday Kiran and Polepalli Krishna Reddy, "An Efficient Approach to Mine Rare Association Rules Using Maximum Items' Support Constraints" Springer-Verlag Berlin Heidelberg-2012.
Index Terms
Keywords