A structure-protecting kernelized semi-supervised space adjustment for classification

Author:

Azimifar Maryam1,Nejatian Samad2,Parvin Hamid3,Bagherifard Karamollah1,Rezaei Vahideh4

Affiliation:

1. Department of Computer Science, Yasooj Branch, Islamic Azad University, Yasooj, IR

2. Department of Electrical Engineering, Yasooj Branch, Islamic Azad University, Yasooj, IR

3. Department of Computer Science, Nourabad Mamasani Branch, Islamic Azad University, Mamasani, IR

4. Department of Mathematics, Yasooj Branch, Islamic Azad University, Yasooj, IR

Abstract

We introduce a semi-supervised space adjustment framework in this paper. In the introduced framework, the dataset contains two subsets: (a) training data subset (space-one data (SOD)) and (b) testing data subset (space-two data (STD)). Our semi-supervised space adjustment framework learns under three assumptions: (I) it is assumed that all data points in the SOD are labeled, and only a minority of the data points in the STD are labeled (we call the labeled space-two data as LSTD), (II) the size of LSTD is very small comparing to the size of SOD, and (III) it is also assumed that the data of SOD and the data of STD have different distributions. We denote the unlabeled space-two data by ULSTD, which is equal to STD - LSTD. The aim is to map the training data, i.e., the data from the training labeled data subset and those from LSTD (note that all labeled data are considered to be training data, i.e., SOD ∪ LSTD) into a shared space (ShS). The mapped SOD, ULSTD, and LSTD into ShS are named MSOD, MULSTD, and MLSTD, respectively. The proposed method does the mentioned mapping in such a way that structures of the data points in SOD and MSOD, in STD and MSTD, in ULSTD and MULSTD, and in LSTD and MLSTD are the same. In the proposed method, the mapping is proposed to be done by a principal component analysis transformation on kernelized data. In the proposed method, it is tried to find a mapping that (a) can maintain the neighbors of data points after the mapping and (b) can take advantage of the class labels that are known in STD during transformation. After that, we represent and formulate the problem of finding the optimal mapping into a non-linear objective function. To solve it, we transform it into a semidefinite programming (SDP) problem. We solve the optimization problem with an SDP solver. The examinations indicate the superiority of the learners trained in the data mapped by the proposed approach to the learners trained in the data mapped by the state of the art methods.

Publisher

IOS Press

Subject

Artificial Intelligence,General Engineering,Statistics and Probability

Reference56 articles.

1. Domain adaptation via transfer component analysis;Pan;IEEE Transactions on Neural Networks,2011

2. Bache K. and Lichman M. , UCI machine learning repository (2013). Available at https://archive.ics.uci.edu/ml

3. Adapting visual category models to new domains;Saenko;European Conference on Computer vision,2010

4. A survey on transfer learning;Pan;IEEE Transactions on Knowledge and Data Engineering,2010

5. Beijbom O. , Domain adaptation for computer vision applications, Tech. Rep., University of California, San Diego, 2012.

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3