Two cache replacement algorithms based on association rules and Markov models

Keqiu Li; Wenyu Qu; Hong Shen; Di Wu; Takashi Nanya

doi:10.1109/SKG.2005.136

Two cache replacement algorithms based on association rules and Markov models

Keqiu Li, Wenyu Qu, Hong Shen, Di Wu, Takashi Nanya

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

7 Citations (Scopus)

Abstract

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.

Original language	English
Title of host publication	Proceedings - First International Conference on Semantics, Knowledge and Grid, SKG 2005
Publisher	IEEE Computer Society
ISBN (Print)	0769525342, 9780769525341
DOIs	https://doi.org/10.1109/SKG.2005.136
Publication status	Published - 2005
Externally published	Yes
Event	1st International Conference on Semantics, Knowledge and Grid, SKG 2005 - Beijing, China Duration: 27 Nov 2005 → 29 Nov 2005

Publication series

Name	Proceedings - First International Conference on Semantics, Knowledge and Grid, SKG 2005

Conference

Conference	1st International Conference on Semantics, Knowledge and Grid, SKG 2005
Country/Territory	China
City	Beijing
Period	27/11/05 → 29/11/05

Keywords

Association rule
Cache replacement
Markov model
Web mining

Access to Document

10.1109/SKG.2005.136

Cite this

Li, K., Qu, W., Shen, H., Wu, D., & Nanya, T. (2005). Two cache replacement algorithms based on association rules and Markov models. In Proceedings - First International Conference on Semantics, Knowledge and Grid, SKG 2005 Article 4125816 (Proceedings - First International Conference on Semantics, Knowledge and Grid, SKG 2005). IEEE Computer Society. https://doi.org/10.1109/SKG.2005.136

@inproceedings{de7e6b210d324aa6b8a61b0ed34b1cb1,

title = "Two cache replacement algorithms based on association rules and Markov models",

abstract = "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.",

keywords = "Association rule, Cache replacement, Markov model, Web mining",

author = "Keqiu Li and Wenyu Qu and Hong Shen and Di Wu and Takashi Nanya",

year = "2005",

doi = "10.1109/SKG.2005.136",

language = "English",

isbn = "0769525342",

series = "Proceedings - First International Conference on Semantics, Knowledge and Grid, SKG 2005",

publisher = "IEEE Computer Society",

booktitle = "Proceedings - First International Conference on Semantics, Knowledge and Grid, SKG 2005",

address = "United States",

note = "1st International Conference on Semantics, Knowledge and Grid, SKG 2005 ; Conference date: 27-11-2005 Through 29-11-2005",

}

Li, K, Qu, W, Shen, H, Wu, D & Nanya, T 2005, Two cache replacement algorithms based on association rules and Markov models. in Proceedings - First International Conference on Semantics, Knowledge and Grid, SKG 2005., 4125816, Proceedings - First International Conference on Semantics, Knowledge and Grid, SKG 2005, IEEE Computer Society, 1st International Conference on Semantics, Knowledge and Grid, SKG 2005, Beijing, China, 27/11/05. https://doi.org/10.1109/SKG.2005.136

Two cache replacement algorithms based on association rules and Markov models. / Li, Keqiu; Qu, Wenyu; Shen, Hong et al.
Proceedings - First International Conference on Semantics, Knowledge and Grid, SKG 2005. IEEE Computer Society, 2005. 4125816 (Proceedings - First International Conference on Semantics, Knowledge and Grid, SKG 2005).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Two cache replacement algorithms based on association rules and Markov models

AU - Li, Keqiu

AU - Qu, Wenyu

AU - Shen, Hong

AU - Wu, Di

AU - Nanya, Takashi

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

KW - Association rule

KW - Cache replacement

KW - Markov model

KW - Web mining

UR - http://www.scopus.com/inward/record.url?scp=42749108787&partnerID=8YFLogxK

U2 - 10.1109/SKG.2005.136

DO - 10.1109/SKG.2005.136

M3 - Conference contribution

AN - SCOPUS:42749108787

SN - 0769525342

SN - 9780769525341

T3 - Proceedings - First International Conference on Semantics, Knowledge and Grid, SKG 2005

BT - Proceedings - First International Conference on Semantics, Knowledge and Grid, SKG 2005

PB - IEEE Computer Society

T2 - 1st International Conference on Semantics, Knowledge and Grid, SKG 2005

Y2 - 27 November 2005 through 29 November 2005

ER -

Two cache replacement algorithms based on association rules and Markov models

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this