Semi-supervised sparse feature selection based on multi-view
Laplacian regularization
☆
Caijuan Shi
a,b,c,
⁎
, Qiuqi Ruan
b,c
, Gaoyun An
b,c
,ChaoGe
a
a
College of Information Engineering, North China University of Science and Technology, Tangshan 063009, China
b
Institute of Information Science, Beijing Jiaotong University, Beijing 100044, China
c
Beijing Key Laboratory of Advanced Information Science and Network Technology, Beijing 100044, China
abstractarticle info
Article history:
Received 2 September 2014
Received in revised form 7 May 2015
Accepted 12 June 2015
Available online 23 June 2015
Keywords:
Multi-view learning
Laplacian regularization
Semi-supervised learning
Sparse feature selection
Semi-supervised sparse feature selection, which can exploit the large number unlabeled data and small number
labeled data simultaneously, has placed an important role in web image annotation. However, most of the semi-
supervised sparse feature selection methods are developed for single-view data and these methods cannot nat-
urally deal with the multi-view data, though it has shown that leveraging information contained in multiple
views can dramatically improve the feature selection performance. Recently, multi-view learning has obtained
much research attention because it can reveal and leverage the correlated and complementary information be-
tween different views. So in this paper, we apply multi-view learning into semi-supervised sparse feature selec-
tion and propose a semi-supervised sparse feature selection method based on multi-view Laplacian
regularization, namely, multi-view Laplacian sparse feature selection (MLSFS).
1
MLSFS utilizes mult i-view
Laplacian regularization to boost semi-supervised sparse feature selection performance. A simple iterative meth-
od is proposed to solve the objective function of MLSFS. We apply MLSFS algorithm into image annotation task
and conduct experiments on two web image datasets. The experimental results show that the proposed MLSFS
outperforms the state-of-art single-view sparse feature selection methods.
© 2015 Elsevier B.V. All rights reserved.
1. Introduction
Web images, most of which are unlabeled, have shown continuous
explosive growth. As an important means, semi-supervised sparse fea-
ture selection [1–4] has the ability to improve the performance of web
image annotation. It has extensively shown that semi-supervised sparse
feature selection approaches can overcome the drawbacks of supervised
feature selection methods and unsupervised feature selection methods.
On the one hand, semi-supervised sparse feature selection approaches
can save human labor cost for labeling a large amount of training data,
and on the other hand, they can make full use the reliable labeled data
and the accessible unlabeled data simultaneously to improve the sparse
feature selection performance.
Among different semi-supervised learning methods, graph Laplacian
regularization based method is one of the most representative works [5].
The graph Laplacian can determine the geometry of the underlying man-
ifold in Laplacian regularization. Now, the graph Laplacian regularization
based semi-supervised learning has been widely applied into semi-
supervised sparse feature selection [1,2].In[1], Ma et al. have proposed
a structural feature selection with sparsity frame based on graph
Laplacian semi-supervised learning to select features with considering
the correlation between them. In [2], Shi et al. have proposed a semi-
supervised sparse feature selection method based on graph Laplacian
and l
2,1/2
-matrix norm to select more sparse and discriminative features
for image annotation. In this paper, we also exploit graph Laplacian regu-
larization to construct our semi-supervised sparse feature selection frame.
As we know, images are usually represented by dif ferent types of
features, such as color correlogram, wavelet texture, and edge direction
histogram. Each type of features characterizes these image s in one
specific feature space and has particular physical meaning and statistic
property. Conventionally, the data represented by multiple types of
features are named as multi-view data to distinguish from the single-
view data represented only by one type of features [6]. However, most
of the existing semi-supervised sparse feature selection methods are
developed for the single-view data and these methods concatenate
multiple views featu res into a long vector once they confront with
multi-view data, such as [1,2]. This concatenation strategy cannot effi-
ciently explore the complementary of different view features because
it improperly treats different view features carrying different physical
characteristics. In additio n, this concatenation strategy ignores the
Image and Vision Computing 41 (2015) 1–10
☆
This paper has been recommended for acceptance by Etienne Memin.
⁎ Corresponding author at: College of Information Engineering, North China University
of Science and Technology, Tangshan 063009, China. Tel.: +86 15630555090.
E-mail addresses: shicaijuan2011@gmail.com (C. Shi), qqruan@center.njtu.edu.cn
(Q. Ruan), gyan@bjtu.edu.cn (G. An), chaoge@ncst.edu.cn (C. Ge).
1
MLSFS: Multi-view Laplacian Sparse Feature Selection.
http://dx.doi.org/10.1016/j.imavis.2015.06.006
0262-8856/© 2015 Elsevier B.V. All rights reserved.
Contents lists available at ScienceDirect
Image and Vision Computing
journal homepage: www.elsevier.com/locate/imavis