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:

VERSE
Anton Tsitsulin, Davide Mottin, Panagiotis Karras, et al.
(2018), pp. 539-548
Open Access | Times Cited: 161

Showing 1-25 of 161 citing articles:

Contrastive Multi-View Representation Learning on Graphs
Kaveh Hassani, Amir Hosein Khasahmadi
arXiv (Cornell University) (2020)
Open Access | Times Cited: 292

NetSMF: Large-Scale Network Embedding as Sparse Matrix Factorization
Jiezhong Qiu, Yuxiao Dong, Hao Ma, et al.
(2019)
Open Access | Times Cited: 157

Complex Networks: a Mini-review
Angélica S. Mata
Brazilian Journal of Physics (2020) Vol. 50, Iss. 5, pp. 658-672
Open Access | Times Cited: 116

LBSN2Vec++: Heterogeneous Hypergraph Embedding for Location-Based Social Networks
Dingqi Yang, Bingqing Qu, Jie Yang, et al.
IEEE Transactions on Knowledge and Data Engineering (2020), pp. 1-1
Open Access | Times Cited: 72

Deep graph similarity learning: a survey
Guixiang Ma, Nesreen K. Ahmed, Theodore L. Willke, et al.
Data Mining and Knowledge Discovery (2021) Vol. 35, Iss. 3, pp. 688-725
Open Access | Times Cited: 67

Graph Learning for Combinatorial Optimization: A Survey of State-of-the-Art
Yün Peng, Byron Choi, Jianliang Xu
Data Science and Engineering (2021) Vol. 6, Iss. 2, pp. 119-141
Open Access | Times Cited: 61

Network Representation Learning: From Preprocessing, Feature Extraction to Node Embedding
Jingya Zhou, Ling Liu, Wenqi Wei, et al.
ACM Computing Surveys (2022) Vol. 55, Iss. 2, pp. 1-35
Open Access | Times Cited: 58

NetLSD
Anton Tsitsulin, Davide Mottin, Panagiotis Karras, et al.
(2018)
Open Access | Times Cited: 81

Fast and Accurate Network Embeddings via Very Sparse Random Projection
Haochen Chen, Syed Fahad Sultan, Yingtao Tian, et al.
(2019)
Open Access | Times Cited: 62

A General View for Network Embedding as Matrix Factorization
Xin Liu, Tsuyoshi Murata, Kyoung‐Sook Kim, et al.
(2019), pp. 375-383
Closed Access | Times Cited: 61

GraphVite: A High-Performance CPU-GPU Hybrid System for Node Embedding
Zhaocheng Zhu, Shizhen Xu, Jian Tang, et al.
(2019)
Open Access | Times Cited: 57

NodeSketch
Dingqi Yang, Paolo Rosso, Bin Li, et al.
(2019), pp. 1162-1172
Closed Access | Times Cited: 54

DDGK: Learning Graph Representations for Deep Divergence Graph Kernels
Rami Al‐Rfou, Bryan Perozzi, Dustin Zelle
(2019)
Open Access | Times Cited: 53

Node Representation Learning for Directed Graphs
Megha Khosla, Jurek Leonhardt, Wolfgang Nejdl, et al.
Lecture notes in computer science (2020), pp. 395-411
Closed Access | Times Cited: 39

MultiVERSE: a multiplex and multiplex-heterogeneous network embedding approach
Léo Pio-Lopez, Alberto Valdeolivas, Laurent Tichit, et al.
Scientific Reports (2021) Vol. 11, Iss. 1
Open Access | Times Cited: 39

Unifying the Global and Local Approaches: An Efficient Power Iteration with Forward Push
Hao Wu, Junhao Gan, Zhewei Wei, et al.
Proceedings of the 2022 International Conference on Management of Data (2021), pp. 1996-2008
Open Access | Times Cited: 36

A Comparative Study for Unsupervised Network Representation Learning
Megha Khosla, Vinay Setty, Avishek Anand
IEEE Transactions on Knowledge and Data Engineering (2019), pp. 1-1
Open Access | Times Cited: 36

Large-Scale Talent Flow Embedding for Company Competitive Analysis
Le Zhang, Tong Xu, Hengshu Zhu, et al.
(2020), pp. 2354-2364
Closed Access | Times Cited: 36

Scaling attributed network embedding to massive graphs
Renchi Yang, J. Y. Shi, Xiaokui Xiao, et al.
Proceedings of the VLDB Endowment (2020) Vol. 14, Iss. 1, pp. 37-49
Open Access | Times Cited: 36

FREDE
Anton Tsitsulin, Marina Munkhoeva, Davide Mottin, et al.
Proceedings of the VLDB Endowment (2021) Vol. 14, Iss. 6, pp. 1102-1110
Open Access | Times Cited: 28

Link Prediction via Higher-Order Motif Features
Ghadeer Abuoda, Gianmarco De Francisci Morales, Ashraf Aboulnaga
Lecture notes in computer science (2020), pp. 412-429
Closed Access | Times Cited: 28

Learning Based Proximity Matrix Factorization for Node Embedding
Xingyi Zhang, Kun Xie, Sibo Wang, et al.
(2021), pp. 2243-2253
Open Access | Times Cited: 25

Page 1 - Next Page

Scroll to top