scholarly journals Multiple Kernel Feature Line Embedding for Hyperspectral Image Classification

2019 ◽  
Vol 11 (24) ◽  
pp. 2892 ◽  
Author(s):  
Ying-Nong Chen
Keyword(s):  
Dimension Reduction ◽  
Hyperspectral Image ◽  
Kernel Method ◽  
Kernel Learning ◽  
Support Vector ◽  
Kernel Pca ◽  
Kernel Weights ◽  
Multiple Kernel ◽  
Feature Line ◽  
Supervised Dimension Reduction

In this study, a novel multple kernel FLE (MKFLE) based on general nearest feature line embedding (FLE) transformation is proposed and applied to classify hyperspectral image (HSI) in which the advantage of multple kernel learning is considered. The FLE has successfully shown its discriminative capability in many applications. However, since the conventional linear-based principle component analysis (PCA) pre-processing method in FLE cannot effectively extract the nonlinear information, the multiple kernel PCA (MKPCA) based on the proposed multple kernel method was proposed to alleviate this problem. The proposed MKFLE dimension reduction framework was performed through two stages. In the first multple kernel PCA (MKPCA) stage, the multple kernel learning method based on between-class distance and support vector machine (SVM) was used to find the kernel weights. Based on these weights, a new weighted kernel function was constructed in a linear combination of some valid kernels. In the second FLE stage, the FLE method, which can preserve the nonlinear manifold structure, was applied for supervised dimension reduction using the kernel obtained in the first stage. The effectiveness of the proposed MKFLE algorithm was measured by comparing with various previous state-of-the-art works on three benchmark data sets. According to the experimental results: the performance of the proposed MKFLE is better than the other methods, and got the accuracy of 83.58%, 91.61%, and 97.68% in Indian Pines, Pavia University, and Pavia City datasets, respectively.

scholarly journals Efficient Multiple Kernel Learning Algorithms Using Low-Rank Representation

2017 ◽  
Vol 2017 ◽  
pp. 1-9 ◽  
Author(s):  
Wenjia Niu ◽  
Kewen Xia ◽  
Baokai Zu ◽  
Jianchuan Bai
Keyword(s):  
Recognition Accuracy ◽  
Multiple Kernel Learning ◽  
Low Rank ◽  
Kernel Learning ◽  
Support Vector ◽  
Distribution Characteristics ◽  
Kernel Weights ◽  
Multiple Kernel ◽  
Kernel Approximation ◽  
Low Rank Representation

Unlike Support Vector Machine (SVM), Multiple Kernel Learning (MKL) allows datasets to be free to choose the useful kernels based on their distribution characteristics rather than a precise one. It has been shown in the literature that MKL holds superior recognition accuracy compared with SVM, however, at the expense of time consuming computations. This creates analytical and computational difficulties in solving MKL algorithms. To overcome this issue, we first develop a novel kernel approximation approach for MKL and then propose an efficient Low-Rank MKL (LR-MKL) algorithm by using the Low-Rank Representation (LRR). It is well-acknowledged that LRR can reduce dimension while retaining the data features under a global low-rank constraint. Furthermore, we redesign the binary-class MKL as the multiclass MKL based on pairwise strategy. Finally, the recognition effect and efficiency of LR-MKL are verified on the datasets Yale, ORL, LSVT, and Digit. Experimental results show that the proposed LR-MKL algorithm is an efficient kernel weights allocation method in MKL and boosts the performance of MKL largely.

A spectral clustering with self-weighted multiple kernel learning method for single-cell RNA-seq data

2020 ◽  
Author(s):  
Ren Qi ◽  
Jin Wu ◽  
Fei Guo ◽  
Lei Xu ◽  
Quan Zou
Keyword(s):  
Single Cell ◽  
Spectral Clustering ◽  
Kernel Method ◽  
Multiple Kernel Learning ◽  
Superior Performance ◽  
Kernel Learning ◽  
Support Vector ◽  
Multiple Kernel ◽  
Proposed Model ◽  
Similarity Information

Abstract Single-cell RNA-sequencing (scRNA-seq) data widely exist in bioinformatics. It is crucial to devise a distance metric for scRNA-seq data. Almost all existing clustering methods based on spectral clustering algorithms work in three separate steps: similarity graph construction; continuous labels learning; discretization of the learned labels by k-means clustering. However, this common practice has potential flaws that may lead to severe information loss and degradation of performance. Furthermore, the performance of a kernel method is largely determined by the selected kernel; a self-weighted multiple kernel learning model can help choose the most suitable kernel for scRNA-seq data. To this end, we propose to automatically learn similarity information from data. We present a new clustering method in the form of a multiple kernel combination that can directly discover groupings in scRNA-seq data. The main proposition is that automatically learned similarity information from scRNA-seq data is used to transform the candidate solution into a new solution that better approximates the discrete one. The proposed model can be efficiently solved by the standard support vector machine (SVM) solvers. Experiments on benchmark scRNA-Seq data validate the superior performance of the proposed model. Spectral clustering with multiple kernels is implemented in Matlab, licensed under Massachusetts Institute of Technology (MIT) and freely available from the Github website, https://github.com/Cuteu/SMSC/.

