Integration of the PageRank Algorithm, Sequence Processing, and CPT+ for Webpage Access Prediction

  • et al.
N/ACitations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this article, we provide a novel model to address the issue of webpage access prediction. In particular, the main approach we propose aims to reduce execution time by reducing the sequence space. This solution combines calculation of PageRank values of sequences in sequence databases and analysis of sequences from these shortened sequence databases. To evaluate the solution, we chose K-fold validation with K = 10 by randomizing the dataset 10 times; then the system calculated the average PageRank values of sequences. Next, with acceptable accuracy (when the size of datasets was reduced by up to 30% by PageRank calculation), we performed next access page prediction by analysing 1000 sequences. Experimental results for the real FIFA dataset show that our new proposed approach is much better than previous approaches in terms of prediction execution time.

Cite

CITATION STYLE

APA

Da*, N. T., Hanh, T., & Duy, P. H. (2020). Integration of the PageRank Algorithm, Sequence Processing, and CPT+ for Webpage Access Prediction. International Journal of Recent Technology and Engineering (IJRTE), 8(6), 2327–2335. https://doi.org/10.35940/ijrte.f8209.038620

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free