CFP last date
15 May 2024
Call for Paper
June Edition
IJAIS solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 15 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Analysis of ANN Training Algorithms for Hand Geometry-Based Access Control

Kazeem B. Adedeji Apena Waliu O. Adu Michael R.
Random Articles
Reseach Article

Mining of frequent Itemset using PAFI and Transaction Reduction Method

Published on June 2013 by Anil Vasoya, Rekha Sharma
journal_cover_thumbnail

International Conference and workshop on Advanced Computing 2013
Foundation of Computer Science USA
ICWAC - Number 3
June 2013
Authors: Anil Vasoya, Rekha Sharma
b22aceb7-0336-49f3-82e4-629de44b993b

Anil Vasoya, Rekha Sharma . Mining of frequent Itemset using PAFI and Transaction Reduction Method. International Conference and workshop on Advanced Computing 2013. ICWAC, 3 (June 2013), 0-0.

@article{
author = { Anil Vasoya, Rekha Sharma },
title = { Mining of frequent Itemset using PAFI and Transaction Reduction Method },
journal = { International Conference and workshop on Advanced Computing 2013 },
issue_date = { June 2013 },
volume = { ICWAC },
number = { 3 },
month = { June },
year = { 2013 },
issn = 2249-0868,
pages = { 0-0 },
numpages = 1,
url = { /proceedings/icwac/number3/494-1335/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Proceeding Article
%1 International Conference and workshop on Advanced Computing 2013
%A Anil Vasoya
%A Rekha Sharma
%T Mining of frequent Itemset using PAFI and Transaction Reduction Method
%J International Conference and workshop on Advanced Computing 2013
%@ 2249-0868
%V ICWAC
%N 3
%P 0-0
%D 2013
%I International Journal of Applied Information Systems
Abstract

Now a day, Mining of Association rules in large database is the challenging task. An Apriori algorithm is widely used to find out the frequent item sets from large database. But it has some limitations. It produces overfull candidates while finding the frequent item sets from transactions, i. e. the algorithm needs to scan database repetitively while finding frequent item sets. It will be inefficient in large database and also it requires more I/O load while accessing the database frequently. To solve the bottleneck of the Apriori algorithm, PAFI and Matrix based method used in proposed system.

References
  1. Agrawal R, Imielinski T, Swami A, "Mining association rules between sets of items in large databases". In: Proc. of the l993ACM on Management of Data, Washington, D. C, May 1993. 207-216
  2. D. Kerana Hanirex, Dr. M. A. Dorai Rangaswamy:" Efficient algorithm for mining frequent item sets using clustering techniques. " In International Journal on Computer Science and Engineering Vol. 3 No. 3 Mar 2011. 1028-1032
  3. Feng WANG, Yong-hua LI:"Improved apriori based on matrix",IEEE 2008, 152-155.
  4. Han Jiawei, Kamber Miceline. Fan Ming, Meng Xiaofeng translation, "Data mining concepts and technologies". Beijing: Machinery Industry Press. 2001
  5. Margatet H. Dunham. Data Mining, Introductory and Advanced Topics: Upper Saddle River, New Jersey: Pearson Education Inc. ,2003.
  6. Chen Wenwei, "Data warehouse and data mining tutorial". Beijing: Tsinghua University Press. 2006
  7. Tong Qiang, Zhou Yuanchun, Wu Kaichao, Yan Baoping, " A quantitative association rules mining algorithm". Computer engineering. 2007, 33(10):34-35
  8. Zhu Yixia, Yao Liwen, Huang Shuiyuan, Huang Longjun, " A association rules mining algorithm based on matrix and trees". Computer science. 2006, 33(7):196-198
  9. Wael A. AlZoubi, Azuraliza Abu Bakar, Khairuddin Omar," Scalable and Efficient Method for Mining Association Rules", International Conference on Electrical Engineering and Informatics 2009.
  10. Wael Ahmad AlZoubi, Khairuddin Omar, Azuraliza Abu Bakar "An Efficient Mining of Transactional Data Using Graph-based Technique",3rd Conference on Data Mining and Optimization (DMO) 2011, Selangor, Malaysia
Index Terms

Computer Science
Information Sciences

Keywords

PAFI Apriori algorithm frequent Itemset clustering AND operation affair