scholarly journals Self-weighted Multiple Kernel Learning for Graph-based Clustering and Semi-supervised Classification

2018 ◽  
Author(s):  
Zhao Kang ◽  
Xiao Lu ◽  
Jinfeng Yi ◽  
Zenglin Xu
Keyword(s):  
Supervised Classification ◽  
Kernel Method ◽  
Empirical Studies ◽  
Multiple Kernel Learning ◽  
Kernel Learning ◽  
Unified Framework ◽  
Kernel Weights ◽  
Multiple Kernel ◽  
Benchmark Datasets ◽  
Graph Based Clustering

Multiple kernel learning (MKL) method is generally believed to perform better than single kernel method. However, some empirical studies show that this is not always true: the combination of multiple kernels may even yield an even worse performance than using a single kernel. There are two possible reasons for the failure: (i) most existing MKL methods assume that the optimal kernel is a linear combination of base kernels, which may not hold true; and (ii) some kernel weights are inappropriately assigned due to noises and carelessly designed algorithms. In this paper, we propose a novel MKL framework by following two intuitive assumptions: (i) each kernel is a perturbation of the consensus kernel; and (ii) the kernel that is close to the consensus kernel should be assigned a large weight. Impressively, the proposed method can automatically assign an appropriate weight to each kernel without introducing additional parameters, as existing methods do. The proposed framework is integrated into a unified framework for graph-based clustering and semi-supervised classification. We have conducted experiments on multiple benchmark datasets and our empirical results verify the superiority of the proposed framework.

scholarly journals Low-Resolution Tactile Image Recognition for Automated Robotic Assembly Using Kernel PCA-Based Feature Fusion and Multiple Kernel Learning-Based Support Vector Machine

2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Yi-Hung Liu ◽  
Yu-Tsung Hsiao ◽  
Wei-Teng Cheng ◽  
Yan-Chen Liu ◽  
Jui-Yiao Su
Keyword(s):  
Feature Fusion ◽  
Multiple Kernel Learning ◽  
Robotic Assembly ◽  
Kernel Learning ◽  
Support Vector ◽  
Tactile Sensing ◽  
Fourier Descriptors ◽  
Kernel Pca ◽  
Multiple Kernel ◽  
Tactile Image

In this paper, we propose a robust tactile sensing image recognition scheme for automatic robotic assembly. First, an image reprocessing procedure is designed to enhance the contrast of the tactile image. In the second layer, geometric features and Fourier descriptors are extracted from the image. Then, kernel principal component analysis (kernel PCA) is applied to transform the features into ones with better discriminating ability, which is the kernel PCA-based feature fusion. The transformed features are fed into the third layer for classification. In this paper, we design a classifier by combining the multiple kernel learning (MKL) algorithm and support vector machine (SVM). We also design and implement a tactile sensing array consisting of 10-by-10 sensing elements. Experimental results, carried out on real tactile images acquired by the designed tactile sensing array, show that the kernel PCA-based feature fusion can significantly improve the discriminating performance of the geometric features and Fourier descriptors. Also, the designed MKL-SVM outperforms the regular SVM in terms of recognition accuracy. The proposed recognition scheme is able to achieve a high recognition rate of over 85% for the classification of 12 commonly used metal parts in industrial applications.

scholarly journals A Multiple Kernel Learning Model Based on p-Norm

2018 ◽  
Vol 2018 ◽  
pp. 1-7 ◽  
Author(s):  
Jinshan Qi ◽  
Xun Liang ◽  
Rui Xu
Keyword(s):  
Multiple Kernel Learning ◽  
Research Society ◽  
Kernel Functions ◽  
Support Vector ◽  
Kernel Weights ◽  
Multiple Kernel ◽  
Vector Machines ◽  
Norm Constraint ◽  
Special Case ◽  
Elastic Constraint

