Evidence map›Paper›PMID 31063497›Full record

ArticlePloS one2019

Subspace structural constraint-based discriminative feature learning via nonnegative low rank representation.

Ao Li, Xin Liu, Yanbing Wang, Deyun Chen, Kezheng Lin, Guanglu Sun, Hailong Jiang

Abstract read
In one paragraph

Article in PloS one, 2019. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

7 authors.

Ao LiPostdoctoral Station of School of Computer Science and Technology, Harbin University of Science and Technology, Harbin, China.ORCID 0000-0003-0735-2917
Xin LiuPostdoctoral Station of School of Computer Science and Technology, Harbin University of Science and Technology, Harbin, China.
Yanbing WangSchool of Measurement-Control Technology and Communications Engineering, Harbin University of Science and Technology, Harbin, China.
Deyun ChenPostdoctoral Station of School of Computer Science and Technology, Harbin University of Science and Technology, Harbin, China.
Kezheng LinPostdoctoral Station of School of Computer Science and Technology, Harbin University of Science and Technology, Harbin, China.
Guanglu SunPostdoctoral Station of School of Computer Science and Technology, Harbin University of Science and Technology, Harbin, China.
Hailong JiangDepartment of Computer Science, Kent State University, Kent, United States of America.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Feature subspace learning plays a significant role in pattern recognition, and many efforts have been made to generate increasingly discriminative learning models. Recently, several discriminative feature learning methods based on a representation model have been proposed, which have not only attracted considerable attention but also achieved success in practical applications. Nevertheless, these methods for constructing the learning model simply depend on the class labels of the training instances and fail to consider the essential subspace structural information hidden in them. In this paper, we propose a robust feature subspace learning approach based on a low-rank representation. In our approach, the low-rank representation coefficients are considered as weights to construct the constraint item for feature learning, which can introduce a subspace structural similarity constraint in the proposed learning model for facilitating data adaptation and robustness. Moreover, by placing the subspace learning and low-rank representation into a unified framework, they can benefit each other during the iteration process to realize an overall optimum. To achieve extra discrimination, linear regression is also incorporated into our model to enforce the projection features around and close to their label-based centers. Furthermore, an iterative numerical scheme is designed to solve our proposed objective function and ensure convergence. Extensive experimental results obtained using several public image datasets demonstrate the advantages and effectiveness of our novel approach compared with those of the existing methods.

Indexed as

Discrimination LearningAlgorithmsLinear ModelsPattern Recognition, Automated

Identifiers

PMID31063497
PMCPMC6504107

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.