NDLI: A novel technique for mining closed frequent itemsets using variable sliding window

Content Provider	IEEE Xplore Digital Library
Author	Kumar, V. Satapathy, S.R.
Copyright Year	2014
Description	Author affiliation: Dept. of Comput. Sci. & Eng., Ajay Kumar Garg Eng. Coll., Ghaziabad, India (Kumar, V.; Satapathy, S.R.)
Abstract	Frequent itemset mining over dynamic data is an important problem in the context of knowledge discovery and data mining. Various data stream models are being used for mining frequent itemsets. In a data stream model the data arrive at high speed such that the algorithms used for mining data streams must process them in strict constraint of time and space. Due to emphasis over recent data and its bounded memory requirement, sliding window model is a widely used model for mining frequent itemset over data stream. In this paper we proposed an algorithm named Variable-Moment for mining both frequent and closed frequent itemset over data stream. The algorithm is appropriate for noticing latest or new changes in the set of frequent itemset by making its window size variable, which is determined dynamically based on the extent of concept drift occurring within the arriving data stream. The size of window expands when there is no concept drift in the arriving data stream and size shrinks when there is a concept change. The relative support instead of absolute support is being used for making the concept of variable window effective. The algorithm uses an in-memory data structure to store frequent itemsets. Data structure gets updated whenever a batch of transaction is added or deleted from the sliding window to output exact frequent itemsets. Extensive experiments on both real and synthetic data show that our algorithm excellently spots the concept changes and adapts itself to the new concept along data stream by adjusting window size.
Sponsorship	IEEE India Counc. C Chapt.
Starting Page	504
Ending Page	510
File Size	333089
Page Count	7
File Format	PDF
e-ISBN	9781479925728
DOI	10.1109/IAdCC.2014.6779376
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2014-02-21
Publisher Place	India
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Itemsets Heuristic algorithms concept drift Approximation algorithms Data structures Data models variable window Data mining Approximation methods data stream closed frequent itemset
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

Mining Approximate Closed Frequent Itemsets over Stream

Mining closed frequent itemsets in the sliding window over data stream

A new algorithm for mining frequent closed itemsets from data streams

Moment: Maintaining Closed Frequent Itemsets over a Stream Sliding Window (2004)

An Efficient Subset-Lattice Algorithm for Mining Closed Frequent Itemsets in Data Streams

Research on Algorithm for Mining Frequent Closed Itemsets over Data Stream

Mining Accurate Top-K Frequent Closed Itemset from Data Stream

A Simple But Effective Stream Maximal Frequent Itemset Mining Algorithm

Moment: Maintaining closed frequent itemsets over a stream sliding window (2004)

A novel technique for mining closed frequent itemsets using variable sliding window

Similar Documents

Mining Approximate Closed Frequent Itemsets over Stream

Mining closed frequent itemsets in the sliding window over data stream

A new algorithm for mining frequent closed itemsets from data streams

Moment: Maintaining Closed Frequent Itemsets over a Stream Sliding Window (2004)

An Efficient Subset-Lattice Algorithm for Mining Closed Frequent Itemsets in Data Streams

Research on Algorithm for Mining Frequent Closed Itemsets over Data Stream

Mining Accurate Top-K Frequent Closed Itemset from Data Stream

A Simple But Effective Stream Maximal Frequent Itemset Mining Algorithm

Moment: Maintaining closed frequent itemsets over a stream sliding window (2004)

A novel technique for mining closed frequent itemsets using variable sliding window