By utilizing kernel functions, support vector machines (SVMs) successfully solve the linearly inseparable problems. Subsequently, its applicable areas have been greatly extended. Using multiple kernels (MKs) to improve the SVM classification accuracy has been a hot topic in the SVM research society for several years. However, most MK learning (MKL) methods employ L1-norm constraint on the kernel combination weights, which forms a sparse yet nonsmooth solution for the kernel weights. Alternatively, the Lp-norm constraint on the kernel weights keeps all information in the base kernels. Nonetheless, the solution of Lp-norm constraint MKL is nonsparse and sensitive to the noise. Recently, some scholars presented an efficient sparse generalized MKL (L1- and L2-norms based GMKL) method, in which L1  L2 established an elastic constraint on the kernel weights. In this paper, we further extend the GMKL to a more generalized MKL method based on the p-norm, by joining L1- and Lp-norms. Consequently, the L1- and L2-norms based GMKL is a special case in our method when p=2. Experiments demonstrated that our L1- and Lp-norms based MKL offers a higher accuracy than the L1- and L2-norms based GMKL in the classification, while keeping the properties of the L1- and L2-norms based on GMKL.

General Dimensional Multiple-Output Support Vector Regressions and Their Multiple Kernel Learning

2015 ◽  
Vol 45 (11) ◽  
pp. 2572-2584 ◽  
Author(s):  
Wooyong Chung ◽  
Jisu Kim ◽  
Heejin Lee ◽  
Euntai Kim
Keyword(s):  
Multiple Kernel Learning ◽  
Kernel Learning ◽  
Support Vector ◽  
Multiple Kernel

scholarly journals A Multiple Kernel Learning Approach for Air Quality Prediction

2018 ◽  
Vol 2018 ◽  
pp. 1-15 ◽  
Author(s):  
Hong Zheng ◽  
Haibin Li ◽  
Xingjian Lu ◽  
Tong Ruan
Keyword(s):  
Neural Network ◽  
Air Quality ◽  
Arima Model ◽  
Multiple Kernel Learning ◽  
Parametric Models ◽  
Kernel Learning ◽  
Support Vector ◽  
Quality Prediction ◽  
Air Quality Prediction ◽  
Multiple Kernel

Air quality prediction is an important research issue due to the increasing impact of air pollution on the urban environment. However, existing methods often fail to forecast high-polluting air conditions, which is precisely what should be highlighted. In this paper, a novel multiple kernel learning (MKL) model that embodies the characteristics of ensemble learning, kernel learning, and representative learning is proposed to forecast the near future air quality (AQ). The centered alignment approach is used for learning kernels, and a boosting approach is used to determine the proper number of kernels. To demonstrate the performance of the proposed MKL model, its performance is compared to that of classical autoregressive integrated moving average (ARIMA) model; widely used parametric models like random forest (RF) and support vector machine (SVM); popular neural network models like multiple layer perceptron (MLP); and long short-term memory neural network. Datasets acquired from a coastal city Hong Kong and an inland city Beijing are used to train and validate all the models. Experiments show that the MKL model outperforms the other models. Moreover, the MKL model has better forecast ability for high health risk category AQ.

Multiple kernel learning by empirical target kernel

2019 ◽  
Vol 18 (02) ◽  
pp. 1950058
Author(s):  
Peiyan Wang ◽  
Dongfeng Cai
Keyword(s):  
Multiple Kernel Learning ◽  
Heterogeneous Data ◽  
Classification Performance ◽  
Training Data ◽  
Kernel Learning ◽  
Kernel Weights ◽  
Heterogeneous Data Sources ◽  
Multiple Kernel ◽  
Global Target ◽  
Weighted Kernel

Multiple kernel learning (MKL) aims at learning an optimal combination of base kernels with which an appropriate hypothesis is determined on the training data. MKL has its flexibility featured by automated kernel learning, and also reflects the fact that typical learning problems often involve multiple and heterogeneous data sources. Target kernel is one of the most important parts of many MKL methods. These methods find the kernel weights by maximizing the similarity or alignment between weighted kernel and target kernel. The existing target kernels implement a global manner, which (1) defines the same target value for closer and farther sample pairs, and inappropriately neglects the variation of samples; (2) is independent of training data, and is hardly approximated by base kernels. As a result, maximizing the similarity to the global target kernel could make these pre-specified kernels less effectively utilized, further reducing the classification performance. In this paper, instead of defining a global target kernel, a localized target kernel is calculated for each sample pair from the training data, which is flexible and able to well handle the sample variations. A new target kernel named empirical target kernel is proposed in this research to implement this idea, and three corresponding algorithms are designed to efficiently utilize the proposed empirical target kernel. Experiments are conducted on four challenging MKL problems. The results show that our algorithms outperform other methods, verifying the effectiveness and superiority of the proposed methods.

Sign in / Sign up

Export Citation Format

Share Document