A framework of combining Markov model with association rules for predicting web page accesses
AusDM '06 Proceedings of the fifth Australasian conference on Data mining and analystics - Volume 61
Integrating recommendation models for improved web page prediction accuracy
ACSC '08 Proceedings of the thirty-first Australasian conference on Computer science - Volume 74
A Grid Information Services Architecture Based on Structured P2P Systems
Computer Supported Cooperative Work in Design IV
Towards Privacy Compliant and Anytime Recommender Systems
EC-Web 2009 Proceedings of the 10th International Conference on E-Commerce and Web Technologies
An improved lookup algorithm on over-DHT paradigm based P2P network
WISM'11 Proceedings of the 2011 international conference on Web information systems and mining - Volume Part I
Design and analysis of a distributed grid resource discovery protocol
Cluster Computing
| Hi-index | 0.00 |
Currently, researchers have proposed several sequential association-rule models for predicting the next HTTP request. These researches focus on using sequence and temporal constrains for pruning to improve prediction precision. In this paper, we provide a comparative study on different kinds of sequential association rules for web document prediction. Firstly, we give algorithms on mining sequential association rules, which is based on different sequence and temporal constrains combination. Then, the performance of all such algorithms has been compared on a real web log dataset. Based on the comparison, by the method of variance analysis, we explore the effect of sequence and temporal information on influencing the precision of prediction. We show that the sequence constrains, the temporal constrains and the interaction between these two constrains can affect the precision of prediction. Furthermore, temporal constrains can affect more than sequence constrains. These results show light on the future research on improving the precisions of prediction.