scholarly journals Least Squares Support Vector Machine Regression Based on Sparse Samples and Mixture Kernel Learning

2021 ◽  
Vol 50 (2) ◽  
pp. 319-331
Author(s):  
Wenlu Ma ◽  
Han Liu

Least squares support vector machine (LSSVM) is a machine learning algorithm based on statistical theory. Itsadvantages include robustness and calculation simplicity, and it has good performance in the data processingof small samples. The LSSVM model lacks sparsity and is unable to handle large-scale data problem, this articleproposes an LSSVM method based on mixture kernel learning and sparse samples. This algorithm reduces theinitial training set to a sub-dataset using a sparse selection strategy. It converts the single kernel function in theLSSVM model into a mixed kernel function and optimizes its parameters. The reduced sub-dataset is used fortraining LSSVM. Finally, a group of datasets in the UCI Machine Learning Repository were used to verify theeffectiveness of the proposed algorithm, which is applied to real-world power load data to achieve better fittingand improve the prediction accuracy.

2020 ◽  
Vol 36 (12) ◽  
pp. 3766-3772 ◽  
Author(s):  
Arezou Rahimi ◽  
Mehmet Gönen

Abstract Motivation Genomic information is increasingly being used in diagnosis, prognosis and treatment of cancer. The severity of the disease is usually measured by the tumor stage. Therefore, identifying pathways playing an important role in progression of the disease stage is of great interest. Given that there are similarities in the underlying mechanisms of different cancers, in addition to the considerable correlation in the genomic data, there is a need for machine learning methods that can take these aspects of genomic data into account. Furthermore, using machine learning for studying multiple cancer cohorts together with a collection of molecular pathways creates an opportunity for knowledge extraction. Results We studied the problem of discriminating early- and late-stage tumors of several cancers using genomic information while enforcing interpretability on the solutions. To this end, we developed a multitask multiple kernel learning (MTMKL) method with a co-clustering step based on a cutting-plane algorithm to identify the relationships between the input tasks and kernels. We tested our algorithm on 15 cancer cohorts and observed that, in most cases, MTMKL outperforms other algorithms (including random forests, support vector machine and single-task multiple kernel learning) in terms of predictive power. Using the aggregate results from multiple replications, we also derived similarity matrices between cancer cohorts, which are, in many cases, in agreement with available relationships reported in the relevant literature. Availability and implementation Our implementations of support vector machine and multiple kernel learning algorithms in R are available at https://github.com/arezourahimi/mtgsbc together with the scripts that replicate the reported experiments. Supplementary information Supplementary data are available at Bioinformatics online.


2019 ◽  
Vol 233-234 ◽  
pp. 196-207 ◽  
Author(s):  
Bangzhu Zhu ◽  
Shunxin Ye ◽  
Minxing Jiang ◽  
Ping Wang ◽  
Zhanchi Wu ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document