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

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

Clustering on Multi-Layer Graphs via Subspace Analysis on Grassmann Manifolds

Open access
Dong, Xiaowen, Frossard, Pascal, Vandergheynst, Pierre, Nefedov, Nikolai·2014·IEEE Transactions on Signal Processing

Abstract

Relationships between entities in datasets are often of multiple nature, like geographical distance, social relationships, or common interests among people in a social network, for example. This information can naturally be modeled by a set of weighted and undirected graphs that form a global multi-layer graph, where the common vertex set represents the entities and the edges on different layers capture the similarities of the entities in term of the different modalities. In this paper, we address the problem of analyzing multi-layer graphs and propose methods for clustering the vertices by efficiently merging the information provided by the multiple modalities. To this end, we propose to combine the characteristics of individual graph layers using tools from subspace analysis on a Grassmann manifold. The resulting combination can then be viewed as a low dimensional representation of the original data which preserves the most important information from diverse relationships between entities. As an illustrative application of our framework, we use our algorithm in clustering methods and test its performance on several synthetic and real world datasets where it is shown to be superior to baseline schemes and competitive to state-of-the-art techniques. Our generic framework further extends to numerous analysis and learning problems that involve different types of information on graphs.

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/tsp.2013.2295553

Cites

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

Cited by

See all 210

Metadata

Authors
Dong, X., Frossard, P., Vandergheynst, P., & Nefedov, N.
Venue
IEEE Transactions on Signal Processing
Published
2014-02
Volume
62
Issue
4
Pages
905-918
ISSN
  • 1053-587X (ISSN-L)
  • 1941-0476
OpenAlex
W2059861509
Cited by
210
References
5
FWCI
16.84
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: Clustering on Multi-Layer Graphs via Subspace Analysis on Grassmann Manifolds. https://app.cochat.ai/papers/10.1109/tsp.2013.2295553
The paper
Dong, X., Frossard, P., Vandergheynst, P., & Nefedov, N. (2014). Clustering on Multi-Layer Graphs via Subspace Analysis on Grassmann Manifolds. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2013.2295553

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.