Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 196

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Graph Regularized Non-Negative Low-Rank Matrix Factorization for Image Clustering

Open access
Li, Xuelong, Cui, Guosheng, Dong, Yongsheng·2017·IEEE Transactions on Cybernetics

Abstract

Non-negative matrix factorization (NMF) has been one of the most popular methods for feature learning in the field of machine learning and computer vision. Most existing works directly apply NMF on high-dimensional image datasets for computing the effective representation of the raw images. However, in fact, the common essential information of a given class of images is hidden in their low rank parts. For obtaining an effective low-rank data representation, we in this paper propose a non-negative low-rank matrix factorization (NLMF) method for image clustering. For the purpose of improving its robustness for the data in a manifold structure, we further propose a graph regularized NLMF by incorporating the manifold structure information into our proposed objective function. Finally, we develop an efficient alternating iterative algorithm to learn the low-dimensional representation of low-rank parts of images for clustering. Alternatively, we also incorporate robust principal component analysis into our proposed scheme. Experimental results on four image datasets reveal that our proposed methods outperform four representative methods.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tcyb.2016.2585355

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 1 references

Cited by

See all 196

Metadata

Authors
Li, X., Cui, G., & Dong, Y.
Venue
IEEE Transactions on Cybernetics
Published
2017-11
Volume
47
Issue
11
Pages
3840-3853
ISSN
  • 2168-2267 (ISSN-L)
  • 2168-2275
OpenAlex
W2494395359
Cited by
196
References
1
FWCI
17.34
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Graph Regularized Non-Negative Low-Rank Matrix Factorization for Image Clustering. https://app.cochat.ai/papers/10.1109/tcyb.2016.2585355
The paper
Li, X., Cui, G., & Dong, Y. (2017). Graph Regularized Non-Negative Low-Rank Matrix Factorization for Image Clustering. IEEE Transactions on Cybernetics. https://doi.org/10.1109/tcyb.2016.2585355

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.