Theory of matching pursuit

Advances in Neural Information Processing Systems 21 - Proceedings of the 2008 Conference

Volumn , Issue , 2009, Pages 721-728

  Hussain, Zakria ^a   Shawe Taylor, John ^a  

^a UNIVERSITY COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

COMPRESSION SCHEME; FUTURE LOSS; KERNEL MATCHING PURSUIT; KERNEL PRINCIPAL COMPONENT ANALYSES (KPCA); MATCHING PURSUIT; MATCHING PURSUIT ALGORITHMS; RELATED ALGORITHMS; SAMPLE COMPRESSION; UPPER BOUND;

PRINCIPAL COMPONENT ANALYSIS;

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

References (11)

1. M. Anthony. Partitioning points by parallel planes. Discrete Mathematics, 282:17-21, 2004.
2. S. Floyd and M. Warmuth. Sample compression, learnability, and the Vapnik-Chervonenkis dimension. Machine Learning, 21(3):269-304, 1995.
3. N. Littlestone and M. K. Warmuth. Relating data compression and learnability. Technical report, University of California Santa Cruz, Santa Cruz, CA, 1986.
4. S. Mallat and Z. Zhang. Matching pursuit with time-frequency dictionaries. IEEE Transactions on Signal Processing, 41(12):3397-3415, 1993.
5. B. Schölkopf and A. Smola. Learning with Kernels. MIT Press, Cambridge, MA, 2002.
6. J. Shawe-Taylor and N. Cristianini. Kernel Methods for Pattern Analysis. Cambridge University Press, Cambridge, U.K., 2004.
7. J. Shawe-Taylor, C. K. I.Williams, N. Cristianini, and J. Kandola. On the eigenspectrum of the Gram matrix and the generalization error of kernel-PCA. IEEE Transactions on Information Theory, 51(7):2510-2522, 2005. (Pubitemid 41136405)
8. A. J. Smola and B. Schölkopf. Sparse greedy matrix approximation for machine learning. In Proceedings of 17th International Conference on Machine Learning, pages 911-918. Morgan Kaufmann, San Francisco, CA, 2000.
9. V. N. Vapnik and A. Y. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications, 16(2):264-280, 1971.
10. P. Vincent and Y. Bengio. Kernel matching pursuit. Machine Learning, 48:165-187, 2002. (Pubitemid 34247577)
11. C. K. I. Williams and M. Seeger. Using the Nyström method to speed up kernel machines. In Advances in Neural Information Processing Systems, volume 13, pages 682-688. MIT Press, 2001.