Maximum Entropy Approximation for Kernel Machines
2006 16th IEEE Signal Processing Society Workshop on Machine Learning for Signal Processing(2006)
摘要
Kernel machines are widely used in pattern recognition, exploratory data analysis, and statistical signal processing, due to their effectiveness of modeling nonlinear dependencies in the data. The computational burden in evaluating forward functions in testing is the main drawback for kernel machines, especially in high dimensional large training set situations. We present a separable maximum entropy approximation for kernel machines that reduce the computational load for forward function evaluation. The performance of the approximation is demonstrated on kernel-based discriminative nonlinear projections on benchmark datasets.
更多查看译文
关键词
maximum entropy approximation,kernel machines,pattern recognition,exploratory data analysis,statistical signal processing,data nonlinear dependency modeling,forward functions,kernel-based discriminative nonlinear projection,convex optimization
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络