NDLI: Efficient Mining of Constrained Frequent Patterns from Streams

Content Provider	IEEE Xplore Digital Library
Author	Leung, C.K.-S. Khan, Q.I.
Copyright Year	2006
Description	Author affiliation: Manitoba Univ., Winnipeg, Man. (Leung, C.K.-S.; Khan, Q.I.)
Abstract	With advances in technology, a flood of data can be produced in many applications such as sensor networks and Web click streams. This calls for stream mining, which searches for implicit, previously unknown, and potentially useful information (such as frequent patterns) that might be embedded in continuous data streams. However, most of the existing algorithms do not allow users to express the patterns to be mined according to their intentions, via the use of constraints. Consequently, these unconstrained mining algorithms can yield numerous patterns that are not interesting to users. In this paper, we develop algorithms - which use a tree-based framework to capture the important portion of the streaming data, and allow human users to impose a certain focus on the mining process - for mining frequent patterns that satisfy user constraints from the flood of data
Sponsorship	IEEE Comput. Soc. IEEE Concordia Univ
Starting Page	61
Ending Page	68
File Size	183614
Page Count	8
File Format	PDF
ISBN	0769525776
ISSN	10988068
DOI	10.1109/IDEAS.2006.20
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2006-12-11
Publisher Place	India
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Data mining Databases Humans Floods Automation Area measurement Fires Hoses Frequency Computational modeling
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

DSTree: A Tree Structure for the Mining of Frequent Sets from Data Streams

Mining of Frequent Itemsets from Streams of Uncertain Data

An Efficient Method for Incremental Mining of Share-Frequent Patterns

A landmark-model based system for mining frequent patterns from uncertain data streams

Efficient algorithms for stream mining of constrained frequent patterns in a limited memory environment

Frequent Subgraph Mining from Streams of Uncertain Data

Efficient Mining of Weighted Frequent Patterns over Data Streams

Efficient algorithms for mining constrained frequent patterns from uncertain data

Interactive constrained frequent-pattern mining system

Efficient Mining of Constrained Frequent Patterns from Streams

Similar Documents

DSTree: A Tree Structure for the Mining of Frequent Sets from Data Streams

Mining of Frequent Itemsets from Streams of Uncertain Data

An Efficient Method for Incremental Mining of Share-Frequent Patterns

A landmark-model based system for mining frequent patterns from uncertain data streams

Efficient algorithms for stream mining of constrained frequent patterns in a limited memory environment

Frequent Subgraph Mining from Streams of Uncertain Data

Efficient Mining of Weighted Frequent Patterns over Data Streams

Efficient algorithms for mining constrained frequent patterns from uncertain data

Interactive constrained frequent-pattern mining system

Efficient Mining of Constrained Frequent Patterns from Streams