The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Asymmetric Transitivity Preserving Graph Embedding
Abstract
Graph embedding algorithms embed a graph into a vector space where the structure and the inherent properties of the graph are preserved. The existing graph embedding methods cannot preserve the asymmetric transitivity well, which is a critical property of directed graphs. Asymmetric transitivity depicts the correlation among directed edges, that is, if there is a directed path from u to v, then there is likely a directed edge from u to v. Asymmetric transitivity can help in capturing structures of graphs and recovering from partially observed graphs. To tackle this challenge, we propose the idea of preserving asymmetric transitivity by approximating high-order proximity which are based on asymmetric transitivity. In particular, we develop a novel graph embedding algorithm, High-Order Proximity preserved Embedding (HOPE for short), which is scalable to preserve high-order proximities of large scale graphs and capable of capturing the asymmetric transitivity. More specifically, we first derive a general formulation that cover multiple popular high-order proximity measurements, then propose a scalable embedding algorithm to approximate the high-order proximity measurements based on their general formulation. Moreover, we provide a theoretical upper bound on the RMSE (Root Mean Squared Error) of the approximation. Our empirical experiments on a synthetic dataset and three real-world datasets demonstrate that HOPE can approximate the high-order proximities significantly better than the state-of-art algorithms and outperform the state-of-art algorithms in tasks of reconstruction, link prediction and vertex recommendation.
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
Glove: Global Vectors for Word Representation
Pennington, J., Socher, R., & Manning, C. (2014) · Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.3115/v1/d14-1162 · Cited by 34,071
THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMS
FISHER, R. A. (1936) · Annals of Eugenics · doi:10.1111/j.1469-1809.1936.tb02137.x · Cited by 15,227
Nonlinear Dimensionality Reduction by Locally Linear Embedding
Roweis, S. T., & Saul, L. K. (2000) · Science · doi:10.1126/science.290.5500.2323 · Cited by 14,965
Jolliffe, I. (2005) · Encyclopedia of Statistics in Behavioral Science · doi:10.1002/0470013192.bsa501 · Cited by 14,310
A Global Geometric Framework for Nonlinear Dimensionality Reduction
Tenenbaum, J. B., Silva, V. D., & Langford, J. C. (2000) · Science · doi:10.1126/science.290.5500.2319 · Cited by 13,585
Advances in Neural Information Processing Systems 25
Zhang, Y., Sutton, C. A., Storkey, A., & Zoubin Ghahramani, A. (2012) · Cited by 12,653
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 · cited 1×
“• LINE [32]: This algorithm preserves the first-order and second-order proximity between vertexes. but it only can preserve symmetric second-order proximity when applied to directed graph.”
BackgroundLaplacian 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
A New Status Index Derived from Sociometric Analysis
Katz, L. (1953) · Psychometrika · doi:10.1007/bf02289026 · Cited by 3,866
Research works printed but not linked: 10
- Belkin M., 2001, NIPS, 14, 585
- 10.1109/ICDM.2014.115 · doi:10.1109/icdm.2014.115
- Chen M., 2007, IJCAI, 2707
- Jolliffe I., 2002, Wiley Online Library
- Levy O., 2014, Advances in Neural Information Processing Systems, 2177
- 10.1016/j.sigpro.2014.12.019 · doi:10.1016/j.sigpro.2014.12.019
- Perrault-Joncas D., 2014, Estimating vector fields on manifolds and the embedding of directed graphs. arXiv preprint arXiv:1406.0013 · arXiv
- Perrault-Joncas D. C., 2011, Advances in Neural Information Processing Systems, 990
- Scholkopft B., 1999, Fisher discriminant analysis with kernels. Neural networks for signal processing IX, 1:1
- 10.1109/TPAMI.2007.12 · DOI
Cited by
Heterogeneous Graph Attention Network
Wang, X., Ji, H., Shi, C., Wang, B., Ye, Y., Cui, P., & Yu, P. S. (2019) · The World Wide Web Conference · doi:10.1145/3308558.3313562 · Cited by 3,191
Self-citationmetapath2vec: Scalable Representation Learning for Heterogeneous Networks
Dong, Y., Chawla, N. V., & Swami, A. (2017) · Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/3097983.3098036 · Cited by 2,210
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
CatBoost for big data: an interdisciplinary review
Hancock, J. T., & Khoshgoftaar, T. M. (2020) · Journal of Big Data · doi:10.1186/s40537-020-00369-8 · Cited by 1,814
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
“HOPE [24] preserves higher order proximity by minimizing ‖S−YsY T t ‖(2)F , where S is the similarity matrix.”
BackgroundMethodResultInfluentialCui, P., Wang, X., Pei, J., & Zhu, W. (2019) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2849727 · Cited by 1,274
Self-citationEvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs
Pareja, A., Domeniconi, G., Chen, J., Ma, T., Suzumura, T., Kanezashi, H., Kaler, T., Schardl, T., & Leiserson, C. (2020) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v34i04.5984 · Cited by 1,221
Adversarially Regularized Graph Autoencoder for Graph Embedding
Pan, S., Hu, R., Long, G., Jiang, J., Yao, L., & Zhang, C. (2018) · Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2018/362 · Cited by 929
A Survey on Deep Semi-Supervised Learning
Yang, X., Song, Z., King, I., & Xu, Z. (2023) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2022.3220219 · Cited by 923
Community Preserving Network Embedding
Wang, X., Cui, P., Wang, J., Pei, J., Zhu, W., & Yang, S. (2017) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v31i1.10488 · Cited by 883
Self-citationNetwork 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
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
A Novel Neural Source Code Representation Based on Abstract Syntax Tree
Zhang, J., Wang, X., Zhang, H., Sun, H., Wang, K., & Liu, X. (2019) · 2019 IEEE/ACM 41st International Conference on Software Engineering (ICSE) · doi:10.1109/icse.2019.00086 · Cited by 655
GraphGAN: Graph Representation Learning With Generative Adversarial Nets
Wang, H., Wang, J., Wang, J., Zhao, M., Zhang, W., Zhang, F., Xie, X., & Guo, M. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11872 · Cited by 653
Multi-Scale attributed node embedding
Rozemberczki, B., Allen, C., & Sarkar, R. (2021) · Journal of Complex Networks · doi:10.1093/comnet/cnab014 · Cited by 640
Hamilton, W. L. (2020) · Synthesis Lectures on Artificial Intelligence and Machine Learning · doi:10.1007/978-3-031-01588-5 · Cited by 607
Zhong, J.-X., Li, N., Kong, W., Liu, S., Li, T. H., & Li, G. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00133 · Cited by 588
A comprehensive survey on pretrained foundation models: a history from BERT to ChatGPT
Zhou, C., Li, Q., Li, C., Yu, J., Liu, Y., Wang, G., Zhang, K., Ji, C., Yan, Q., He, L., et al. (2025) · International Journal of Machine Learning and Cybernetics · doi:10.1007/s13042-024-02443-6 · Cited by 557
Self-citationLink prediction techniques, applications, and performance: A survey
Kumar, A., Singh, S. S., Singh, K., & Biswas, B. (2020) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2020.124289 · Cited by 516
A Semi-supervised Graph Attentive Network for Financial Fraud Detection
Wang, D., Lin, J., Cui, P., Jia, Q., Wang, Z., Fang, Y., Yu, Q., Zhou, J., Yang, S., & Qi, Y. (2020) · arXiv · doi:10.48550/arxiv.2003.01171 · Cited by 476
“Some further works [20], [21] use the matrix factorization to factorize high-order relation matrix.”
MethodSelf-citationdyngraph2vec: Capturing network dynamics using dynamic graph representation learning
Goyal, P., Chhetri, S. R., & Canedo, A. (2020) · Knowledge-Based Systems · doi:10.1016/j.knosys.2019.06.024 · Cited by 465
FastGCN: Fast Learning with Graph Convolutional Networks via Importance Sampling
Chen, J., Ma, T., & Xiao, C. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1801.10247 · Cited by 406
Graph embedding on biomedical networks: methods, applications and evaluations
Yue, X., Wang, Z., Huang, J., Parthasarathy, S., Moosavinasab, S., Huang, Y., Lin, S. M., Zhang, W., Zhang, P., & Sun, H. (2020) · Bioinformatics · doi:10.1093/bioinformatics/btz718 · Cited by 386
A Semi-Supervised Graph Attentive Network for Financial Fraud Detection
Wang, D., Lin, J., Cui, P., Jia, Q., Wang, Z., Fang, Y., Yu, Q., Zhou, J., Yang, S., & Qi, Y. (2019) · 2019 IEEE International Conference on Data Mining (ICDM) · doi:10.1109/icdm.2019.00070 · Cited by 371
Self-citationLearning Community Embedding with Community Detection and Node Embedding on Graphs
Cavallari, S., Zheng, V. W., Cai, H., Chang, K. C.-C., & Cambria, E. (2017) · Proceedings of the 2017 ACM on Conference on Information and Knowledge Management · doi:10.1145/3132847.3132925 · Cited by 368
Learning Graph Embedding With Adversarial Training Methods
Pan, S., Hu, R., Fung, S.-F., Long, G., Jiang, J., & Zhang, C. (2020) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2019.2932096 · Cited by 363
HARP: Hierarchical Representation Learning for Networks
Chen, H., Perozzi, B., Hu, Y., & Skiena, S. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11849 · Cited by 349
Knowledge Graph Completion: A Review
Chen, Z., Wang, Y., Zhao, B., Cheng, J., Zhao, X., & Duan, Z. (2020) · IEEE Access · doi:10.1109/access.2020.3030076 · Cited by 346
A Comprehensive Survey on Deep Graph Representation Learning
Ju, W., Fang, Z., Gu, Y., Liu, Z., Long, Q., Qiao, Z., Qin, Y., Shen, J., Sun, F., Xiao, Z., et al. (2024) · Neural Networks · doi:10.1016/j.neunet.2024.106207 · Cited by 341
Representation learning for dynamic graphs: A survey
Kazemi, S. M., Goel, R., Jain, K., Kobyzev, I., Sethi, A., Forsyth, P., & Poupart, P. (2019) · arXiv · doi:10.48550/arxiv.1905.11485 · Cited by 338
“While the adjacency matrix of a graph only represents local proximities, one can also define high-order proximity matrices [176] or similarity metrics [49].”
BackgroundSHINE: Signed Heterogeneous Information Network Embedding for Sentiment Link Prediction
Wang, H., Zhang, F., Hou, M., Xie, X., Guo, M., & Liu, Q. (2018) · Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining · doi:10.1145/3159652.3159666 · Cited by 334
Graph-Based Semi-Supervised Learning: A Comprehensive Review
Song, Z., Yang, X., Xu, Z., & King, I. (2023) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2022.3155478 · Cited by 334
Hamilton, W. L. (2020) · Synthesis lectures on artificial intelligence and machine learning · doi:10.2200/s01045ed1v01y202009aim046 · Cited by 320
Accelerated Attributed Network Embedding
Huang, X., Li, J., & Hu, X. (2017) · Proceedings of the 2017 SIAM International Conference on Data Mining · doi:10.1137/1.9781611974973.71 · Cited by 311
Revisiting User Mobility and Social Relationships in LBSNs: A Hypergraph Embedding Approach
Yang, D., Qu, B., Yang, J., & Cudre-Mauroux, P. (2019) · The World Wide Web Conference · doi:10.1145/3308558.3313635 · Cited by 299
Exploiting Edge Features for Graph Neural Networks
Gong, L., & Cheng, Q. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00943 · Cited by 279
VERSE: Versatile Graph Embeddings from Similarity Measures
Tsitsulin, A., Mottin, D., Karras, P., & Müller, E. (2018) · Proceedings of the 2018 World Wide Web Conference on World Wide Web - WWW '18 · doi:10.1145/3178876.3186120 · Cited by 277
DynGEM: Deep Embedding Method for Dynamic Graphs
Goyal, P., Kamra, N., He, X., & Liu, Y. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1805.11273 · Cited by 272
Deep learning similarities from different representations of source code
Tufano, M., Watson, C., Bavota, G., Di Penta, M., White, M., & Poshyvanyk, D. (2018) · Proceedings of the 15th International Conference on Mining Software Repositories · doi:10.1145/3196398.3196431 · Cited by 158
Tsuji, S., Hase, T., Yachie-Kinoshita, A., Nishino, T., Ghosh, S., Kikuchi, M., Shimokawa, K., Aburatani, H., Kitano, H., & Tanaka, H. (2021) · Alzheimer's Research & Therapy · doi:10.1186/s13195-021-00826-3 · Cited by 75
A Hybrid Approach for Fake News Detection in Twitter Based on User Features and Graph Embedding
Hamdi, T., Slimi, H., Bounhas, I., & Slimani, Y. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-36987-3_17 · Cited by 70
Devarakonda, M. V., Mohanty, S., Sunkishala, R. R., Mallampalli, N., & Liu, X. (2024) · Journal of Biomedical Informatics · doi:10.1016/j.jbi.2024.104627 · Cited by 9
Graph-based Multilingual Language Model: Leveraging Product Relations for Search Relevance
Choudhary, N., Rao, N., Subbian, K., & Reddy, C. K. (2022) · Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining · doi:10.1145/3534678.3539158 · Cited by 5
“Matrix factorization methods [22, 26] attempt to factorize the adjacency matrix A to a low-dimensional representational matrix L by minimizing ∥L L−A∥.”
Method
Metadata
- Authors
- Ou, M., Cui, P., Pei, J., Zhang, Z., & Zhu, W.
- Venue
- Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
- Publisher
- ACM
- Published
- 2016-08-13
- Pages
- 1105-1114
- OpenAlex
- W2387462954
- Cited by
- 1,248
- References
- 33
- FWCI
- 54.82
- Type
- conference paper
- Language
- en
- Open access
- closed
- Funders
- National Program on Key Basic Research Project (2015CB352300)
- National Natural Science Foundation of China (No. 61370022, No. 61531006, No. 61472444 and No. 61210008)
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.