The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Learning Structural Node Embeddings via Diffusion Wavelets
Open accessAbstract
Nodes residing in different parts of a graph can have similar structural roles within their local network topology. The identification of such roles provides key insight into the organization of networks and can be used for a variety of machine learning tasks. However, learning structural representations of nodes is a challenging problem, and it has typically involved manually specifying and tailoring topological features for each node. In this paper, we develop GraphWave, a method that represents each node's network neighborhood via a low-dimensional embedding by leveraging heat wavelet diffusion patterns. Instead of training on hand-selected features, GraphWave learns these embeddings in an unsupervised way. We mathematically prove that nodes with similar network neighborhoods will have similar GraphWave embeddings even though these nodes may reside in very different parts of the network, and our method scales linearly with the number of edges. Experiments in a variety of different settings demonstrate GraphWave's real-world potential for capturing structural roles in networks, and our approach outperforms existing state-of-the-art baselines in every experiment, by as much as 137%.
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
node2vec: Scalable Feature Learning for Networks
Grover, A., & Leskovec, J. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939754 · Cited by 10,926
Self-citationInductive Representation Learning on Large Graphs
Hamilton, W. L., Ying, R., & Leskovec, J. (2017) · arXiv · doi:10.48550/arxiv.1706.02216 · Cited by 10,639
Self-citationDeepWalk: online learning of social representations
Perozzi, B., Al-Rfou, R., & Skiena, S. (2014) · Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2623330.2623732 · Cited by 10,123
Targeted Branching for the Maximum Independent Set Problem Using Graph Neural Networks
Silva, G., Rodrigues, M., Teixeira, A., & Amorim, M. (2024) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.sea.2024.20 · Cited by 5,183
Advances In Deep Learning On Graphs (Gsp'18 Workshop)
Defferrard, M. (2016) · Figshare · doi:10.5281/zenodo.1286817 · Cited by 4,613
Shuman, D. I., Narang, S. K., Frossard, P., Ortega, A., & Vandergheynst, P. (2013) · IEEE Signal Processing Magazine · doi:10.1109/msp.2012.2235192 · Cited by 4,421 · cited 9×
“…we assume that s is given; we develop a method for selecting an appropriate value of s in Appendix C. Graph signal processing (Hammond et al., 2011; Shuman et al., 2013) defines the spectral graph wavelet associated with g s as the signal resulting from the modulation in the spectral domain of a…”
BackgroundMethodInfluentialNeural Message Passing for Quantum Chemistry
Gilmer, J., Schoenholz, S. S., Riley, P. F., Vinyals, O., & Dahl, G. E. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1704.01212 · Cited by 3,440
Coifman, R. R., & Lafon, S. (2006) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2006.04.006 · Cited by 2,342
Wavelets on graphs via spectral graph theory
Hammond, D. K., Vandergheynst, P., & Gribonval, R. (2011) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2010.04.005 · Cited by 2,171
Geometric Deep Learning on Graphs and Manifolds Using Mixture Model CNNs
Monti, F., Boscaini, D., Masci, J., Rodola, E., Svoboda, J., & Bronstein, M. M. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.576 · Cited by 1,820
A Concise and Provably Informative Multi‐Scale Signature Based on Heat Diffusion
Sun, J., Ovsjanikov, M., & Guibas, L. (2009) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2009.01515.x · Cited by 1,450
V-Measure: A Conditional Entropy-Based External Cluster Evaluation Measure
Rosenberg, A., & Hirschberg, J. (2007) · Cited by 1,322
struc2vec: Learning Node Representations from Structural Identity
Ribeiro, L. F. R., Saverese, P. H. P., & Figueiredo, D. R. (2017) · Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/3097983.3098061 · Cited by 1,011
RhizoDB: A Bounded Activation-Flow Architecture for Graph-Based Memory Systems
Guberte, J. A. (2026) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.20695702 · Cited by 866
The wave kernel signature: A quantum mechanical approach to shape analysis
Aubry, M., Schlickewei, U., & Cremers, D. (2011) · 2011 IEEE International Conference on Computer Vision Workshops (ICCV Workshops) · doi:10.1109/iccvw.2011.6130444 · Cited by 731
Diffusion Kernels on Graphs and Other Discrete Input Spaces
Kondor, R., & Lafferty, J. (2002) · Cited by 725
Klimt, B., & Yang, Y. (2004) · Conference on Email and Anti-Spam · Cited by 575
Emergence of network features from multiplexity
Cardillo, A., Gómez-Gardeñes, J., Zanin, M., Romance, M., Papo, D., Pozo, F. D., & Boccaletti, S. (2013) · Scientific Reports · doi:10.1038/srep01344 · Cited by 569
Discriminative Embeddings of Latent Variable Models for Structured Data
Dai, H., Dai, B., & Song, L. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1603.05629 · Cited by 454
RolX: structural role extraction & mining in large graphs
Henderson, K., Gallagher, B., Eliassi-Rad, T., Tong, H., Basu, S., Akoglu, L., Koutra, D., Faloutsos, C., & Li, L. (2012) · Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2339530.2339723 · Cited by 376
Vertex-frequency analysis on graphs
Shuman, D. I., Ricaud, B., & Vandergheynst, P. (2016) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2015.02.005 · Cited by 349
One Point Isometric Matching with the Heat Kernel
Ovsjanikov, M., Mérigot, Q., Mémoli, F., & Guibas, L. (2010) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2010.01764.x · Cited by 301
The heat kernel as the pagerank of a graph
Chung, F. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0708838104 · Cited by 254
It's who you know: graph mining using recursive structural features
Henderson, K., Gallagher, B., Li, L., Akoglu, L., Eliassi-Rad, T., Tong, H., & Faloutsos, C. (2011) · Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2020408.2020512 · Cited by 223 · cited 1×
“A notable example of such approaches is RolX [11, 16], which aims to recover a soft-clustering of nodes into a predetermined number of K distinct roles using recursive feature extraction [17].”
Graph Wavelets for Multiscale Community Mining
Tremblay, N., & Borgnat, P. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2345355 · Cited by 170
Chebyshev polynomial approximation for distributed signal processing
Shuman, D. I., Vandergheynst, P., & Frossard, P. (2011) · International Conference on Distributed Computing in Smart Systems and the Internet of Things (DCOSS-IoT) · doi:10.1109/dcoss.2011.5982158 · Cited by 158
Axiomatic ranking of network role similarity
Jin, R., Lee, V. E., & Hong, H. (2011) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2020408.2020561 · Cited by 119
Learning Graph Representations with Embedding PropagationPreprint
García-Durán, A., & Niepert, M. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1710.03059 · Cited by 88
Guided learning for role discovery (GLRD): framework, algorithms, and applications
Gilpin, S., Eliassi‐Rad, T., & Davidson, I. A. K. (2013) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2487575.2487620 · Cited by 70
Wavelets on Graphs via Deep Learning
Rustamov, R. M., & Guibas, L. J. (2018) · Signals and communication technology · doi:10.1007/978-3-030-03574-7_5 · Cited by 63
Scalable and axiomatic ranking of network role similarity
Jin, R., Lee, V. E., & Li, L. (2014) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/2518176 · Cited by 34
Chen, T., Wang, Z., Li, L., Li, D., Li, Z., Chang, X., Bian, P., Liang, G., Wang, Q., & Xie, T. (2025) · Schloss Dagstuhl – Leibniz-Zentrum für Informatik · doi:10.4230/lipics.ecoop.2025.6
Cited by
Self-supervised Learning: Generative or Contrastive
Liu, X., Zhang, F., Hou, Z., Mian, L., Wang, Z., Zhang, J., & Tang, J. (2021) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2021.3090866 · Cited by 1,087
GCC: Graph Contrastive Coding for Graph Neural Network Pre-Training
Qiu, J., Chen, Q., Dong, Y., Zhang, J., Yang, H., Ding, M., Wang, K., & Tang, J. (2020) · Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3394486.3403168 · Cited by 777
Heterogeneous Network Representation Learning: A Unified Framework With Survey and Benchmark
Yang, C., Xiao, Y., Zhang, Y., Sun, Y., & Han, J. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2020.3045924 · Cited by 324
REGAL: Representation Learning-based Graph Alignment
Heimann, M., Shen, H., Safavi, T., & Koutra, D. (2018) · Proceedings of the 27th ACM International Conference on Information and Knowledge Management · doi:10.1145/3269206.3271788 · Cited by 257
Identification of disease treatment mechanisms through the multiscale interactome
Ruiz, C., Zitnik, M., & Leskovec, J. (2021) · Nature Communications · doi:10.1038/s41467-021-21770-8 · Cited by 172
“Our ap136 proach is thus consistent with recent machine learning advances which harness diffusion profiles 137 to represent nodes [45].”
MethodSelf-citation
Metadata
- Authors
- Donnat, C., Zitnik, M., Hallac, D., & Leskovec, J.
- Venue
- Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining
- Publisher
- ACM
- Published
- 2018-07-19
- Pages
- 1320-1329
- OpenAlex
- W2792234394
- Cited by
- 360
- References
- 32
- FWCI
- 19.56
- Type
- conference paper
- 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
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.