Regularized Embedded Multiple Kernel Dimensionality Reduction for Mine Signal Processing

Traditional multiple kernel dimensionality reduction models are generally based on graph embedding and manifold assumption. But such assumption might be invalid for some high-dimensional or sparse data due to the curse of dimensionality, which has a negative influence on the performance of multiple...

Full description

Bibliographic Details
Main Authors: Shuang Li, Bing Liu, Chen Zhang
Format: Article
Language:English
Published: Hindawi Limited 2016-01-01
Series:Computational Intelligence and Neuroscience
Online Access:http://dx.doi.org/10.1155/2016/4920670
id doaj-a41d39572d9546ac8fcd35807ee32ad3
record_format Article
spelling doaj-a41d39572d9546ac8fcd35807ee32ad32020-11-24T22:39:23ZengHindawi LimitedComputational Intelligence and Neuroscience1687-52651687-52732016-01-01201610.1155/2016/49206704920670Regularized Embedded Multiple Kernel Dimensionality Reduction for Mine Signal ProcessingShuang Li0Bing Liu1Chen Zhang2School of Management, China University of Mining and Technology, Xuzhou, Jiangsu 221116, ChinaSchool of Computer Science and Technology, China University of Mining and Technology, Xuzhou, Jiangsu 221116, ChinaSchool of Computer Science and Technology, China University of Mining and Technology, Xuzhou, Jiangsu 221116, ChinaTraditional multiple kernel dimensionality reduction models are generally based on graph embedding and manifold assumption. But such assumption might be invalid for some high-dimensional or sparse data due to the curse of dimensionality, which has a negative influence on the performance of multiple kernel learning. In addition, some models might be ill-posed if the rank of matrices in their objective functions was not high enough. To address these issues, we extend the traditional graph embedding framework and propose a novel regularized embedded multiple kernel dimensionality reduction method. Different from the conventional convex relaxation technique, the proposed algorithm directly takes advantage of a binary search and an alternative optimization scheme to obtain optimal solutions efficiently. The experimental results demonstrate the effectiveness of the proposed method for supervised, unsupervised, and semisupervised scenarios.http://dx.doi.org/10.1155/2016/4920670
collection DOAJ
language English
format Article
sources DOAJ
author Shuang Li
Bing Liu
Chen Zhang
spellingShingle Shuang Li
Bing Liu
Chen Zhang
Regularized Embedded Multiple Kernel Dimensionality Reduction for Mine Signal Processing
Computational Intelligence and Neuroscience
author_facet Shuang Li
Bing Liu
Chen Zhang
author_sort Shuang Li
title Regularized Embedded Multiple Kernel Dimensionality Reduction for Mine Signal Processing
title_short Regularized Embedded Multiple Kernel Dimensionality Reduction for Mine Signal Processing
title_full Regularized Embedded Multiple Kernel Dimensionality Reduction for Mine Signal Processing
title_fullStr Regularized Embedded Multiple Kernel Dimensionality Reduction for Mine Signal Processing
title_full_unstemmed Regularized Embedded Multiple Kernel Dimensionality Reduction for Mine Signal Processing
title_sort regularized embedded multiple kernel dimensionality reduction for mine signal processing
publisher Hindawi Limited
series Computational Intelligence and Neuroscience
issn 1687-5265
1687-5273
publishDate 2016-01-01
description Traditional multiple kernel dimensionality reduction models are generally based on graph embedding and manifold assumption. But such assumption might be invalid for some high-dimensional or sparse data due to the curse of dimensionality, which has a negative influence on the performance of multiple kernel learning. In addition, some models might be ill-posed if the rank of matrices in their objective functions was not high enough. To address these issues, we extend the traditional graph embedding framework and propose a novel regularized embedded multiple kernel dimensionality reduction method. Different from the conventional convex relaxation technique, the proposed algorithm directly takes advantage of a binary search and an alternative optimization scheme to obtain optimal solutions efficiently. The experimental results demonstrate the effectiveness of the proposed method for supervised, unsupervised, and semisupervised scenarios.
url http://dx.doi.org/10.1155/2016/4920670
work_keys_str_mv AT shuangli regularizedembeddedmultiplekerneldimensionalityreductionforminesignalprocessing
AT bingliu regularizedembeddedmultiplekerneldimensionalityreductionforminesignalprocessing
AT chenzhang regularizedembeddedmultiplekerneldimensionalityreductionforminesignalprocessing
_version_ 1725709131681103872