NDLI: A Fast Interactive Sequential Pattern Mining Algorithm Based on Memory Indexing

Content Provider	IEEE Xplore Digital Library
Author	Jia-Dong Ren Jun-Sheng Zong
Copyright Year	2006
Description	Author affiliation: Coll. of Inf. Sci. & Eng., Yanshan Univ., Qinghuangdao (Jia-Dong Ren; Jun-Sheng Zong)
Abstract	The sequential pattern mining algorithm discovers all patterns meeting the user specified minimum support threshold. However, it is very impossibly that user could obtain the satisfactory patterns in just one query. The paper proposes a new interactive sequential pattern mining algorithm based on memory indexing, named MIFSPM, which adopts memory indexing technique, so it scans the sequence database only once to read data sequences into memory. Compact lattice frequent pattern tree (abbreviated as LFP-tree) saves previous results, in which the root node saves two minimum support thresholds. Besides, each node does not store frequent patterns and support information, but also index set mapped table (abbreviated as ISMT), except the root node. Rapidly, ISMT is used to mine new frequent sequential patterns without candidates generation. When to update the structure is decided by comparing the two minimum support thresholds, logistic information contained in the index set mapped table is used to fast mine new frequent sequential patterns without candidates generation. Experiments demonstrate the good performance and scalability of MIFSPM, with various minimum support thresholds. Therefore, MIFSPM can mine frequent sequential patterns efficiently and be better than the other algorithms
Sponsorship	IEEE Syst., Man and Cybernetics Hebei Univ.
Starting Page	1082
Ending Page	1087
File Size	223172
Page Count	6
File Format	PDF
ISBN	1424400619
DOI	10.1109/ICMLC.2006.258564
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	Indexing Databases Lattices Data mining Pattern analysis Testing Machine learning algorithms Partitioning algorithms Educational institutions Information science index set mapped table sequential pattern memory indexing lattice frequent pattern tree
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 two stage approach for Contiguous Sequential Pattern mining

A frequent itemsets mining algorithm based on spatial partition

A Fast Algorithm for Constructing FP_Tree

Research on association rules mining algorithm with item constraints

Fast and memory efficient mining of frequent closed itemsets

Sub-frequent Patterns Mining Based on SFP-Tree

Compressing the Set of Frequent Sequential Patterns

Efficient Sequential Pattern Mining Algorithm by Positional Data

A High Performance Algorithm for Mining Frequent Patterns: LPS-Miner

A Fast Interactive Sequential Pattern Mining Algorithm Based on Memory Indexing

Similar Documents

A two stage approach for Contiguous Sequential Pattern mining

A frequent itemsets mining algorithm based on spatial partition

A Fast Algorithm for Constructing FP_Tree

Research on association rules mining algorithm with item constraints

Fast and memory efficient mining of frequent closed itemsets

Sub-frequent Patterns Mining Based on SFP-Tree

Compressing the Set of Frequent Sequential Patterns

Efficient Sequential Pattern Mining Algorithm by Positional Data

A High Performance Algorithm for Mining Frequent Patterns: LPS-Miner

A Fast Interactive Sequential Pattern Mining Algorithm Based on Memory Indexing