Association Models for Web Mining
Data Mining and Knowledge DiscoveryPublished 1 July 2001
Paolo Giudici, Robert Castelo
Citations20
SJR quartileQ1
SJR score1.02
SNIP1.88
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
How statistical association models and, specifically, graphical models, can be usefully employed to model web mining data are described and model selection procedures are discussed.
Abstract
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.
Keywords
Computer Science
arXiv (Cornell University)Empirical Analysis of Predictive Algorithms for Collaborative Filtering
4,515 Citations2013John S. Breese, David Heckerman +1 more
Machine LearningLearning Bayesian Networks: The Combination of Knowledge and Statistical Data
3,242 Citations1995David Heckerman, Dan Geiger +1 more
A methodology for assessing informative priors needed for learning Bayesian networks from a combination of prior knowledge and statistical data is developed and how to compute the relative posterior probabilities of network structures given data is shown.
Graphical Models
2,780 Citations1996Steffen L. Lauritzen
TechnometricsGraphical Models in Applied Multivariate Statistics
1,827 Citations1991Colin Goodall, Joe Whittaker
International Statistical ReviewBayesian Graphical Models for Discrete Data
1,115 Citations1995David Madigan, Jeremy York +1 more
Journal of the Royal Statistical Society Series D (The Statistician)Markov chain Monte Carlo method and its application
841 Citations1998Stephen P. Brooks
A simple changepoint model is used to illustrate how to tackle a typical Bayesian modelling problem via the MCMC method, before using mixture model problems to provide illustrations of good sampler output and of the implementation of a reversible jump MCMC algorithm.
BiometrikaDecomposable graphical Gaussian model determination
251 Citations1999Paolo Giudici
A hyper inverse Wishart prior distribution on the concentration matrix for each given graph is considered, containing only the elements for which the corresponding element of the inverse is nonzero, allowing all computations to be performed locally, at the clique level, which is a clear advantage for the analysis of large and complex datasets.
Machine LearningImproving Markov Chain Monte Carlo Model Search for Data Mining
174 Citations2003Paolo Giudici, Robert Castelo
The motivation of this paper is the application of MCMC model scoring procedures to data mining problems, involving a large number of competing models and other relevant model choice aspects, and the proposed MC3 algorithm, which provides an efficient general framework for computations with both Directed Acyclic Graphical (DAG) models and Undirected Decomposable Models (UDG).