NDLI: Using rule-free sets to find frequent itemsets

Content Provider	IEEE Xplore Digital Library
Author	Dong Zhao Yan-Sheng Lu Tao Wang Ai-Hua Yin
Copyright Year	2003
Description	Author affiliation: Coll. of Comput. Sci. & Technol., Huazhong Univ. of Sci. & Technol., China (Dong Zhao; Yan-Sheng Lu; Tao Wang; Ai-Hua Yin)
Abstract	Given a large set of data, extracting frequent itemsets in this set is a challenging job in data mining. Many efficient algorithms have been proposed in the literature. The idea presented in this paper is to extract a condensed representation of the frequent itemsets called rule-free sets, instead of extracting the whole frequent itemsets collection. We show that this condensed representation can be applied to regenerate all frequent itemsets and their exact frequencies without any access to the original data. An algorithm, RFS-MINER, is presented to extract the frequent rule-free sets and practical experiments show that this representation can be extracted very efficiently. We compared it with another representation in the literature called frequent closed sets and in nearly all experiments we have run, the rule free sets have been extracted much more efficiently than frequently closed sets.
Sponsorship	IEEE Systems Man and Cybernetics Tech. Committee on Cybernetics, Hebei Univ. Northwestern Polytechnical Univ
Starting Page	18
Ending Page	22
File Size	455484
Page Count	5
File Format	PDF
ISBN	0780381319
DOI	10.1109/ICMLC.2003.1264434
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2003-11-05
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Itemsets Data mining Artificial intelligence Frequency Databases Educational institutions Computer science Electronic mail Costs
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

Association rule mining: A graph based approach for mining frequent itemsets

Using closed frequent sets to cluster malwares

An Improved Top-Down Data Mining Algorithm for Long Frequents

Mining Maximal Frequent Itemsets with Frequent Pattern List

GLFMiner: Global and local frequent pattern mining with temporal intervals

Mining Short Association Rules from Large Database

Find Recent Frequent Items with Sliding Windows in Data Streams

Mining Maximum Length Frequent Itemsets: A Summary of Results

Efficiently mining maximal frequent sets for discovering association rules

Using rule-free sets to find frequent itemsets

Similar Documents

Association rule mining: A graph based approach for mining frequent itemsets

Using closed frequent sets to cluster malwares

An Improved Top-Down Data Mining Algorithm for Long Frequents

Mining Maximal Frequent Itemsets with Frequent Pattern List

GLFMiner: Global and local frequent pattern mining with temporal intervals

Mining Short Association Rules from Large Database

Find Recent Frequent Items with Sliding Windows in Data Streams

Mining Maximum Length Frequent Itemsets: A Summary of Results

Efficiently mining maximal frequent sets for discovering association rules

Using rule-free sets to find frequent itemsets