
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:
Guided sampling for large graphs
Muhammad Irfan Yousuf, Suhyun Kim
Data Mining and Knowledge Discovery (2020) Vol. 34, Iss. 4, pp. 905-948
Closed Access | Times Cited: 14
Muhammad Irfan Yousuf, Suhyun Kim
Data Mining and Knowledge Discovery (2020) Vol. 34, Iss. 4, pp. 905-948
Closed Access | Times Cited: 14
Showing 14 citing articles:
A novel fuzzy knowledge graph structure for decision making of multimodal big data
Nguyen Hong Tan, Cu Kim Long, Trần Mạnh Tuấn, et al.
Applied Intelligence (2025) Vol. 55, Iss. 6
Closed Access
Nguyen Hong Tan, Cu Kim Long, Trần Mạnh Tuấn, et al.
Applied Intelligence (2025) Vol. 55, Iss. 6
Closed Access
A Survey of Sampling Method for Social Media Embeddedness Relationship
Yingan Cui, Li Xue, Junhuai Li, et al.
ACM Computing Surveys (2022) Vol. 55, Iss. 4, pp. 1-39
Closed Access | Times Cited: 9
Yingan Cui, Li Xue, Junhuai Li, et al.
ACM Computing Surveys (2022) Vol. 55, Iss. 4, pp. 1-39
Closed Access | Times Cited: 9
Temporal network compression via network hashing
Rémi Vaudaine, Pierre Borgnat, Paulo Gonçalvès, et al.
Applied Network Science (2024) Vol. 9, Iss. 1
Open Access | Times Cited: 1
Rémi Vaudaine, Pierre Borgnat, Paulo Gonçalvès, et al.
Applied Network Science (2024) Vol. 9, Iss. 1
Open Access | Times Cited: 1
Extracting High-Fidelity Smaller Scale Subgraphs of Complex Networks by Edge-Reinforced Random Walk
Dan Chen, Housheng Su
IEEE Transactions on Computational Social Systems (2024) Vol. 11, Iss. 5, pp. 6181-6191
Closed Access | Times Cited: 1
Dan Chen, Housheng Su
IEEE Transactions on Computational Social Systems (2024) Vol. 11, Iss. 5, pp. 6181-6191
Closed Access | Times Cited: 1
Triangle-induced and degree-wise sampling over large graphs in social networks
Elaheh Gavagsaz, Alireza Souri
The Journal of Supercomputing (2024) Vol. 81, Iss. 1
Closed Access | Times Cited: 1
Elaheh Gavagsaz, Alireza Souri
The Journal of Supercomputing (2024) Vol. 81, Iss. 1
Closed Access | Times Cited: 1
An Enhanced Filtering-Based Information Granulation Procedure for Graph Embedding and Classification
Alessio Martino, Antonello Rizzi
IEEE Access (2021) Vol. 9, pp. 15426-15440
Open Access | Times Cited: 8
Alessio Martino, Antonello Rizzi
IEEE Access (2021) Vol. 9, pp. 15426-15440
Open Access | Times Cited: 8
Empirical characterization of graph sampling algorithms
Muhammad Irfan Yousuf, Izza Anwer, Raheel Anwar
Social Network Analysis and Mining (2023) Vol. 13, Iss. 1
Open Access | Times Cited: 3
Muhammad Irfan Yousuf, Izza Anwer, Raheel Anwar
Social Network Analysis and Mining (2023) Vol. 13, Iss. 1
Open Access | Times Cited: 3
Sampling unknown large networks restricted by low sampling rates
Bo Jiao
Scientific Reports (2024) Vol. 14, Iss. 1
Open Access
Bo Jiao
Scientific Reports (2024) Vol. 14, Iss. 1
Open Access
Supports estimation via graph sampling
Xin Wang, Jun-Hao Shi, Jie-Jun Zou, et al.
Expert Systems with Applications (2023) Vol. 240, pp. 122554-122554
Closed Access | Times Cited: 1
Xin Wang, Jun-Hao Shi, Jie-Jun Zou, et al.
Expert Systems with Applications (2023) Vol. 240, pp. 122554-122554
Closed Access | Times Cited: 1
MNI: An enhanced multi-task neighborhood interaction model for recommendation on knowledge graph
Xintao Ma, Liyan Dong, Yuequn Wang, et al.
PLoS ONE (2021) Vol. 16, Iss. 10, pp. e0258410-e0258410
Open Access | Times Cited: 3
Xintao Ma, Liyan Dong, Yuequn Wang, et al.
PLoS ONE (2021) Vol. 16, Iss. 10, pp. e0258410-e0258410
Open Access | Times Cited: 3
Empirical Characterization of Graph Sampling Algorithms
Muhammad Irfan Yousuf, Izza Anwer, Raheel Anwar
Research Square (Research Square) (2022)
Open Access | Times Cited: 2
Muhammad Irfan Yousuf, Izza Anwer, Raheel Anwar
Research Square (Research Square) (2022)
Open Access | Times Cited: 2
Link Pruning for Community Detection in Social Networks
Jeongseon Kim, Soohwan Jeong, Sungsu Lim
Applied Sciences (2022) Vol. 12, Iss. 13, pp. 6811-6811
Open Access | Times Cited: 2
Jeongseon Kim, Soohwan Jeong, Sungsu Lim
Applied Sciences (2022) Vol. 12, Iss. 13, pp. 6811-6811
Open Access | Times Cited: 2
Hierarchical Sampling for the Visualization of Large Scale-Free Graphs
Bo Jiao, Xin Lu, Jingbo Xia, et al.
IEEE Transactions on Visualization and Computer Graphics (2022) Vol. 29, Iss. 12, pp. 5111-5123
Closed Access | Times Cited: 1
Bo Jiao, Xin Lu, Jingbo Xia, et al.
IEEE Transactions on Visualization and Computer Graphics (2022) Vol. 29, Iss. 12, pp. 5111-5123
Closed Access | Times Cited: 1
A Neighborhood-preserving Graph Summarization
Abd Errahmane Kiouche, Julien Baste, Mohammed Haddad, et al.
arXiv (Cornell University) (2021)
Open Access
Abd Errahmane Kiouche, Julien Baste, Mohammed Haddad, et al.
arXiv (Cornell University) (2021)
Open Access