Web access pattern mining - a new method
by A. Rajimol; G. Raju
International Journal of Web Science (IJWS), Vol. 2, No. 3, 2014

Abstract: An efficient web access pattern mining algorithm, FOL-mine is presented in this paper. The FOL-mine algorithm is based on the projected database of each frequent event and eliminates the need for construction of pattern tree. A data structure, first occurrence list (FOL), is introduced in the proposed algorithm for efficient handling of suffix building. Rebuilding of projection databases is completely eliminated in the new method. Experimental analysis of the algorithms reveals significant performance gain over other web access pattern mining algorithms.

Online publication date: Wed, 31-Dec-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Web Science (IJWS):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com