2015
DOI: 10.1016/j.procs.2015.02.010
|View full text |Cite
|
Sign up to set email alerts
|

Improving the Performance of a Proxy Cache Using Tree Augmented Naive Bayes Classifier

Abstract: In this paper, we attempt to improve the performance of Web proxy cache replacement policies such as LRU and GDSF by adapting a semi naïve Bayesian learning technique. In the first part, Tree Augmented Naive Bayes classifier (TANB) to classify the web log data and predict the classes of web objects to be revisited again future or not. In the second part, a Tree Augmented Naïve Bayes classifier is incorporated with proxy caching policies to form novel approaches known as TANB-LRU and TANB-GDSF. This proposed ap… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 10 publications
(7 citation statements)
references
References 8 publications
0
7
0
Order By: Relevance
“…The normalized frequencies and duration can be easily derived using the Eqns. (10,11,15,16). The distance metrics for the interest interval is given by: Current web page access frequency K…”
Section: Multiple Factor Distance Measuresmentioning
confidence: 99%
See 2 more Smart Citations
“…The normalized frequencies and duration can be easily derived using the Eqns. (10,11,15,16). The distance metrics for the interest interval is given by: Current web page access frequency K…”
Section: Multiple Factor Distance Measuresmentioning
confidence: 99%
“…Another approach includes tree augmented naive bayes(TANB) [16] algorithm gives better results and improves the performance of traditional policies like LRU and GDSF. According to the recurrent sliding window, frequency and recency of the web objects are calculated/preprocessed and fed as input to TANB to find out the page with the highest probability of revisiting in the future.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Benadit et al conducted four studies in the past five years. Benadit et al proposed the tree augmented naïve bayes (TANB) to carry out the Web log classification process and future Web object predictions (Benadit and Sagayaraj Francis, 2015) then continue his research by proposing a Very Fast Decision Tree (VFDT) (Benadit et al , 2015). Both algorithms are combined with LRU and GDSF and use the same data set from IRcache.…”
Section: Caching Strategymentioning
confidence: 99%
“…The conditional mutual information ( I p ) is used in in building TAN model. The conditional mutual information is calculated using the formula below …”
Section: Structure-learning Of Bayesian Networkmentioning
confidence: 99%