The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Energy Models for Graph Clustering
Open accessAbstract
The cluster structure of many real-world graphs is of great interest, as the clusters may correspond e.g. to communities in social networks or to cohesive modules in software systems. Layouts can naturally represent the cluster structure of graphs by grouping densely connected nodes and separating sparsely connected nodes. This article introduces two energy models whose minimum energy layouts represent the cluster structure, one based on repulsion between nodes (like most existing energy models) and one based on repulsion between edges. The latter model is not biased towards grouping nodes with high degrees, and is thus more appropriate for the many real-world graphs with right-skewed degree distributions. The two energy models are shown to be closely related to widely used quality criteria for graph clusterings - namely the density of the cut, Shi and Malik's normalized cut, and Newman's modularity - and to objective functions optimized by eigenvector-based graph drawing methods.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Graph drawing by force‐directed placement
Fruchterman, T. M. J., & Reingold, E. M. (1991) · Software: Practice and Experience · doi:10.1002/spe.4380211102 · Cited by 6,352
Cited by
Jacomy, M., Venturini, T., Heymann, S., & Bastian, M. (2014) · PLoS ONE · doi:10.1371/journal.pone.0098679 · Cited by 2,909
Review on Convolutional Neural Networks (CNN) in vegetation remote sensing
Kattenborn, T., Leitloff, J., Schiefer, F., & Hinz, S. (2021) · ISPRS Journal of Photogrammetry and Remote Sensing · doi:10.1016/j.isprsjprs.2020.12.010 · Cited by 1,805
Modularity clustering is force-directed layout
Noack, A. (2009) · Physical Review E · doi:10.1103/physreve.79.026102 · Cited by 258
Self-citationBlockchain technology in the smart city: A bibliometric review
Rejeb, A., Rejeb, K., Simske, S. J., & Keogh, J. G. (2022) · Quality & Quantity · doi:10.1007/s11135-021-01251-2 · Cited by 104
Mapping the Research Landscape of Nature-Based Solutions in Urbanism
Li, L., Cheshmehzangi, A., Chan, F. K. S., & Ives, C. D. (2021) · Sustainability · doi:10.3390/su13073876 · Cited by 71
Metadata
- Authors
- Noack, A.
- Venue
- Journal of Graph Algorithms and Applications
- Published
- 2007
- Volume
- 11
- Issue
- 2
- Pages
- 453-480
- ISSN
- 1526-1719 (ISSN-L)
- OpenAlex
- W2041783407
- Cited by
- 234
- References
- 2
- FWCI
- 2.96
- Type
- journal article
- Language
- en
- Open access
- diamond
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: Energy Models for Graph Clustering. https://app.cochat.ai/papers/10.7155/jgaa.00154
- The paper
- Noack, A. (2007). Energy Models for Graph Clustering. Journal of Graph Algorithms and Applications. https://doi.org/10.7155/jgaa.00154
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.