Kernel methods for missing variables

AISTATS 2005 - Proceedings of the 10th International Workshop on Artificial Intelligence and Statistics

Volumn , Issue , 2005, Pages 325-332

  Smola, Alex J ^a   Vishwanathan, S V N ^a   Hofmann, Thomas ^b  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^b Brown Univerity   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONCAVE-CONVEX PROCEDURE; DATA SETS; ESTIMATION PROBLEM; EXPONENTIAL FAMILY; GAUSSIAN PROCESSES; INCOMPLETE DATA; INTUITIVE PROOF; KERNEL METHODS; MARGINAL DISTRIBUTION; MISSING DATA; OPTIMIZATION METHOD; OPTIMIZATION PROBLEMS; OPTIMIZATION SCHEME;

ARTIFICIAL INTELLIGENCE;

PROBLEM SOLVING;

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

References (16)

1. Y. Altun, T. Hofmann, and A.J. Smola. Exponential families for conditional random fields. In Uncertainty in Artificial Intelligence UAI, 2004.
2. S. Fine and K. Scheinberg. Efficient SVM training using low-rank kernel representations. Journal of Machine Learning Research, 2:243 - 264, Dec 2001. http://www.jmlr.org.
3. Z. Ghahramani and M. I. Jordan. Supervised learning from incomplete data via an EM approach. In J. D. Cowan, G. Tesauro, and J. Alspector, editors, Advances in Neural Information Processing Systems, volume 6, pages 120 - 127. Morgan Kaufmann Publishers, Inc., 1994.
4. R. E. Kass and P. W. Vos. Geomtrical Foundations of Asymptotic Inference. Wiley series in Probability and Statistics. Wiley Interscience, 1997.
5. J. Kivinen, A.J. Smola, and R. C. Williamson. Online learning with kernels. IEEE Transactions on Signal Processing, 2003. To Appear.
6. S. L. Lauritzen. Graphical Models. Oxford University Press, 1996.
7. Y. LeCun, B. Boser, J. S. Denker, D. Henderson, R. E. Howard, W. Hubbard, and L. J. Jackel. Backpropagation applied to handwritten zip code recognition. Neural Computation, 1:541 - 551, 1989.
8. W. H. Press, S. A. Teukolsky, W. T. Vetterhing, and B. P. Flannery. Numerical Recipes in C. The Art of Scientific Computation. Cambridge University Press, 1994.
9. G. Rätsch, S. Mika, and A.J. Smola. Adapting codes and embeddings for polychotomies. In Neural Information Processing Systems, volume 15. MIT Press, 2002.
10. B. Schölkopf. Support Vector Learning. R. Oldenbourg Verlag, München, 1997. Doktorarbeit, TU Berlin. Download: http://www.kernel- machines.org.
11. B. Schölkopf, R. Herbrich, and A.J. Smola. A generalized representer theorem. In Proceedings of the Annual Conference on Computational Learning Theory, pages 416 - 426, 2001.
12. B. Schölkopf and A.J. Smola. Learning with Kernels. MIT Press, 2002.
13. A.J. Smola and B. Schölkopf. Sparse greedy matrix approximation for machine learning. In P. Langley, editor, Proceedings of the International Conference on Machine Learning, pages 911 - 918, San Francisco, 2000. Morgan Kaufmann Publishers.
14. M. J. Wainwright and M. I. Jordan. Graphical models, exponential families, and variational inference. Technical Report 649, UC Berkeley, Department of Statistics, September 2003.
15. C. K. I. Williams. Prediction with Gaussian processes: From linear regression to linear prediction and beyond. In M. I. Jordan, editor, Learning and Inference in Graphical Models, pages 599 - 621. MIT Press, 1999.
16. A.L. Yuille and A. Rangarajan. The concave-convex procedure. Neural Computation, 15:915 - 936, 2003.