By Topic

A PPM Prediction Model Based on Stochastic Gradient Descent for Web Prefetching

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

3 Author(s)
Zhijie Ban ; Beijing Inst. of Technol., Beijing ; Zhimin Gu ; Yu Jin

PPM models are commonly used to predict the user's next request in Web prefetching by extracting useful knowledge from historical user requests. Any of features such as page access frequency, prediction feedback, context length and conditional probability can influence on the prefetching performance of PPM models. However, existing PPM models only consider one or a few of them. Based on stochastic gradient descent, we present a novel PPM model that takes into account all the above mentioned features. Our model defines a target function to describe a node's prediction capability, which is a linear combination of these features. In order to decrease the number of incorrect predictions, weights of these features are dynamically updated over every example according to the stochastic gradient descent rule. Our model selects a node with the maximum target function value among all matching nodes to predict the next most probable page. We use real web logs to examine proposed model. The simulation shows our model can significantly improve the prefetching performance.

Published in:

22nd International Conference on Advanced Information Networking and Applications (aina 2008)

Date of Conference:

25-28 March 2008