Name
Abstract | ||
|---|---|---|
This paper presents the Referrer Graph (RG) web prediction algorithm as a low-cost solution to predict next web user accesses. RG is aimed at being used in a real web system with prefetching capabilities without degrading its performance. The algorithm learns from user accesses and builds a Markov model. These kinds kind of algorithms use the sequence of the user accesses to make predictions. Unlike previous Markov model based proposals, the RG algorithm differentiates dependencies in objects of the same page from objects of different pages by using the object URI and referrer in each request. This permits us to build a simple data structure that is easier to handle and, consequently, with a lower computational cost in comparison with other algorithms. The RG algorithm has been evaluated and compared with the best prediction algorithms proposed in the open literature, and the results show that it achieves similar precision values and page latency savings but requiring much less computational and memory resources. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1145/1774088.1774260 | SAC |
Keywords | Field | DocType |
markov model,real web system,referrer graph,lower computational cost,next web user access,different page,user access,low-cost web prediction algorithm,best prediction,web prediction algorithm,page latency saving,rg algorithm,data structure | Web system,Data structure,Graph,Computer science,Latency (engineering),Markov model,Algorithm,Theoretical computer science,Prediction algorithms,Web prefetching | Conference |
Citations | PageRank | References |
7 | 0.49 | 10 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| B. de la Ossa | 1 | 16 | 1.45 |
| A. Pont | 2 | 24 | 3.50 |
| J. Sahuquillo | 3 | 20 | 3.27 |
| José A. Gil | 4 | 88 | 12.60 |