A novel Web Access Pattern Mining Algorithm, FOL-Mine is proposed in this chapter. The FOL-Mine algorithm generates access patterns by suffix building in the projected data base of each frequent event and eliminates the need for construction of pattern tree. A data structure, First Occurrence List (FOL), is introduced for efficient handling of suffix building. Rebuilding of projection databases is completely eliminated in the new method. Experimental analysis of the proposed algorithm reveals significant performance gain over other web access pattern mining algorithms.
Keywords
First Occurrence List Mine
web access pattern
Web Access Database
Authors
S.Prabhu
R.Kalaivani
How to Cite this Article
S.Prabhu, R.Kalaivani (2016).
"A STUDY ON FOL-MINE – FIRST OCCURRENCE LIST MINE".
International Journal of Contemporary Research in Computer Science and Technology,
2(11), pp. 1066-1069.
