Using current web page structure to improve prefetching performance
Computer Networks: The International Journal of Computer and Telecommunications Networking
Short Survey: A taxonomy of web prediction algorithms
Expert Systems with Applications: An International Journal
A framework of online proxy-based web prefetching
WISM'12 Proceedings of the 2012 international conference on Web Information Systems and Mining
A theoretical model for obfuscating web navigation trails
Proceedings of the Joint EDBT/ICDT 2013 Workshops
| Hi-index | 0.00 |
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.