On speeding up computation in information theoretic learning

Proceedings of the International Joint Conference on Neural Networks

Volumn , Issue , 2009, Pages 2883-2887

  Seth, Sohan ^a   Príncipe, José C ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EIGEN-STRUCTURE; GRAM MATRICES; INFORMATION THEORETIC LEARNING; KERNEL BASED METHODS; KERNEL-BASED LEARNING; MATRIX; NUMBER OF SAMPLES; POSITIVE DEFINITE; POSITIVE DEFINITENESS; RECENT PROGRESS;

COMPUTATIONAL COMPLEXITY; EDUCATION; ESTIMATION; INFORMATION THEORY; NEURAL NETWORKS;

MATRIX ALGEBRA;

EID: 70449395271     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IJCNN.2009.5178933     Document Type: Conference Paper

References (14)

1. S. Bochner, "Hilbert distances and positive definite functions, " Annals of Mathematics, vol. 42, no. 3, pp. 647-656, Jul. 1941.
2. B. E. Boser, I. M. Guyon, and V. N. Vapnik, "A training algorithm for optimal margin classifiers, " Proceedings of the fifth annual workshop on Computational learning theory, pp. 144-152, 1992.
3. B. Schölkopf, A. Smola, and K.-R. Müller, "Nonlinear component analysis as a kernel eigenvalue problem, " Neural Comput., vol. 10, no. 5, pp. 1299-1319, 1998.
4. F. R. Bach and M. I. Jordan, "Kernel independent component analysis, " Journal of Machine Learning Research, vol. 3, pp. 1-48, 2002.
5. A. Gretton, R. Herbrich, A. Smola, O. Bousquet, and B. Scholkopf, "Kernel methods for measuring independence, " Journal of Machine Learning Research, vol. 6, pp. 2075-2129, 2005.
6. A. J. Smola and B. Schölkopf, "Sparse greedy matrix approximation for machine learning, " Proc. 17th International Conf. on Machine Learning, pp. 911-918, 2000. [Online]. Available: http://citeseer.ist.psu.edu/smola00sparse.html
7. C. K. I. Williams and M. Seeger, "The effect of the input density distribution on kernel-based classifiers, " Proc. 17th International Conf. on Machine Learning, pp. 1159-1166, 2000. [Online]. Available: http://citeseer.ist.psu.edu/529635.html
8. S. Fine, K. Scheinberg, N. Cristianini, J. Shawe-taylor, and B. Williamson, "Efficient svm training using low-rank kernel representations, " Journal of Machine Learning Research, vol. 2, pp. 243-264, 2001.
9. J. W. Xu, A. R. C. Paiva, I. Park, and J. C. Principe, "A reproducing kernel hilbert space framework for informationtheoretic learning, " Signal Processing, IEEE Transactions on, vol. 56, no. 12, pp. 5891-5902, 2008. [Online]. Available: http://dx.doi.org/10.1109/TSP.2008.2005085
10. E. Parzen, "On estimation of a probability density function and mode, " Annals of Mathematical Statistics, vol. 33-3, pp. 1065-1076, 1962.
11. J.-W. Xu, H. Bakardjian, A. Cichocki, and J. C. Principe, "A new nonlinear similarity measure for multichannel signals, " Neural Netowrks, vol. 21, pp. 222-231, 2008.
12. G. H. Golub and C. F. Van Loan, Matrix Computation, 3rd ed. Baltimore, Maryland: The Johns Hopkins University Press, 1996.
13. F. R. Bach and M. I. Jordan, "Predictive low-rank decomposition for kernel methods, " in Proceedings of the Twenty-second International Conference on Machine Learning (ICML). ACM Press, 2005, pp. 33-40.
14. [Online]. Available: http://archive.ics.uci.edu/ml