2005 First International Conference on Semantics, Knowledge and Grid 2005
DOI: 10.1109/skg.2005.32
|View full text |Cite
|
Sign up to set email alerts
|

An Adaptive PPM Prediction Model Based on Pruning Technique

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2016
2016
2016
2016

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 3 publications
0
1
0
Order By: Relevance
“…The PPM (Prediction by Partial Match) prediction models [3][4][5][6][7][8][9][10][11][12][13][14] based on tree-like structure belong to multiple highorder Markov models; the DG(Dependency Graph) models [15][16][17][18][19][20]based on graphlike structure belong to 1-order Markov models. In many applications, first-order Markov models are not very accurate in predicting the user's browsing behaviors, since these models do not look far into the past to correctly discriminate the different observed patterns.…”
Section: Introductionmentioning
confidence: 99%
“…The PPM (Prediction by Partial Match) prediction models [3][4][5][6][7][8][9][10][11][12][13][14] based on tree-like structure belong to multiple highorder Markov models; the DG(Dependency Graph) models [15][16][17][18][19][20]based on graphlike structure belong to 1-order Markov models. In many applications, first-order Markov models are not very accurate in predicting the user's browsing behaviors, since these models do not look far into the past to correctly discriminate the different observed patterns.…”
Section: Introductionmentioning
confidence: 99%