Analysis of Web Access Sequence Based on the Improved Prefix Span Algorithm

DOI

10.2991/iiicec-15.2015.177How to use a DOI?

Keywords

Data mining; Sequential pattern; PrefixSpan; IPS; Web access sequence

Abstract

PrefixSpan is an important algorithm for sequential pattern mining algorithm, but it’s projected database cost more redundant memory and scan-time, so this paper present an improved PrefixSpan algorithm(IPS) which is based on PrefixSpan. IPS decreases the redundant memory and scan-time by abnegating the non-frequent items and projection database which sequential number is lower than minimum support. This paper applied IPS to web access sequence mining, by mining the web access records database to find frequent access sequence to provide reasonable suggestions for Web building.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Yang Xu
AU  - Yu Wang
PY  - 2015/03
DA  - 2015/03
TI  - Analysis of Web Access Sequence Based on the Improved Prefix Span Algorithm
BT  - Proceedings of the 2015 International Industrial Informatics and Computer Engineering Conference
PB  - Atlantis Press
SP  - 788
EP  - 791
SN  - 2352-538X
UR  - https://doi.org/10.2991/iiicec-15.2015.177
DO  - 10.2991/iiicec-15.2015.177
ID  - Xu2015/03
ER  -