Modelling and predicting a Web page accesses using Markov processes

Dhyani, Devanshu; Bhowmick, Sourav S.; Ng, Wee-Keong

doi:10.1109/dexa.2003.1232044

Cited by 22 publications

(10 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Markov model is assumed to be a suitable probability model to predict users' browsing behaviors (Dhyani et al, 2003;Dhyani, Ng, & Bhowmick, 2002;Jespersen et al, 2003;Pallis, Angelis, & Vakali, 2007;Sarukkai, 2000). The state space S = {s 1 , s 2 , .…”

Section: Markov Modelmentioning

confidence: 99%

“…Markov model is assumed to be a suitable probability model and usually used for predicting web user's behavior (Chen & Zhang, 2003;Dhyani, Bhowmick, & Ng, 2003;Jespersen, Pedersen, & Thorhauge, 2003;Palpanas, 1998;Sarukkai, 2000). The behavior also can be represented in a sequential pattern where all the included traces are recorded by time order.…”

Section: Introductionmentioning

confidence: 99%

“…HPG model consists of the sequence path of web page. Dhyani proposed two models to discuss the usage characterization (Dhyani et al, 2003). First, the random model, Morse's model, is used for modeling the web page accesses.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A novel prediction model based on hierarchical characteristic of web site

Lee

2011

Expert Systems with Applications

View full text Add to dashboard Cite

Section: Markov Modelmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A novel prediction model based on hierarchical characteristic of web site

Lee

2011

Expert Systems with Applications

View full text Add to dashboard Cite

“…In other words, a DSMM finds patterns across incoming requests and also statistical models of requests intervals and process times. The existing workload modeling approaches only focus on extracting sequential patterns of workload [5,7]. They do not include solutions for capturing patterns of intervals between incoming requests and their required process times.…”

Section: Introductionmentioning

confidence: 99%

Markovian workload modeling for Enterprise Application Servers

Sharifimehr

Sadaoul

2009

Proceedings of the 2nd Canadian Conference on Computer Science and Software Engineering

View full text Add to dashboard Cite

Performance analysis of Enterprise Application Servers (EAS) plays a critical role in all e-business enterprises. Workload modeling is considered as a powerful performance analysis tool. In this paper we employ our Dynamic Semi-Markov Model (DSMM) to efficiently model the incoming workload toward EAS. Firstly we offer a similarity operator to prevent the redundancy in a repository of workload models. Secondly we propose a generic modeling component to facilitate workload modeling for any EAS based on DSMM. Afterwards we present evaluation results to show the applicability of the proposed solution on these complex EAS systems.

show abstract

“…By which, the states that have less support or low coverage are eliminated while making recommendations. Another model [5] based on Markov process for web access prediction has drawback of high complexity due to consideration of all access sequences through out the prediction process. Sometimes, in this approach noisy or irrelevant access sequences participate in web page access prediction affects the accuracy.…”

Section: Background Of Studymentioning

confidence: 99%

A New Web Usage Mining Approach for Next Page Access Prediction

Anitha¹

2010

IJCA

View full text Add to dashboard Cite

To engage users of a website at an early stage of surfing, a novel web access recommendation system is essential. In this paper, a new web usage mining approach is proposed to predict next page access. It is proposed to identify similar access patterns from web log using pair-wise nearest neighbor based clustering and then sequential pattern mining is done on these patterns to determine next page accesses. The tightness of clusters is improved by setting similarity threshold while forming clusters. In traditional recommendation models, clustering by non-sequential data decreases recommendation accuracy. In this paper it is proposed to integrate Markov model based sequential pattern mining with clustering. A variant of Markov model called dynamic support pruned all k th order Markov model is proposed in order to reduce state space complexity. Mining the web access log of users of similar interest provides good recommendation accuracy. Hence, the proposed model provides accurate recommendations with reduced state space complexity.

show abstract

Modelling and predicting a Web page accesses using Markov processes

Cited by 22 publications

References 6 publications

A novel prediction model based on hierarchical characteristic of web site

A novel prediction model based on hierarchical characteristic of web site

Markovian workload modeling for Enterprise Application Servers

A New Web Usage Mining Approach for Next Page Access Prediction

Contact Info

Product

Resources

About