The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Spectral Analysis of Signed Graphs for Clustering, Prediction and Visualization
Abstract
We study the application of spectral clustering, prediction and visualization methods to graphs with negatively weighted edges. We show that several characteristic matrices of graphs can be extended to graphs with positively and negatively weighted edges, giving signed spectral clustering methods, signed graph kernels and network visualization methods that apply to signed graphs. In particular, we review a signed variant of the graph Laplacian. We derive our results by considering random walks, graph clustering, graph drawing and electrical networks, showing that they all result in the same formalism for handling negatively weighted edges. We illustrate our methods using examples from social networks with negative edges and bipartite rating 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
Normalized cuts and image segmentation
Shi, J., & Malik, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.868688 · Cited by 15,502
A tutorial on spectral clustering
von Luxburg, U. (2007) · Statistics and Computing · doi:10.1007/s11222-007-9033-z · Cited by 10,349
On Spectral Clustering: Analysis and an algorithm
Ng, A. Y., Jordan, M. I., & Weiss, Y. (2001) · Cited by 8,159
Chung, F. (1996) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/092 · Cited by 5,524
Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering
Belkin, M., & Niyogi, P. (2002) · Advances in Neural Information Processing Systems 14 · doi:10.7551/mitpress/1120.003.0080 · Cited by 4,412
Predicting positive and negative links in online social networks
Leskovec, J., Huttenlocher, D., & Kleinberg, J. (2010) · Proceedings of the 19th international conference on World wide web · doi:10.1145/1772690.1772756 · Cited by 1,470
Eigentaste: A Constant Time Collaborative Filtering Algorithm
Goldberg, K., Roeder, T., Gupta, D., & Perkins, C. (2001) · Information Retrieval · doi:10.1023/a:1011419012209 · Cited by 1,438
Fouss, F., Pirotte, A., Renders, J.-M., & Saerens, M. (2007) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.46 · Cited by 1,265
Kernel k-means: spectral clustering and normalized cuts
Dhillon, I. S., Guan, Y., & Kulis, B. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014118 · Cited by 1,193
Diffusion kernels on graphs and other discrete structures
Kondor, R. (2002) · Cited by 449
Cited by
Consensus Problems on Networks With Antagonistic Interactions
Altafini, C. (2013) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2012.2224251 · Cited by 2,109
Clustering and community detection in directed networks: A survey
Malliaros, F. D., & Vazirgiannis, M. (2013) · Physics Reports · doi:10.1016/j.physrep.2013.08.002 · Cited by 591
Computing global structural balance in large-scale signed social networks
Facchetti, G., Iacono, G., & Altafini, C. (2011) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1109521108 · Cited by 440
A Survey of Signed Network Mining in Social Media
Tang, J., Chang, Y., Aggarwal, C., & Liu, H. (2017) · ACM Computing Surveys · doi:10.1145/2956185 · Cited by 342
Signed Graph Convolutional Networks
Derr, T., Ma, Y., & Tang, J. (2018) · 2018 IEEE International Conference on Data Mining (ICDM) · doi:10.1109/icdm.2018.00113 · Cited by 314
Metadata
- Authors
- Kunegis, J., Schmidt, S., Lommatzsch, A., Lerner, J., De Luca, E. W., & Albayrak, S.
- Venue
- Proceedings of the 2010 SIAM International Conference on Data Mining
- Published
- 2010-04-29
- Pages
- 559-570
- OpenAlex
- W108936587
- Cited by
- 369
- References
- 19
- FWCI
- 9.35
- Type
- conference paper
- 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: Spectral Analysis of Signed Graphs for Clustering, Prediction and Visualization. https://app.cochat.ai/papers/10.1137/1.9781611972801.49
- The paper
- Kunegis, J., Schmidt, S., Lommatzsch, A., Lerner, J., De Luca, E. W., & Albayrak, S. (2010). Spectral Analysis of Signed Graphs for Clustering, Prediction and Visualization. Proceedings of the 2010 SIAM International Conference on Data Mining. https://doi.org/10.1137/1.9781611972801.49
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.