NDLI: Parallel association rule mining with minimum inter-processor communication

Content Provider	IEEE Xplore Digital Library
Author	El-Hajj, M. Zaiane, O.R.
Copyright Year	2003
Description	Author affiliation: Dept. of Comput. Sci., Alberta Edmonton Univ., Canada (El-Hajj, M.; Zaiane, O.R.)
Abstract	Existing parallel association rule mining algorithms suffer from many problems when mining massive transactional datasets. One major problem is that most of the parallel algorithms for a shared nothing environment are Apriori-based algorithms. Apriori-based algorithms are proven to be not scalable due to many reasons, mainly: (1) the repetitive I/O disk scans, (2) the huge computation and communication involved during the candidacy generation. This paper proposes a new disk-based parallel association rule mining algorithm called Inverted Matrix, which achieves its efficiency by applying three new ideas. First, transactional data is converted into a new database layout called Inverted Matrix that prevents multiple scanning of the database during the mining phase, in which finding globally frequent patterns could be achieved in less than a full scan with random access. This data structure is replicated among the parallel nodes. Second, for each frequent item assigned to a parallel node, a relatively small independent tree is built summarizing co-occurrences. Finally, a simple and non-recursive mining process reduces the memory requirements as minimum candidacy generation and counting is needed, and no communication between nodes is required to generate all globally frequent patterns.
Starting Page	519
Ending Page	523
File Size	296587
Page Count	5
File Format	PDF
ISBN	0769519938
ISSN	15294188
DOI	10.1109/DEXA.2003.1232075
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2003-09-01
Publisher Place	Czech Republic
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Association rules Data mining Transaction databases Data structures Concurrent computing Matrix converters Costs Parallel algorithms Explosives Business communication
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A dichotomous algorithm for association rule mining

New algorithms for efficient mining of association rules

Parallel association rule mining based on FI-growth algorithm

Performance evaluation of distributed algorithms for mining association rules on workstation cluster

A Parallel Apriori Algorithm for Frequent Itemsets Mining

Scalable parallel data mining for association rules

A parallel algorithm for mining association rules

A New Parallel Algorithm for the Frequent Itemset Mining Problem

InterTARM: FP-tree based Framework for Mining Inter-transaction Association Rules from Stock Market Data

Parallel association rule mining with minimum inter-processor communication

Similar Documents

A dichotomous algorithm for association rule mining

New algorithms for efficient mining of association rules

Parallel association rule mining based on FI-growth algorithm

Performance evaluation of distributed algorithms for mining association rules on workstation cluster

A Parallel Apriori Algorithm for Frequent Itemsets Mining

Scalable parallel data mining for association rules

A parallel algorithm for mining association rules

A New Parallel Algorithm for the Frequent Itemset Mining Problem

InterTARM: FP-tree based Framework for Mining Inter-transaction Association Rules from Stock Market Data

Parallel association rule mining with minimum inter-processor communication