The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Clustering With Multi-Layer Graphs: A Spectral Perspective
Open accessAbstract
Observational data usually comes with a multimodal nature, which means that it can be naturally represented by a multi-layer graph whose layers share the same set of vertices (objects) with different edges (pairwise relationships). In this paper, we address the problem of combining different layers of the multi-layer graph for an improved clustering of the vertices compared to using layers independently. We propose two novel methods, which are based on a joint matrix factorization and a graph regularization framework respectively, to efficiently combine the spectrum of the multiple graph layers, namely the eigenvectors of the graph Laplacian matrices. In each case, the resulting combination, which we call a “joint spectrum” of multiple layers, is used for clustering the vertices. We evaluate our approaches by experiments with several real world social network datasets. Results demonstrate the superior or competitive performance of the proposed methods compared to state-of-the-art techniques and common baseline methods, such as co-regularization and summation of information from individual 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.
Integrity signals
Registry
Cites
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.
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
Finding and evaluating community structure in networks
Newman, M. E. J., & Girvan, M. (2004) · Physical Review E · doi:10.1103/physreve.69.026113 · Cited by 13,931
Introduction to information retrieval
(2009) · Choice Reviews Online · doi:10.5860/choice.46-2715 · Cited by 12,278
Introduction to Information Retrieval
Manning, C. D., Raghavan, P., & Schütze, H. (2008) · doi:10.1017/cbo9780511809071 · Cited by 11,288
Inferring friendship network structure by using mobile phone data
Eagle, N., Pentland, A. (., & Lazer, D. (2009) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0900282106 · Cited by 1,856
Cited by
Learning Laplacian Matrix in Smooth Graph Signal Representations
Dong, X., Thanou, D., Frossard, P., & Vandergheynst, P. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2602809 · Cited by 640
Self-citationMethods for the integration of multi-omics data: mathematical aspects
Bersanelli, M., Mosca, E., Remondini, D., Giampieri, E., Sala, C., Castellani, G., & Milanesi, L. (2016) · BMC Bioinformatics · doi:10.1186/s12859-015-0857-9 · Cited by 449
Learning to Represent Knowledge Graphs with Gaussian Embedding
He, S., Liu, K., Ji, G., & Zhao, J. (2015) · Proceedings of the 24th ACM International on Conference on Information and Knowledge Management · doi:10.1145/2806416.2806502 · Cited by 374
Metadata
- Authors
- Dong, X., Frossard, P., Vandergheynst, P., & Nefedov, N.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2012-11
- Volume
- 60
- Issue
- 11
- Pages
- 5820-5831
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2080161383
- Cited by
- 158
- References
- 4
- FWCI
- 6.02
- 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 With Multi-Layer Graphs: A Spectral Perspective. https://app.cochat.ai/papers/10.1109/tsp.2012.2212886
- The paper
- Dong, X., Frossard, P., Vandergheynst, P., & Nefedov, N. (2012). Clustering With Multi-Layer Graphs: A Spectral Perspective. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2012.2212886
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.