Sciweavers

1235 search results - page 75 / 247
» Learning with Idealized Kernels
Sort
View
AAAI
2012
12 years 11 days ago
Semi-Supervised Kernel Matching for Domain Adaptation
In this paper, we propose a semi-supervised kernel matching method to address domain adaptation problems where the source distribution substantially differs from the target distri...
Min Xiao, Yuhong Guo
IDEAL
2004
Springer
14 years 3 months ago
Generating and Applying Rules for Interval Valued Fuzzy Observations
Abstract. One of the objectives of intelligent data engineering and automated learning is to develop algorithms that learn the environment, generate rules, and take possible course...
André de Korvin, Chenyi Hu, Ping Chen
IDEAL
2004
Springer
14 years 3 months ago
Orthogonal Least Square with Boosting for Regression
A novel technique is presented to construct sparse regression models based on the orthogonal least square method with boosting. This technique tunes the mean vector and diagonal c...
Sheng Chen, Xunxian Wang, David J. Brown
ICIP
2010
IEEE
13 years 8 months ago
Combining free energy score spaces with information theoretic kernels: Application to scene classification
Most approaches to learn classifiers for structured objects (e.g., images) use generative models in a classical Bayesian framework. However, state-of-the-art classifiers for vecto...
Manuele Bicego, Alessandro Perina, Vittorio Murino...
ADCM
2007
114views more  ADCM 2007»
13 years 10 months ago
Convergence analysis of online algorithms
In this paper, we are interested in the analysis of regularized online algorithms associated with reproducing kernel Hilbert spaces. General conditions on the loss function and st...
Yiming Ying