NDLI: An Efficient Mining Maximal Frequent Traversal Sequences Algorithm Based on Bidirectional Constraint

Content Provider	IEEE Xplore Digital Library
Author	Jia-Dong Ren Xiao-Jian Zhang Hui-Li Peng
Copyright Year	2006
Description	Author affiliation: Coll. of Inf. Sci. & Eng., YanShan Univ., Qinhuangdao (Jia-Dong Ren; Xiao-Jian Zhang; Hui-Li Peng)
Abstract	Mining maximal frequent traversal sequence is a crucial application in Web usage mining, since users' traversal pattern and motivation are latent in session sequence at some time segment. A Frequent Traversal Sequence Tree structure with Dwell time (FTSD-Tree) is designed. Utilizing FTSD-Tree to store, compress the session database that is constrained by the bidirectional dwell time, and simplify the configuration of dwell time thresholds during mining. A novel algorithm named maximal frequent traversal sequence mining (MFTSM) is presented, which quickly traverses FTSD-Tree and discovers maximal frequent traversal sequence from the session sequences. Experimental results show that MFTSM can significantly improve the execution time efficiency for mining maximal frequent traversal sequence as long as the decision-makers or users give the appropriate constraints. Our performance study at runtime shows that MFTSM is faster than the well-known algorithms GSP, SPAM, MSPS and SPADE in the time constraint environment
Sponsorship	IEEE Syst., Man and Cybernetics Hebei Univ.
Starting Page	1575
Ending Page	1580
File Size	215905
Page Count	6
File Format	PDF
ISBN	1424400619
DOI	10.1109/ICMLC.2006.258832
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	Databases Unsolicited electronic mail Time factors Data mining Educational institutions Information science Electronic mail Tree data structures Runtime environment Web server Maximal frequent traversal sequence Dwell time FTSD-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

Find Duration Time Maximal Frequent Traversal Sequence on Web Sites

Mftpm: maximum frequent traversal pattern mining with bidirectional constraints.

IMFTS: High-Speed Mining Frequent Traversal Sequences with Bidirectional Constraints

Mining Maximal Frequent Access Sequences Based on Improved WAP-tree

Efficient data mining for maximal frequent subtrees

The Maximal Frequent Pattern mining of DNA sequence

Data mining for path traversal patterns in a web environment (1996).

An Efficient Close Frequent Pattern Mining Algorithm

EFFICIENT WEB MINING FOR TRAVERSAL PATH PATTERNS

An Efficient Mining Maximal Frequent Traversal Sequences Algorithm Based on Bidirectional Constraint

Similar Documents

Find Duration Time Maximal Frequent Traversal Sequence on Web Sites

Mftpm: maximum frequent traversal pattern mining with bidirectional constraints.

IMFTS: High-Speed Mining Frequent Traversal Sequences with Bidirectional Constraints

Mining Maximal Frequent Access Sequences Based on Improved WAP-tree

Efficient data mining for maximal frequent subtrees

The Maximal Frequent Pattern mining of DNA sequence

Data mining for path traversal patterns in a web environment (1996).

An Efficient Close Frequent Pattern Mining Algorithm

EFFICIENT WEB MINING FOR TRAVERSAL PATH PATTERNS

An Efficient Mining Maximal Frequent Traversal Sequences Algorithm Based on Bidirectional Constraint