We describe how statistical association models and, specifically, graphical models, can be usefully employed to model web mining data. We describe some methodological problems related to the implementation of discrete graphical models for web mining data. In particular, we discuss model selection procedures.
Unable to display preview. Download preview PDF.
- Breese, J., Heckerman, D., and Kadie, C. 1998. Empirical analysis of predictive algorithms for collaborative filtering. Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence. New York: Morgan Kaufmann.Google Scholar
- Brooks, S. 1998. Markov chain Monte Carlo method and its application. The Statistician, 47:69–100.Google Scholar
- Giudici, P. and Castelo, R. 2001. Improving Markov chain Monte Carlo, for data mining. Manuscript revised for publication.Google Scholar
- Giudici, P. and Green, P. 1999. Decomposable graphical Gaussian model determination. Biometrika, 86: 785–801.Google Scholar
- Heckerman, D., Chickering, D., Meek, C., Rounthwaite, R., and Kadie, C. 2000. Dependency networks for inference, collaborative filtering and data visualization. Journal of Machine Learning Research, 1:49–75.Google Scholar
- Heckerman, D., Geiger, D., and Chikering, D. 1995. Learning Bayesian networks: The combination of knowledge and statistical data. Machine Learning, 20:197–243.Google Scholar
- Lauritzen, S. 1996. Graphical Models. Oxford: Oxford University Press.Google Scholar
- Madigan, D. and York, J. 1995. Bayesian graphical models for discrete data. International Statistical Review, 63:215–232.Google Scholar
- Whittaker, J. 1990. Graphical Models in Applied Multivariate Statistics. New York: Wiley.Google Scholar