FOL-mine - A more efficient method for mining web access pattern

Abstract

In this paper, we propose an efficient sequential access pattern mining algorithm, FOL-mine. The FOL-mine algorithm is based on the projected data base of each frequent event and eliminates the need for construction of pattern tree. First Occurrence List, the Basic data structure used in the algorithm, manages suffix building very efficiently. There is no need to rebuild the projection databases. Experimental analysis of the algorithms reveals significant performance gain over other access pattern mining algorithms. © 2011 Springer-Verlag.