The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
struc2vec: Learning Node Representations from Structural Identity
Open accessAbstract
Structural identity is a concept of symmetry in which network nodes are identified according to the network structure and their relationship to other nodes. Structural identity has been studied in theory and practice over the past decades, but only recently has it been addressed with representational learning techniques. This work presents struc2vec, a novel and flexible framework for learning latent representations for the structural identity of nodes. struc2vec uses a hierarchy to measure node similarity at different scales, and constructs a multilayer graph to encode structural similarities and generate structural context for nodes. Numerical experiments indicate that state-of-the-art techniques for learning node representations fail in capturing stronger notions of structural identity, while struc2vec exhibits much superior performance in this task, as it overcomes limitations of prior approaches. As a consequence, numerical experiments indicate that struc2vec improves performance on classification tasks that depend more on structural identity.
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
Efficient Estimation of Word Representations in Vector Space
Mikolov, T., Chen, K., Corrado, G., & Dean, J. (2013) · arXiv · doi:10.48550/arxiv.1301.3781 · Cited by 26,568
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
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1999) · Journal of the ACM · doi:10.1145/324133.324140 · Cited by 8,959
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
An Information Flow Model for Conflict and Fission in Small Groups
Zachary, W. W. (1977) · Journal of Anthropological Research · doi:10.1086/jar.33.4.3629752 · Cited by 4,704
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
Learning to Discover Social Circles in Ego Networks
Leskovec, J., & McAuley, J. (2012) · neural information processing systems · Cited by 2,492
Structural equivalence of individuals in social networks
Lorrain, F., & White, H. C. (1971) · The Journal of Mathematical Sociology · doi:10.1080/0022250x.1971.9989788 · Cited by 1,697
Weisfeiler-Lehman Graph Kernels
Shervashidze, N., Schweitzer, P., van Leeuwen, E. J., Mehlhorn, K., & Borgwardt, K. M. (2010) · Max Planck Digital Library · Cited by 1,644
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
Deep Neural Networks for Learning Graph Representations
Cao, S., Lu, W., & Xu, Q. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v30i1.10179 · Cited by 1,014
Leicht, E. A., Holme, P., & Newman, M. E. J. (2006) · Physical Review E · doi:10.1103/physreve.73.026120 · Cited by 916
Singh, R., Xu, J., & Berger, B. (2008) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0806627105 · Cited by 652
FastDTW: Toward Accurate Dynamic Time Warping in Linear Time and Space
Salvador, S., & Chan, P. K. (2004) · Cited by 433
A Measure of Similarity between Graph Vertices: Applications to Synonym Extraction and Web Searching
Blondel, V. D., Gajardo, A., Heymans, M., Senellart, P., & Van Dooren, P. (2004) · SIAM Review · doi:10.1137/s0036144502415960 · Cited by 423
(2004) · International Sociology · doi:10.1177/0268580904191001 · Cited by 397
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
Structural equivalence: Meaning and definition, computation and application
Sailer, L. D. (1978) · Social Networks · doi:10.1016/0378-8733(78)90014-x · Cited by 267
Rakthanmanon, T., Campana, B., Mueen, A., Batista, G., Westover, B., Zhu, Q., Zakaria, J., & Keogh, E. (2013) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/2500489 · Cited by 246
Graph similarity scoring and matching
Zager, L. A., & Verghese, G. C. (2008) · Applied Mathematics Letters · doi:10.1016/j.aml.2007.01.006 · Cited by 224
subgraph2vec: Learning Distributed Representations of Rooted Sub-graphs from Large GraphsPreprint
Narayanan, A. S., Chandramohan, M., Chen, L., Liu, Y., & Saminathan, S. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1606.08928 · Cited by 188
On the privacy of anonymized networks
Pedarsani, P., & Grossglauser, M. (2011) · Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2020408.2020596 · Cited by 173
GLOBAL ALIGNMENT OF MULTIPLE PROTEIN INTERACTION NETWORKS
Singh, R., Xu, J., & Berger, B. (2007) · Pacific Symposium on Biocomputing (PSB) · doi:10.1142/9789812776136_0030 · Cited by 67
Comparative analysis of protein networks
Atias, N., & Sharan, R. (2012) · Communications of the ACM · doi:10.1145/2160718.2160738 · Cited by 50
RolX: Role Extraction and Mining in Large Networks
Henderson, K. A., USDOE, Gallagher, B. J., Eliassi‐Rad, T., Tong, H., Akoglu, L., Koutra, D., Li, L., Basu, S., & Faloutsos, C. (2011) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · doi:10.2172/1111134 · Cited by 31
Cited by
A Comprehensive Survey of Graph Embedding: Problems, Techniques, and Applications
Cai, H., Zheng, V. W., & Chang, K. C.-C. (2018) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2807452 · Cited by 2,034
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
Graph Contrastive Learning with Augmentations
You, Y., Chen, T., Sui, Y., Chen, T., Wang, Z., & Shen, Y. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2010.13902 · Cited by 824
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
Network Representation Learning: A Survey
Zhang, D., Yin, J., Zhu, X., & Zhang, C. (2020) · IEEE Transactions on Big Data · doi:10.1109/tbdata.2018.2850013 · Cited by 714
Metadata
- Authors
- Ribeiro, L. F. R., Saverese, P. H. P., & Figueiredo, D. R.
- Venue
- Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
- Publisher
- ACM
- Published
- 2017-08-04
- Pages
- 385-394
- OpenAlex
- W2607500032
- Cited by
- 1,011
- References
- 26
- FWCI
- 51.45
- 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.