The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
REGAL: Representation Learning-based Graph Alignment
Open accessAbstract
Problems involving multiple networks are prevalent in many scientific and other domains. In particular, network alignment, or the task of identifying corresponding nodes in different networks, has applications across the social and natural sciences. Motivated by recent advancements in node representation learning for single-graph tasks, we propose REGAL (REpresentation learning-based Graph ALignment), a framework that leverages the power of automatically-learned node representations to match nodes across different graphs. Within REGAL we devise xNetMF, an elegant and principled node embedding formulation that uniquely generalizes to multi-network problems. Our results demonstrate the utility and promise of unsupervised representation learning-based network alignment in terms of both speed and accuracy. REGAL runs up to 30x faster in the representation learning stage than comparable methods, outperforms existing network alignment methods by 20 to 30% accuracy on average, and scales to networks with millions of nodes each.
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
DeepWalk: 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
LINE: Large-scale Information Network Embedding
Tang, J., Qu, M., Wang, M., Zhang, M., Yan, J., & Mei, Q. (2015) · Proceedings of the 24th International Conference on World Wide Web · doi:10.1145/2736277.2741093 · Cited by 5,416
Structural Deep Network Embedding
Wang, D., Cui, P., & Zhu, W. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939753 · Cited by 2,845
Graph embedding techniques, applications, and performance: A survey
Goyal, P., & Ferrara, E. (2018) · Knowledge-Based Systems · doi:10.1016/j.knosys.2018.03.022 · Cited by 1,801 · cited 1×
“Representation learning methods try to find similar embeddings for similar nodes [8].”
MethodKONECT: the Koblenz network collection
Kunegis, J. (2013) · Proceedings of the 22nd International Conference on World Wide Web · doi:10.1145/2487788.2488173 · Cited by 1,479
On the evolution of user interaction in facebook
Viswanath, B., Mislove, A., Cha, M., & Gummadi, K. P. (2009) · Proceedings of the 2nd ACM workshop on Online social networks · doi:10.1145/1592665.1592675 · Cited by 1,461
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
Network Embedding as Matrix Factorization: Unifying DeepWalk, LINE, PTE, and node2vec
Qiu, J., Dong, Y., Ma, H., Li, J., Wang, K., & Tang, J. (2018) · Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining · doi:10.1145/3159652.3159706 · Cited by 717
Singh, R., Xu, J., & Berger, B. (2008) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0806627105 · Cited by 652
The Earth Mover's distance is the Mallows distance: some insights from statistics
Levina, E., & Bickel, P. (2002) · Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001 · doi:10.1109/iccv.2001.937632 · Cited by 562
Label Informed Attributed Network Embedding
Huang, X., Li, J., & Hu, X. (2017) · Proceedings of the Tenth ACM International Conference on Web Search and Data Mining · doi:10.1145/3018661.3018667 · Cited by 487
Survey of Nearest Neighbor Techniques
Bhatia, N., & Vandana (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1007.0085 · Cited by 447
Graph analysis of functional brain networks: practical issues in translational neuroscience
De Vico Fallani, F., Richiardi, J., Chavez, M., & Achard, S. (2014) · Philosophical Transactions of the Royal Society B: Biological Sciences · doi:10.1098/rstb.2013.0521 · Cited by 439
A Path Following Algorithm for the Graph Matching Problem
Zaslavskiy, M., Bach, F., & Vert, J.-P. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.245 · Cited by 385
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
Self-citationLearning Structural Node Embeddings via Diffusion Wavelets
Donnat, C., Zitnik, M., Hallac, D., & Leskovec, J. (2018) · Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3219819.3220025 · Cited by 360
FINAL: Fast Attributed Network Alignment
Zhang, S., & Tong, H. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939766 · Cited by 241
Rossi, R. A., & Ahmed, N. K. (2015) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2014.2349913 · Cited by 212
Matching Node Embeddings for Graph Similarity
Nikolentzos, G., Meladianos, P., & Vazirgiannis, M. (2017) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v31i1.10839 · Cited by 199
Shah, N., Koutra, D., Zou, T., Gallagher, B. J., & Faloutsos, C. (2015) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2783258.2783321 · Cited by 137
Self-citationGrowing a graph matching from a handful of seeds
Kazemi, E. M., Hassani, H., & Grossglauser, M. (2015) · Proceedings of the VLDB Endowment · doi:10.14778/2794367.2794371 · Cited by 126
Message-Passing Algorithms for Sparse Network Alignment
Bayati, M., Gleich, D. F., Saberi, A., & Wang, Y. (2013) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/2435209.2435212 · Cited by 104
Multiple Network Alignment via MultiMAGNA++
Vijayan, V., & Milenković, T. (2017) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2017.2740381 · Cited by 78
Cited by
Graph Representation Learning via Graphical Mutual Information Maximization
Peng, Z., Huang, W., Luo, M., Zheng, Q., Rong, Y., Xu, T., & Huang, J. (2020) · Proceedings of The Web Conference 2020 · doi:10.1145/3366423.3380112 · Cited by 536
A benchmarking study of embedding-based entity alignment for knowledge graphs
Sun, Z., Zhang, Q., Hu, W., Wang, C., Chen, M., Akrami, F., & Li, C. (2020) · Proceedings of the VLDB Endowment · doi:10.14778/3407790.3407828 · Cited by 265
Metadata
- Authors
- Heimann, M., Shen, H., Safavi, T., & Koutra, D.
- Venue
- Proceedings of the 27th ACM International Conference on Information and Knowledge Management
- Publisher
- ACM
- Published
- 2018-10-17
- Pages
- 117-126
- OpenAlex
- W2888657195
- Cited by
- 257
- References
- 24
- FWCI
- 11.13
- Type
- conference paper
- Language
- en
- Open access
- bronze
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.