Stochastic classification models

International Congress of Mathematicians, ICM 2006

Volumn 3, Issue , 2006, Pages 669-686

  McCullagh, Peter ^a   Yang, Jie ^a  

^a UNIVERSITY OF CHICAGO   (United States)

Author keywords

Cluster process; Cox process; Dirichlet process; Gauss Ewens process; Lack of interference; Marked point process; Permanent polynomial; Random subset; Supervised learning

Indexed keywords

CLUSTER PROCESS; COX PROCESS; DIRICHLET PROCESS; GAUSS-EWENS PROCESS; MARKED POINT PROCESS; RANDOM SUBSETS;

RANDOM PROCESSES; SUPERVISED LEARNING; VARIATIONAL TECHNIQUES;

STOCHASTIC MODELS;

EID: 69249186635     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. Aldous, D., Probability distributions on cladograms. In Random Discrete Structures (ed. by D. Aldous and R. Pemantle), IMA Vol. Math. Appl. 76, Springer-Verlag, New York 1995, 1-18.
2. Antoniak, C. E., Mixtures of Dirichlet processes with applications to Bayesian nonparametric problems. Ann. Statist. 2 (1974), 1152-1174.
3. Barvinok, A. I., Two algorithmic results for the traveling salesman problem. Math. Oper. Res. 21 (1996), 65-84.
4. Blei, D., Ng, A., Jordan, M., Latent Dirichlet allocation. J. Mach. Learn. Res. 3 (2003), 993-1022.
5. Cox, D. R., Some statistical methods connected with series of events. J. Roy. Statist. Soc. Ser. B 17 (1955), 129-164.
6. Cox, D. R., Planning of Experiments.Wiley Publ. Appl. Statist., Wiley, New York 1958.
7. Daley D., Vere-Jones, D., An Introduction to the Theory of Point Processes. 2nd edition, Probab. Appl. (N.Y.), Springer-Verlag, New York 2003.
8. Daumé, H., Marcu, D., A Bayesian model for supervised clustering with the Dirichlet process prior. J. Mach. Learn. Res. 6 (2005), 1551-1577.
9. Donoho, D., Johnstone, I., Kerkyacharian, G., Picard, D., Wavelet shrinkage: asymptopia? J. Roy. Statist. Soc. Ser. B 57 (1995), 301-369.
10. Ewens, W. J., The sampling theory of selectively neutral alleles. Theoret. Population Biology 3 (1972), 87-112.
11. Ferguson, T., A Bayesian analysis of some nonparametric problems. Ann. Statist. 1 (1973), 209-230.
12. Fisher, R.A., The use of multiple measurements in taxonomic problems. Annals of Eugenics 7 (1936), 179-188.
13. Freund, Y., Schapire, R., Experiments with a new boosting algorithm. In Machine Learning: Proceedings of the Thirteenth International Conference, Morgan Kauffman, San Francisco 1996, 148-156.
14. Gopalan, R., Berry, D., Bayesian multiple comparisons using Dirichlet process priors. J. Amer. Statist. Assoc. 93 (1998), 1130-1139.
15. Green, P., Silverman, B., Nonparametric Regression and Generalized Linear Models. Monogr. Statist. Appl. Probab. 58, Chapman and Hall, London, 1994.
16. Hastie, T., Tibshirani, R., Friedman, J., The Elements of Statistical Learning: Data Mining, Inference, and Prediction. Springer Ser. Statist., Springer-Verlag, New York 2001.
17. Hartigan, J. A., Partition models. Comm. Statist. Theory Methods 19 (1990), 2745-2756.
18. Jerrum, M., Sinclair, A., Vigoda, E., A polynomial-time approximation algorithm for approximating the permanent of a matrix with non-negative entries. In Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, ACM Press, New York 2001, 712-721.
19. Kingman, J. F. C., Mathematics of Genetic Diversity. CBMS-NSF Regional Conf. Ser. in Appl. Math. 34, SIAM, Philadelphia, PA, 1980.
20. Kingman, J. F. C., Poisson Processes. Oxford Stud. Probab. 3, Clarendon Press, Oxford University Press, Oxford 1993.
21. Macchi, O., The coincidence approach to stochastic point processes. Adv. in Appl. Probab. 7 (1975), 83-122.
22. McCullagh, P., Møller, J., The permanent process. 2005; available via http://www.stat.uchicago.edu/~pmcc/permanent.pdf.
23. Minc, H., Permanents. Encyclopedia Math. Appl. 6, Addison-Wesley, Reading, MA, 1978.
24. Pitman, J., Some developments of the Blackwell-MacQueen urn scheme. In Statistics, Probability and Game Theory: Papers in Honor of David Blackwell (ed. by T. S. Ferguson et al.), IMS Lecture Notes Monogr. Ser. 30, Hayward, CA, 1996, 245-267.
25. Pitman, J., Combinatorial Stochastic Processes (Ecole d'Eté de Probabilités de Saint-Flour XXXII, 2002). Lecture Notes in Math. 1875, Springer-Verlag, Berlin 2006.
26. Rubin, D., Which Ifs have causal answers? J. Amer. Statist. Assoc. 81 (1986), 961-962.
27. Ripley, B., Pattern recognition and Neural Networks. Cambridge University Press, Cambridge 1996.
28. Valiant, L. G., The complexity of computing the permanent. Theoret. Comput. Sci. 8 (1979), 189-201.
29. Wahba, G., Spline Models for Observational Data. CBMS-NSF Regional Conf. Ser. in Appl. Math. 59. SIAM, Philadelphia, PA, 1990.