A Sequential Monte Carlo Method for Bayesian Analysis of Massive Datasets

Data Mining and Knowledge Discovery

Volumn 7, Issue 3, 2003, Pages 301-319

  Ridgeway, Greg ^a   Madigan, David ^b  

^a RAND CORPORATION   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

Bayesian inference; Importance sampling; Markov chain Monte Carlo; Massive datasets; Mixture model; Particle filter

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SIMULATION; ESTIMATION; ITERATIVE METHODS; MARKOV PROCESSES; MATHEMATICAL MODELS; MONTE CARLO METHODS;

BAYSEIAN INFERENCE; DATA SQUASHING; MASSIVE DATASETS; PARTICLE FILTERS;

DATA MINING;

EID: 0037527978     PISSN: 13845810     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1024084221803     Document Type: Conference Paper

References (32)

1. Andrieu, C., de Freitas, N., Doucet, A., and Jordan, M.I. 2003. An introduction to MCMC for machine learning. Machine Learning, 50(1/2).
2. Besag, J., Green, P., Higdon, D., and Mengersen, K. 1995. Bayesian computation and stochastic systems (with Discussion). Statistical Science, 10:3-41.
3. Cadez, I., Heckerman, D., Meek, C., Smyth, P., and White, S. 2000. Visualization of navigation patterns on a web site using model-based clustering. Technical Report MSR-TR-00-18, Microsoft Research.
4. Carlin, B. and Louis, T. 2000. Bayes and Empirical Bayes Methods for Data Analysis, 2nd edition. Boca Raton, PL: Chapman and Hall.
5. Chopin, N. 2002. A sequential particle filter method for static models. Biometrika, 89(3):539-552.
6. DeGroot, M. 1970. Optimal Statistical Decisions. New York: McGraw-Hill.
7. Doucet, A., de Freitas, N., and Gordon, N. 2001. Sequential Monte Carlo Methods in Practice. Springer-Verlag.
8. DuMouchel, W. 1999. Bayesian data mining in large frequency tables, with an application to the FDA spontaneous reporting system (with Discussion). The American Statistician, 53(3): 177-190.
9. Elder, J. and Pregibon, D. 1996. A statistical perspective on knowledge discovery in databases. In Advances in Knowledge Discovery and Data Mining, U.M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy (Eds.). AAAI/MIT Press, Chap. 4.
10. Figueiredo, M. 2001. Adaptive sparseness using Jeffreys prior. In Neural Information Processing Systems - NIPS 2001.
11. Figueiredo, M. and Jain, A.K. 2001. Bayesian learning of sparse classifiers. In Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition - CVPR'2001.
12. Friedman, N., Nachman, I., and Peer, D. 1999. Learning Bayesian network structures from massive datasets: The sparse candidate algorithm. In Proceedings of the Fifteenth Conference on Uncertainty in Articial Intelligence (UAI99), pp. 206-215.
13. Gelman, A., Carlin, J., Stern, H., and Rubin, D. 1995. Bayesian Data Analysis. New York: Chapman Hall.
14. Geman, S. and Geman, D. 1984. Stochastic relaxation, Gibbs distributions and the Bayesian restoration of images. IEEE Transactions on Pattern Analysis and Machine Intelligence, 6:721-741.
15. Gilks, W. and Berzuini, C. 2001. Following a moving target-Monte Carlo inference for dynamic Bayesian models. Journal of the Royal Statistical Society B, 63(1):127-146.
16. Gilks, W., Richardson, S., and Spiegelhalter, D.J. (Eds.). 1996. Markov Chain Monte Carlo in Practice. London: Chapman and Hall.
17. Girosi, F. 1998. An Equivalence Between Sparse Approximation and Support Vector Machines. Neural Computation, 10:1455-1480.
18. Glymour, C., Madigan, D., Pregibon, D., and Smyth, P. 1997. Statistical themes and lessons for data mining. Data Mining and Knowledge Discovery, 1(1):11-28.
19. Hastings, W.K. 1970. Monte Carlo sampling methods using Markov Chains and their applications. Biometrika, 57:97-109.
20. Ju, W.-H., Madigan, D., and Scott, S. 2002. On Bayesian learning of sparse classifiers. Technical report, Rutgers University. Available at http://stat.rutgers.edu/̃madigan/PAPERS/sparse3.ps.
21. Kong, A., Liu, J., and Wong, W. 1994. Sequential imputation and Bayesian missing data problems. Journal of the American Statistical Association, 89:278-288.
22. Le Cam, L. and Yang, G. 1990. Asymptotics in Statistics: Some Basic Concepts. New York: Springer-Verlag.
23. Madigan, D., Raghavan, N., DuMouchel, W., Nason, M., Posse, C., and Ridgeway, G. 2002. Likelihood-based data squashing: A modeling approach to instance construction. Data Mining and Knowledge Discovery, 6(2): 173-190.
24. Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A., and Teller, E. 1953. Equations of state calculations by fast computing machine. Journal of Chemical Physics, 21:1087-1091.
25. Posse, C. 2001. Hierarchical model-based clustering for large datasets. Journal of Computational and Graphical Statistics, 10(3):46-486.
26. Ramoni, M., Sebastiani, P., and Cohen, P. 2002. Bayesian clustering by dynamics. Machine Learning, 47(1):91-121.
27. Ridgeway, G. 1997. Finite discrete Markov process clustering. Technical Report MSR-TR-97-24, Microsoft Research.
28. Ripley, B. 1987. Stochastic Simulation. New York: Wiley.
29. Ross, S.M. 1993. Probability Models, 5th edition, San Diego: Academic Press.
30. Tibshirani, R. 1995. Regression selection and shrinkage via the lasso. Journal of the Royal Statistical Society, Series B, 57:267-288.
31. Tipping, M.E. 2001. Sparse Bayesian learning and the relevance vector machine. Journal of Machine Learning Research, 1:211-244.
32. Zhang, T. and Oles, F.J. 2001. Text categorization based on regularized linear classification methods. Information Retrieval, 4:5-31.