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:

Predicting User Roles in Social Networks Using Transfer Learning with Feature Transformation
Jun Sun, Jérôme Kunegis, Steffen Staab
(2016), pp. 128-135
Open Access | Times Cited: 19

Showing 19 citing articles:

Disruptive coefficient and 2-step disruptive coefficient: Novel measures for identifying vital nodes in complex networks
Alex J. Yang, Sanhong Deng, Hao Wang, et al.
Journal of Informetrics (2023) Vol. 17, Iss. 3, pp. 101411-101411
Closed Access | Times Cited: 18
Time-aware Gradient Attack on Dynamic Network Link Prediction
Jinyin Chen, Jian Zhang, Zhi Chen, et al.
IEEE Transactions on Knowledge and Data Engineering (2021), pp. 1-1
Open Access | Times Cited: 32
Fast approximation of eccentricities and distances in hyperbolic graphs
Victor Chepoi, Feodor F. Dragan, Michel Habib, et al.
Journal of Graph Algorithms and Applications (2019) Vol. 23, Iss. 2, pp. 393-433
Open Access | Times Cited: 12
A Quotient Space Formulation for Statistical Analysis of Graphical Data.
Xiaoyang Guo, Anuj Srivastava, Sudeep Sarkar
arXiv (Cornell University) (2019)
Closed Access | Times Cited: 12
Computing top-k temporal closeness in temporal networks
Lutz Oettershagen, Petra Mutzel
Knowledge and Information Systems (2022) Vol. 64, Iss. 2, pp. 507-535
Open Access | Times Cited: 6
A Quotient Space Formulation for Generative Statistical Analysis of Graphical Data
Xiaoyang Guo, Anuj Srivastava, Sudeep Sarkar
Journal of Mathematical Imaging and Vision (2021) Vol. 63, Iss. 6, pp. 735-752
Closed Access | Times Cited: 7
Fast Approximation of Centrality and Distances in Hyperbolic Graphs
Victor Chepoi, Feodor F. Dragan, Michel Habib, et al.
Lecture notes in computer science (2018), pp. 3-18
Closed Access | Times Cited: 4
Fast Generating A Large Number of Gumbel-Max Variables
Yiyan Qi, Pinghui Wang, Yuanming Zhang, et al.
(2020), pp. 796-807
Open Access | Times Cited: 4
Understanding Social Networks Using Transfer Learning
Jun Sun, Steffen Staab, Jérôme Kunegis
Computer (2018) Vol. 51, Iss. 6, pp. 52-60
Open Access | Times Cited: 3
Link prediction in directed complex networks: combining similarity-popularity and path patterns mining
Hafida Benhidour, Lama Almeshkhas, Said Kerrache
Applied Intelligence (2024) Vol. 54, Iss. 17-18, pp. 8634-8665
Closed Access
Learning Stochastic Equivalence based on Discrete Ricci Curvature
Xuan Guo, Qiang Tian, Wang Zhang, et al.
(2021), pp. 1456-1462
Open Access | Times Cited: 3
A Quotient Space Formulation for Generative Statistical Analysis of Graphical Data
Xiaoyang Guo, Anuj Srivastava, Sudeep Sarkar
arXiv (Cornell University) (2019)
Open Access | Times Cited: 2
Evaluation of the accuracy of transfer learning on sentiment analysis for Indonesian tweets
Kartika Syskya Wydya, Hendri Murfi, Yudi Satria
(2017), pp. 231-236
Closed Access | Times Cited: 1
Network Similarity Prediction in Time-Evolving Graphs: A Machine Learning Approach
Keyvan Sasani, Mohammad Hossein Namaki, Assefaw H. Gebremedhin
2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) (2018), pp. 1184-1193
Closed Access | Times Cited: 1
BSR-TC: Adaptively Sampling for Accurate Triangle Counting over Evolving Graph Streams
Wei Xuan, Huawei Cao, Mingyu Yan, et al.
International Journal of Software Engineering and Knowledge Engineering (2021) Vol. 31, Iss. 11n12, pp. 1561-1581
Closed Access | Times Cited: 1
Constant state of change: engagement inequality in temporal dynamic networks
Hadar Miller, Osnat Mokryn
Applied Network Science (2019) Vol. 4, Iss. 1
Open Access
Fast Generating A Large Number of Gumbel-Max Variables
Yiyan Qi, Pinghui Wang, Yuanming Zhang, et al.
arXiv (Cornell University) (2020)
Open Access
Efficient parallel graph trimming by arc-consistency
Bin Guo, Emil Sekerinski
The Journal of Supercomputing (2022) Vol. 78, Iss. 13, pp. 15269-15313
Open Access
An Index for Single Source All Destinations Distance Queries in Temporal Graphs.
Lutz Oettershagen, Petra Mutzel
arXiv (Cornell University) (2021)
Closed Access
Page 1

Scroll to top