IDEAS home Printed from https://ideas.repec.org/a/taf/japsta/v31y2004i1p15-27.html
   My bibliography  Save this article

A Bayesian Hierarchical Model for the Evaluation of a Website

Author

Listed:
  • L. Di Scala
  • L. La Rocca
  • G. Consonni

Abstract

Consider a website and the surfers visiting its pages. A typical issue of interest, for example while monitoring an advertising campaign, concerns whether a specific page has been designed successfully, i.e. is able to attract surfers or address them to other pages within the site. We assume that the surfing behaviour is fully described by the transition probabilities from one page to another, so that a clickstream (sequence of consecutively visited pages) can be viewed as a finite-state-space Markov chain. We then implement a variety of hierarchical prior distributions on the multivariate logits of the transition probabilities and define, for each page, a content effect and a link effect. The former measures the attractiveness of the page due to its contents, while the latter signals its ability to suggest further interesting links within the site. Moreover, we define an additional effect, representing overall page success, which incorporates both effects previously described. Using WinBUGS, we provide estimates and credible intervals for each of the above effects and rank pages accordingly.

Suggested Citation

  • L. Di Scala & L. La Rocca & G. Consonni, 2004. "A Bayesian Hierarchical Model for the Evaluation of a Website," Journal of Applied Statistics, Taylor & Francis Journals, vol. 31(1), pages 15-27.
  • Handle: RePEc:taf:japsta:v:31:y:2004:i:1:p:15-27
    DOI: 10.1080/0266476032000148920
    as

    Download full text from publisher

    File URL: http://www.tandfonline.com/doi/abs/10.1080/0266476032000148920
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/0266476032000148920?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Huseyin C. Ozmutlu, 2009. "Markovian analysis for automatic new topic identification in search engine transaction logs," Applied Stochastic Models in Business and Industry, John Wiley & Sons, vol. 25(6), pages 737-768, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:japsta:v:31:y:2004:i:1:p:15-27. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/CJAS20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.