Open Access Helper

OpenAlex Citation Counts

OpenAlex Citations Logo

OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!

If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.

Requested Article:

LightNE: A Lightweight Graph Processing System for Network Embedding
Jiezhong Qiu, Laxman Dhulipala, Jie Tang, et al.
Proceedings of the 2022 International Conference on Management of Data (2021)
Closed Access | Times Cited: 24

Showing 24 citing articles:

Link prediction using low-dimensional node embeddings: The measurement problem
Nicolas Menand, C. Seshadhri
Proceedings of the National Academy of Sciences (2024) Vol. 121, Iss. 8
Open Access | Times Cited: 5
CompressGraph: Efficient Parallel Graph Analytics with Rule-Based Compression
Chen Zheng, Feng Zhang, Jiawei Guan, et al.
Proceedings of the ACM on Management of Data (2023) Vol. 1, Iss. 1, pp. 1-31
Closed Access | Times Cited: 10
SketchNE: Embedding Billion-Scale Networks Accurately in One Hour
Yuyang Xie, Yuxiao Dong, Jiezhong Qiu, et al.
IEEE Transactions on Knowledge and Data Engineering (2023) Vol. 35, Iss. 10, pp. 10666-10680
Open Access | Times Cited: 6
PANE: scalable and effective attributed network embedding
Renchi Yang, J. Y. Shi, Xiaokui Xiao, et al.
The VLDB Journal (2023) Vol. 32, Iss. 6, pp. 1237-1262
Closed Access | Times Cited: 4
Efficient Estimation of Pairwise Effective Resistance
Renchi Yang, Jing Tang
Proceedings of the ACM on Management of Data (2023) Vol. 1, Iss. 1, pp. 1-27
Open Access | Times Cited: 4
Accelerating Sampling and Aggregation Operations in GNN Frameworks with GPU Initiated Direct Storage Accesses
Jeongmin Park, Vikram Sharma Mailthody, Zaid Qureshi, et al.
Proceedings of the VLDB Endowment (2024) Vol. 17, Iss. 6, pp. 1227-1240
Open Access | Times Cited: 1
Efficient Approximation of Kemeny's Constant for Large Graphs
Haisong Xia, Zhongzhi Zhang
Proceedings of the ACM on Management of Data (2024) Vol. 2, Iss. 3, pp. 1-26
Closed Access | Times Cited: 1
Automated Unsupervised Graph Representation Learning
Zhenyu Hou, Yukuo Cen, Yuxiao Dong, et al.
IEEE Transactions on Knowledge and Data Engineering (2021), pp. 1-1
Open Access | Times Cited: 7
DistMILE: A Distributed Multi-Level Framework for Scalable Graph Embedding
Yuntian He, Saket Gurukar, Pouya Kousha, et al.
(2021), pp. 282-291
Closed Access | Times Cited: 6
A Fast Adaptive Randomized PCA Algorithm
Xu Feng, Wenjian Yu
(2023), pp. 3695-3704
Open Access | Times Cited: 2
Efficient Network Representation Learning via Cluster Similarity
Yasuhiro Fujiwara, Yasutoshi Ida, Atsutoshi Kumagai, et al.
Data Science and Engineering (2023) Vol. 8, Iss. 3, pp. 279-291
Open Access | Times Cited: 2
Resistance Eccentricity in Graphs: Distribution, Computation and Optimization
Zenan Lu, Xiaotian Zhou, Ahad N. Zehmakan, et al.
2022 IEEE 38th International Conference on Data Engineering (ICDE) (2024), pp. 4113-4126
Closed Access
GraphScale: A Framework to Enable Machine Learning over Billion-node Graphs
Vipul Gupta, Xin Chen, Ruoyun Huang, et al.
(2024), pp. 4514-4521
Closed Access
Time- and Space-Efficiently Sketching Billion-Scale Attributed Networks
Wei Wu, Shiqi Li, Mi Jiang, et al.
IEEE Transactions on Knowledge and Data Engineering (2024) Vol. 37, Iss. 2, pp. 966-978
Closed Access
FairMILE: Towards an Efficient Framework for Fair Graph Representation Learning
Yuntian He, Saket Gurukar, Srinivasan Parthasarathy
(2023), pp. 1-10
Open Access | Times Cited: 1
Towards Lightweight and Automated Representation Learning System for Networks
Yuyang Xie, Jiezhong Qiu, Laxman Dhulipala, et al.
IEEE Transactions on Knowledge and Data Engineering (2023) Vol. 35, Iss. 9, pp. 9613-9627
Open Access | Times Cited: 1
Efficient Network Representation Learning via Cluster Similarity
Yasuhiro Fujiwara, Yasutoshi Ida, Atsutoshi Kumagai, et al.
Lecture notes in computer science (2023), pp. 297-307
Closed Access | Times Cited: 1
High-Performance and Flexible Parallel Algorithms for Semisort and Related Problems
Xiaojun Dong, Yunshu Wu, Zhongqi Wang, et al.
(2023), pp. 341-353
Open Access | Times Cited: 1
Accelerating Dynamic Network Embedding with Billions of Parameter Updates to Milliseconds
Haoran Deng, Yang Yang, Jiahe Li, et al.
Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (2023), pp. 414-425
Open Access | Times Cited: 1
MGRL: attributed multiplex heterogeneous network representation learning based on multi-granularity information fusion
Ke Chen, Guoyin Wang, Shun Fu, et al.
International Journal of Machine Learning and Cybernetics (2022) Vol. 13, Iss. 7, pp. 1891-1906
Closed Access | Times Cited: 2
HUGE: Huge Unsupervised Graph Embeddings with TPUs
Brandon A. Mayer, Anton Tsitsulin, Hendrik Fichtenberger, et al.
Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (2023), pp. 4638-4648
Open Access
Design and Implementation of External Storage Large-Scale Graph Computing System
Lingbin Liu, Jianqiang Huang, Dongqiang Huang, et al.
(2023), pp. 297-304
Closed Access
Fast Binary Network Hashing via Graph Clustering
Yasuhiro Fujiwaray, Masahiro Nakanoy, Atsutoshi Kumagai, et al.
2021 IEEE International Conference on Big Data (Big Data) (2022), pp. 381-388
Closed Access
NetMF+: Network Embedding Based on Fast and Effective Single-Pass Randomized Matrix Factorization
Yuyang Xie, Jiezhong Qiu, Wenjian Yu, et al.
arXiv (Cornell University) (2021)
Open Access
Page 1

Scroll to top