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

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Article:Mining Association Rules in Large Database by Implementing Pipelining Technique in Partition Algorithm

by Kanhaiya Lal, N.C.Mahanti
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 2 - Number 4
Year of Publication: 2010
Authors: Kanhaiya Lal, N.C.Mahanti
10.5120/657-924

Kanhaiya Lal, N.C.Mahanti . Article:Mining Association Rules in Large Database by Implementing Pipelining Technique in Partition Algorithm. International Journal of Computer Applications. 2, 4 ( June 2010), 33-39. DOI=10.5120/657-924

@article{ 10.5120/657-924,
author = { Kanhaiya Lal, N.C.Mahanti },
title = { Article:Mining Association Rules in Large Database by Implementing Pipelining Technique in Partition Algorithm },
journal = { International Journal of Computer Applications },
issue_date = { June 2010 },
volume = { 2 },
number = { 4 },
month = { June },
year = { 2010 },
issn = { 0975-8887 },
pages = { 33-39 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume2/number4/657-924/ },
doi = { 10.5120/657-924 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:50:04.478157+05:30
%A Kanhaiya Lal
%A N.C.Mahanti
%T Article:Mining Association Rules in Large Database by Implementing Pipelining Technique in Partition Algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 2
%N 4
%P 33-39
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Mining for association rules between items in a large database of sales transactions has been described as an important database mining problem. In this paper we present an efficient algorithm for mining association rules that is faster than the previously proposed partition algorithms approximately m times where m is the number of stages in pipeline. The algorithm is also ideally suited for parallelization.

References
Index Terms

Computer Science
Information Sciences

Keywords

Association rules Partition Pipeline Parallelization

Powered by PhDFocusTM