Orthogonal series density estimation and the kernel eigenvalue problem

Neural Computation

Volumn 14, Issue 3, 2002, Pages 669-688

  Girolami, Mark ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTICLE;

EID: 0012993529     PISSN: 08997667     EISSN: None     Source Type: Journal    
DOI: 10.1162/089976602317250942     Document Type: Article

References (17)

1. Delves, L. M., & Mohamed, J. L. (1985). Computational methods for integral equations. Cambridge: Cambridge University Press.
2. Diggle, P. J., & Hall, P. (1986). The selection of terms in an orthogonal series density estimator. Journal of the American Statistical Association, 81, 230-233.
3. Friedman, J. H., & Tukey, J. W. (1974). A projection pursuit algorithm for exploratory data analysis. IEEE Transactions on Computing, 23, 881-890.
4. Izenman, A. J. (1991). Recent developments in nonparametric density estima-tion. Journal of the American Statistical Association, 86, 205-224.
5. Kreyszig E. (1989). Introductory functional analysis with applications. New York: Wiley.
6. Kronmal, R., & Tarter, M. (1968). The estimation of probability densities and cumulatives by Fourier series methods. Journal of the American Statistical Association, 63, 925-952.
7. Mukherjee, S., & Vapnik, V. (1999). Support vector method for multivariate density estimation (AI Memo 1653). Available at: ftp://publications.ai. mit.edu/ai-publications/1500-1999/AIM-1653.ps.
8. Ogawa, H., & Oja, E. (1986). Can we solve the continuous Karhunen-Loève eigenproblem from discrete data? Transactions of the IECE of Japan, 69(9), 1020-1029.
9. Principe, J., Fisher III, J., & Xu, D. (2000). Information theoretic learning. In S. Haykin (Ed.), Unsupervised adaptive filtering. New York: Wiley.
10. Rosipal, R., & Girolami, M. (2001). An expectation maximisation approach to nonlinear component analysis. Neural Computation, 13(3), 500-505.
11. Schölkopf, B., Bruges, C., & Smola, A. (Eds.). (1999). Advances in kernel methods-Support vector learning. Cambridge, MA: MIT Press.
12. Schölkopf, B., Smola, A., & Müller, K. R. (1996). Nonlinear component analysis as a kernel eigenvalue problem (Tech. Rep. MPI TR. 44). Available at: http://www.kernel-machines.org
13. Schölkopf, B., Smola, A., & Müller, K. R. (1998). Nonlinear component analysis as a kernel eigenvalue problem. Neural Computation, 10(5), 1299-1319.
14. Tou, J. T., & Gonzalez, R. C. (1974). Pattern recognition principles. Reading, MA: Addison-Wesley.
15. Williams, C. K. I., & Seeger, M. (2000). The effect of the input density distribution on kernel-based classifiers. In P. Langley (Ed.), Proceedings of the Seventeenth International Conference on Machine Learning, 2000 (pp. 1159-1166). San Mateo, CA: Morgan Kaufmann.
16. Williams, C. K. I., & Seeger, M. (2001). Using the Nyström method to speed up kernel machines. In T. K. Leen, T. G. Dietterich, & V. Tresp (Eds.), Advances in neural information processing systems, 13 (pp. 682-688). Cambridge, MA: MIT Press.
17. Zhu, H., Williams, C. K. I., Rohwer, R. J., & Morciniec, M. (1998). Gaussian regression and optimal finite dimensional linear models. In C. M. Bishop (Ed.), Neural networks and machine learning. Berlin: Springer-Verlag.