Welcome to the InfoSci Platform
Improving Web Clickstream Analysis: Markov Chains Models and Genmax Algorithms

Improving Web Clickstream Analysis: Markov Chains Models and Genmax Algorithms

Paolo Baldini, Paolo Giudici
Copyright: © 2008 |Pages: 11
ISBN13: 9781599045283|ISBN10: 1599045281|ISBN13 Softcover: 9781616926564|EISBN13: 9781599045306
DOI: 10.4018/978-1-59904-528-3.ch014
Cite Chapter Cite Chapter

MLA

Baldini, Paolo, and Paolo Giudici. "Improving Web Clickstream Analysis: Markov Chains Models and Genmax Algorithms." Mathematical Methods for Knowledge Discovery and Data Mining, edited by Giovanni Felici and Carlo Vercellis, IGI Global, 2008, pp. 233-243. https://doi.org/10.4018/978-1-59904-528-3.ch014

APA

Baldini, P. & Giudici, P. (2008). Improving Web Clickstream Analysis: Markov Chains Models and Genmax Algorithms. In G. Felici & C. Vercellis (Eds.), Mathematical Methods for Knowledge Discovery and Data Mining (pp. 233-243). IGI Global. https://doi.org/10.4018/978-1-59904-528-3.ch014

Chicago

Baldini, Paolo, and Paolo Giudici. "Improving Web Clickstream Analysis: Markov Chains Models and Genmax Algorithms." In Mathematical Methods for Knowledge Discovery and Data Mining, edited by Giovanni Felici and Carlo Vercellis, 233-243. Hershey, PA: IGI Global, 2008. https://doi.org/10.4018/978-1-59904-528-3.ch014

Export Reference

Mendeley
Favorite

Abstract

Every time a user links up to a web site, the server keeps track of all the transactions accomplished in a log file. What is captured is the "click flow" (clickstream) of the mouse and the keys used by the user during the navigation inside the site. Usually every click of the mouse corresponds to the viewing of a web page. The objective of this chapter is to show how web clickstream data can be used to understand the most likely paths of navigation in a web site, with the aim of predicting, possibly on-line, which pages will be seen, having seen a specific path of other pages before. Such analysis can be very useful to understand, for instance, what is the probability of seeing a page of interest (such as the buying page in an e-commerce site) coming from another page. Or what is the probability of entering (or exiting) the web site from any particular page. From a methodological viewpoint, we present two main research contributions. On one hand we show how to improve the efficiency of the Apriori algorithm; on the other hand we show how Markov chain models can be usefully developed and implemented for web usage mining. In both cases we compare the results obtained with classical association rules algorithms and models.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.