arrow
Return

Transferable Linear Discriminant Analysis

delete2020-12-01
delete22
PRE
AI
N
Na Han
J
Jigang Wu
房
房小兆 (Xiaozhao Fang) *
文杰 cover
文杰 (Jie Wen)
S
Shanhua Zhan
Xie Shengli cover
Xie Shengli (Shengli Xie)
X
Xuelong Li
DOI:10.1109/TNNLS.2020.2966746delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Linear discriminant analysis (LDA) has been widely used as the technique of feature exaction. However, LDA may be invalid to address the data from different domains. The reasons are as follows: 1) the distribution discrepancy of data may disturb the linear transformation matrix so that it cannot extract the most discriminative feature and 2) the original design of LDA does not consider the unlabeled data so that the unlabeled data cannot take part in the training process for further improving the performance of LDA. To address these problems, in this brief, we propose a novel transferable LDA (TLDA) method to extend LDA into the scenario in which the data have different probability distributions. The whole learning process of TLDA is driven by the philosophy that the data from the same subspace have a low-rank structure. The matrix rank in TLDA is the key learning criterion to conduct local and global linear transformations for restoring the low-rank structure of data from different distributions and enlarging the distances among different subspaces. In doing so, the variations of distribution discrepancy within the same subspace can be reduced, i.e., data can be aligned well and the maximally separated structure can be achieved for the data from different subspaces. A simple projected subgradient-based method is proposed to optimize the objective of TLDA, and a strict theory proof is provided to guarantee a quick convergence. The experimental evaluation on public data sets demonstrates that our TLDA can achieve better classification performance and outperform the state-of-the-art methods.
Keywords:
Learning systems
Feature extraction
Data mining
Convergence
Machine learning
Electronic mail
Visualization
Linear discriminant analysis (LDA)
linear transformation
low-rank structure
machine learning
transfer learning
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

IEEE Transactions on Neural Networks and Learning Systems cover
IEEE Transactions on Neural Networks and Learning Systems
IF:
8.9
Papers:
7.6K
Citations:
7.2W

Organization

H
harbin institute of technology
Scholars:
8.0W
Papers: 6.6W
Citations: 66
N
Northwestern Polytechnical University
Scholars:
4.6W
Papers: 3.7W
Citations: 5.3W
G
guangdong university of technology
Scholars:
3.0W
Papers: 2.0W
Citations: 36
researcher View more organizations
Cited Papers

Cited Papers

Creep tests on notched specimens of copper
err2018-10-01
err0
PREAI
errFangfei Sui; Rolf Sandström; Rui Wu
errShare
errSave
err
IF0
err
err0
PREAI
err
errShare
errSave
The effect of mesoscopic shape on thermal properties of multi-walled carbon nanotube mats
err2011-09-01
err0
PREAI
errYoung Jin Heo; Chang Hun Yun; Woo Nyon Kim; Heon Sang Lee
errShare
errSave
Natural Regulatory T Cells Control Coronary Arteriolar Endothelial Dysfunction in Hypertensive Mice
err2011-01-01
err0
errOAAI
errKhalid Matrougui; Abd Elmageed Zakaria; Modar Kassan; Sookyoung Choi; Devika Nair; Romer A. Gonzalez-Villalobos; Aziz A. Chentoufi; Philip Kadowitz; Souad Belmadani; Megan Partyka
errShare
errSave
The effects of bread‐making process factors on Australian sweet lupin‐wheat bread quality characteristics
err2014-07-21
err0
PREAI
errCasiana Blanca Villarino; Vijay Jayasena; Ranil Coorey; Sumana Chakrabarti‐Bell; Stuart Johnson
errShare
errSave
Gradient-based learning applied to document recognition
err1998-01-01
err3.8W
PREAI
errLecun, Y; Bottou, L; Bengio, Y; Haffner, P
errShare
errSave
researcher View more