loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
First International Conference on Semantics, Knowledge and Grid (SKG'05)
Two Cache Replacement Algorithms Based on Association Rules and Markov Models
Beijing, China
November 27-November 29
ISBN: 0-7695-2534-2
Keqiu Li, Dalian Maritime University
Wenyu Qu, Japan Advanced Institute of Science and Technology
Hong Shen, Japan Advanced Institute of Science and Technology
Di Wu, Dalian University of Technology
Takashi Nanya, University of Tokyo
In this paper, two cache replacement algorithms are presented. One is based on association rules, in which we extend the LRU replacement algorithm by making it sensible to web access models extracted from web log data using web mining techniques. The other one is based on Markov models, in which we improve the LRU replacement algorithm by applying Markov models.
Index Terms:
Cache replacement, web mining, association rule, Markov model.
Citation:
Keqiu Li, Wenyu Qu, Hong Shen, Di Wu, Takashi Nanya, "Two Cache Replacement Algorithms Based on Association Rules and Markov Models," skg, pp.28, First International Conference on Semantics, Knowledge and Grid (SKG'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.