By Topic

Novel position-coded methods for mining web access patterns

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Wenjia Wang ; School of Computing Sciences, University of East Anglia Norwich, The United Kingdom ; Phuong Thanh Cao-Thai

This paper briefly introduces two novel algorithms - PLWAPI and PLWAP2, modified from the position pre-ordered linked Web access pattern (PLWAP) algorithm, for mining Web access pattern(WAP)s from web usage log data. Their basic ideas are to create a new header that links only the nodes under the new root of a WAP tree, and reuse the WAP tree through cloning in every recursion of the mining process. They have been tested against three other existing popular algorithms, i.e. WAP tree, the conditional sequence (CS) and PLWAP, with some synthetic benchmark data and real-world web log data collected from two Web sites. The experimental results indicated that PLWAP2 performed slightly better than PLWAP whilst using less memory, but PLWAPI is much more efficient than all the others, particularly when used for large data sets with long (more than 10 events) access sequences.

Published in:

Intelligence and Security Informatics, 2008. ISI 2008. IEEE International Conference on

Date of Conference:

17-20 June 2008