- -

Referrer Graph: A cost-effective algorithm and pruning method for predicting web accesses

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

Referrer Graph: A cost-effective algorithm and pruning method for predicting web accesses

Show full item record

De La Ossa Perez, BA.; Gil Salinas, JA.; Sahuquillo Borrás, J.; Pont Sanjuan, A. (2013). Referrer Graph: A cost-effective algorithm and pruning method for predicting web accesses. Computer Communications. 36(8):881-894. https://doi.org/10.1016/j.comcom.2013.02.005

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/43243

Files in this item

Item Metadata

Title: Referrer Graph: A cost-effective algorithm and pruning method for predicting web accesses
Author: De La Ossa Perez, Bernardo Antonio Gil Salinas, José Antonio Sahuquillo Borrás, Julio Pont Sanjuan, Ana
UPV Unit: Universitat Politècnica de València. Departamento de Economía y Ciencias Sociales - Departament d'Economia i Ciències Socials
Universitat Politècnica de València. Departamento de Informática de Sistemas y Computadores - Departament d'Informàtica de Sistemes i Computadors
Issued date:
Abstract:
This paper presents the Referrer Graph (RG) web prediction algorithm and a pruning method for the associated graph as a low-cost solution to predict next web users accesses. RG is aimed at being used in a real web system ...[+]
Subjects: Web prediction and prefetching , Prediction algorithm , Web latency reduction , Performance evaluation , Measurement
Copyrigths: Reserva de todos los derechos
Source:
Computer Communications. (issn: 0140-3664 )
DOI: 10.1016/j.comcom.2013.02.005
Publisher:
Elsevier
Publisher version: http://dx.doi.org/10.1016/j.comcom.2013.02.005
Project ID:
info:eu-repo/grantAgreement/EC/FP7/287759/EU
Spanish Ministry of Science and Innovation [TIN2009-08201]
Thanks:
This work has been partially supported by Spanish Ministry of Science and Innovation under Grant TIN2009-08201. The authors would also like to thank the technical staff of the School of Computer Science at the Polytechnic ...[+]
Type: Artículo

This item appears in the following Collection(s)

Show full item record