loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sixth International Conference on Intelligent Systems Design and Applications (ISDA'06) Volume 1
Mining Maximal Frequent Access Sequences Based on Improved WAP-tree
Jinan, China
October 16-October 18
ISBN: 0-7695-2528-8
ASCII Text
x 
 
Xiaoqiu Tan, Min Yao, Jianke Zhang, "Mining Maximal Frequent Access Sequences Based on Improved WAP-tree," Intelligent Systems Design and Applications, International Conference on, vol. 1, pp. 616-620, Sixth International Conference on Intelligent Systems Design and Applications (ISDA'06) Volume 1, 2006.
 
 
BibTex
x
 
@article{ 10.1109/ISDA.2006.193,
author = {Xiaoqiu Tan and Min Yao and Jianke Zhang},
title = {Mining Maximal Frequent Access Sequences Based on Improved WAP-tree},
journal ={Intelligent Systems Design and Applications, International Conference on},
volume = {1},
year = {2006},
isbn = {0-7695-2528-8},
pages = {616-620},
doi = {http://doi.ieeecomputersociety.org/10.1109/ISDA.2006.193},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Intelligent Systems Design and Applications, International Conference on
TI - Mining Maximal Frequent Access Sequences Based on Improved WAP-tree
SN - 0-7695-2528-8
SP616
EP620
A1 - Xiaoqiu Tan,
A1 - Min Yao,
A1 - Jianke Zhang,
PY - 2006
KW - Web Usage Mining
KW - Web Access pattern tree
KW - Restrained sub-tree
KW - Maximum Access Sequence
KW - Sequential pattern mining
VL - 1
JA - Intelligent Systems Design and Applications, International Conference on
ER -
 
Xiaoqiu Tan, Zhejiang Ocean University, China
Min Yao, Zhejiang University, China
Jianke Zhang, Zhejiang Ocean University, China
It is worthwhile to analyze user?s access patterns by capturing maximal access sequences from web usage data in practice. Web Access Pattern Tree (WAP-tree) stores the highly compressed access sequences, and mining frequent access sequences based on WAP-tree needs to scan transaction database only twice. However, producing conditional WAP-tree repeatedly in the algorithm influences the efficiency in a certain degree. Considering the shortage of WAP-tree, combined with the need of mining maximal access sequences, this paper improves WAP-tree and introduces restrained sub tree structure to solve the problem that a mass of conditional WAP-tree is built in the traditional algorithm. In addition, restrained sub trees inherit the nodes of WAP-tree so that memory is saves. The results of experiments show the efficiency of the improved algorithm.
Index Terms:
Web Usage Mining, Web Access pattern tree, Restrained sub-tree, Maximum Access Sequence, Sequential pattern mining
Citation:
Xiaoqiu Tan, Min Yao, Jianke Zhang, "Mining Maximal Frequent Access Sequences Based on Improved WAP-tree," isda, vol. 1, pp.616-620, Sixth International Conference on Intelligent Systems Design and Applications (ISDA'06) Volume 1, 2006
Usage of this product signifies your acceptance of the Terms of Use.