Multiple Kernel Learning for Spectral Dimensionality Reduction

2015 ◽  
pp. 626-634 ◽  
Author(s):  
Diego Hernán Peluffo-Ordóñez ◽  
Andrés Eduardo Castro-Ospina ◽  
Juan Carlos Alvarado-Pérez ◽  
Edgardo Javier Revelo-Fuelagán
Keyword(s):  
Dimensionality Reduction ◽  
Multiple Kernel Learning ◽  
Kernel Learning ◽  
Multiple Kernel ◽  
Spectral Dimensionality

scholarly journals Multiple Kernel Learning for Dimensionality Reduction

2011 ◽  
Vol 33 (6) ◽  
pp. 1147-1160 ◽  
Author(s):  
Yen-Yu Lin ◽  
Tyng-Luh Liu ◽  
Chiou-Shann Fuh
Keyword(s):  
Dimensionality Reduction ◽  
Multiple Kernel Learning ◽  
Kernel Learning ◽  
Multiple Kernel

A Conditional Entropy Minimization Criterion for Dimensionality Reduction and Multiple Kernel Learning

2010 ◽  
Vol 22 (11) ◽  
pp. 2887-2923 ◽  
Author(s):  
Hideitsu Hino ◽  
Noboru Murata
Keyword(s):  
Discriminant Analysis ◽  
Dimensionality Reduction ◽  
Multiple Kernel Learning ◽  
Conditional Entropy ◽  
Kernel Learning ◽  
Fisher Discriminant Analysis ◽  
Essential Information ◽  
Entropy Minimization ◽  
Fisher Discriminant ◽  
Multiple Kernel

Reducing the dimensionality of high-dimensional data without losing its essential information is an important task in information processing. When class labels of training data are available, Fisher discriminant analysis (FDA) has been widely used. However, the optimality of FDA is guaranteed only in a very restricted ideal circumstance, and it is often observed that FDA does not provide a good classification surface for many real problems. This letter treats the problem of supervised dimensionality reduction from the viewpoint of information theory and proposes a framework of dimensionality reduction based on class-conditional entropy minimization. The proposed linear dimensionality-reduction technique is validated both theoretically and experimentally. Then, through kernel Fisher discriminant analysis (KFDA), the multiple kernel learning problem is treated in the proposed framework, and a novel algorithm, which iteratively optimizes the parameters of the classification function and kernel combination coefficients, is proposed. The algorithm is experimentally shown to be comparable to or outperforms KFDA for large-scale benchmark data sets, and comparable to other multiple kernel learning techniques on the yeast protein function annotation task.

Robust Subspace Clustering Based on Automatic Weighted Multiple Kernel Learning

2021 ◽  
Author(s):  
Guo ◽  
Xiaoqian Zhang ◽  
Zhigui Liu ◽  
Xuqian Xue ◽  
Qian Wang ◽  
...  
Keyword(s):  
Multiple Kernel Learning ◽  
Subspace Clustering ◽  
Kernel Learning ◽  
Multiple Kernel

scholarly journals Multiple Kernel Learning With Minority Oversampling for Classifying Imbalanced Data

IEEE Access ◽  
2021 ◽  
Vol 9 ◽  
pp. 565-580
Author(s):  
Ling Wang ◽  
Hongqiao Wang ◽  
Guangyuan Fu
Keyword(s):  
Multiple Kernel Learning ◽  
Imbalanced Data ◽  
Kernel Learning ◽  
Multiple Kernel
Sign in / Sign up

Export Citation Format

Share Document