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

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

Dynamic Affinity Graph Construction for Spectral Clustering Using Multiple Features

Li, Zhihui, Nie, Feiping, Chang, Xiaojun, Yang, Yi, Zhang, Chengqi, Sebe, Nicu · 2018 · IEEE Transactions on Neural Networks and Learning Systems

Abstract

Spectral clustering (SC) has been widely applied to various computer vision tasks, where the key is to construct a robust affinity matrix for data partitioning. With the increase in visual features, conventional SC methods are facing two challenges: 1) how to effectively generate an affinity matrix based on multiple features? and 2) how to deal with high-dimensional visual features which could be redundant? To address these issues mentioned earlier, we present a new approach to: 1) learn a robust affinity matrix using multiple features, allowing us to simultaneously determine optimal weights for each feature; and 2) decide a set of optimal projection matrixes, one for each feature, that decide the lower dimensional space, as well as the optimal affinity weight of each data pair in the lower dimensional space. There are two major advantages of our new approach over the existing clustering techniques. First, our approach assigns affinity weights for data points on a per-data-pair basis. The learning procedure avoids the explicit specification of the size of the neighborhood in the affinity matrix, and the bandwidth parameter required to compute the Gaussian kernel, both of which are sensitive and yet difficult to determine beforehand. Second, the affinity weights are based on the distances in a lower dimensional space, while the low-dimensional space is inferred according to the optimized affinity weights. Both variables are jointly optimized so as to leverage mutual benefits. The experimental results outperform the compared alternatives, which indicate that the proposed method is effective in simultaneously learning the affinity graph and feature fusion, resulting in better clustering results.

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/tnnls.2018.2829867

Cites

32 of 32 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 32 references

Cited by

See all 268

Metadata

Authors
Li, Z., Nie, F., Chang, X., Yang, Y., Zhang, C., & Sebe, N.
Venue
IEEE Transactions on Neural Networks and Learning Systems
Published
2018-12
Volume
29
Issue
12
Pages
6323-6332
ISSN
  • 2162-237X (ISSN-L)
  • 2162-2388
OpenAlex
W2804847616
Cited by
268
References
32
FWCI
7.50
Type
journal article
Language
en
Open access
closed

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: Dynamic Affinity Graph Construction for Spectral Clustering Using Multiple Features. https://app.cochat.ai/papers/10.1109/tnnls.2018.2829867
The paper
Li, Z., Nie, F., Chang, X., Yang, Y., Zhang, C., & Sebe, N. (2018). Dynamic Affinity Graph Construction for Spectral Clustering Using Multiple Features. IEEE Transactions on Neural Networks and Learning Systems. https://doi.org/10.1109/tnnls.2018.2829867

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.