NDLI: An Efficient Algorithm for Finding All Frequent Itemsets

Content Provider	IEEE Xplore Digital Library
Author	Jian-Min Hang Fu-Zan Chen Qin Zhang
Copyright Year	2006
Description	Author affiliation: Sch. of Manage., Tianjin Univ. (Jian-Min Hang; Fu-Zan Chen)
Abstract	Frequent itemsets are crucial to many tasks in data mining. A new algorithm for finding all frequent itemsets is proposed in this paper. In data mining, the process of counting any itemset's support requires a great I/O and computing cost. An impacted bitmap technique to speed up the counting process is employed in this paper. Nevertheless, saving the intact bitmap usually has a big space requirement. In this algorithm, each bit vector is partitioned into some blocks, and hence every bit block is encoded as a shorter symbol. Therefore the original bitmap is impacted efficiently. And then the algorithm converts the origin transaction database to an adjacent-itemsets-lattice (which is a directed graph) in a preprocessing, where each itemset vertex has a label to represent its support. So we can change the complicated task of mining frequent itemsets in the database to a simpler one of searching vertexes in this structure, which can speeds up greatly the mining process. At the end experimental and analytical results are presented
Sponsorship	IEEE Syst., Man and Cybernetics Hebei Univ.
Starting Page	1092
Ending Page	1097
File Size	214267
Page Count	6
File Format	PDF
ISBN	1424400619
DOI	10.1109/ICMLC.2006.258566
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2006-08-13
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Itemsets Data mining Transaction databases Association rules Partitioning algorithms Bioinformatics Machine learning algorithms Financial management Finance Electronic mail Impacted Bitmap Adjacent-Itemsets-lattice
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

An Efficient Frequent Itemset Mining Algorithm

Effective algorithm of mining frequent itemsets for association rules

The Efficient and Complete Frequent Itemsets Mining of Association Rules

Mining Frequent Closed Itemsets in Large Databases by Hierarchical Partitioning

An Efficient Algorithm for Discovering all Frequent Patterns

An Efficient Matrix Algorithm for Mining Frequent Itemsets

A fast algorithm for mining frequent patterns

An Efficient Algorithm for Association Mining

Frequent closed itemsets lattice used in data mining

An Efficient Algorithm for Finding All Frequent Itemsets

Similar Documents

An Efficient Frequent Itemset Mining Algorithm

Effective algorithm of mining frequent itemsets for association rules

The Efficient and Complete Frequent Itemsets Mining of Association Rules

Mining Frequent Closed Itemsets in Large Databases by Hierarchical Partitioning

An Efficient Algorithm for Discovering all Frequent Patterns

An Efficient Matrix Algorithm for Mining Frequent Itemsets

A fast algorithm for mining frequent patterns

An Efficient Algorithm for Association Mining

Frequent closed itemsets lattice used in data mining

An Efficient Algorithm for Finding All Frequent Itemsets