Local Graph Partitioning using PageRank Vectors

Cited by (966)

Items 101–200 of 966

1. Balanced Partitions of Trees and Applications
   Andreas Emil Feldmann, Luca Foschini · 2013 · Algorithmica
2. A survey on semi-supervised graph clustering
   Fatemeh Daneshfar, Sayvan Soleymanbaigi, Parasto Yamini, Mohammad Sadra Amini · 2024 · Engineering Applications of Artificial Intelligence
3. A note on the PageRank of undirected graphs
   Vince I. Grolmusz · 2015 · Information Processing Letters
4. Fast distributed PageRank computation
   Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan, Eli Upfal · 2014 · Theoretical Computer Science
5. Crowdsourced Comprehension: Predicting Prerequisite Structure in Wikipedia
   Partha Pratim Talukdar, William W. Cohen · 2012
6. Distributing Antidote Using PageRank Vectors
   Fan Chung, Paul Horn, Alexander Tsiatas · 2009 · Internet Mathematics
7. Local community detection algorithm based on local modularity density
   Kun Guo, Xintong Huang, Ling Wu, Yuzhong Chen · 2021 · Applied Intelligence
8. Directed graph embedding
   Mo Chen, Qiong Yang, Xiaoou Tang · 2007 · International Joint Conference on Artificial Intelligence
9. A local perspective on community structure in multilayer networks
   Lucas G. S. Jeub, Michael W. Mahoney, Peter J. Mucha, Mason Alexander Porter · 2017 · Network Science
10. Efficient PageRank Tracking in Evolving Networks
    Naoto Ohsaka, Takanori Maehara, Ken‐ichi Kawarabayashi · 2015 · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)
11. Community Detection in Social Network with Pairwisely Constrained Symmetric Non-Negative Matrix Factorization
    Xiaohua Shi, Hongtao Lu, Yangchen He, Shan He · 2015 · IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)
12. A Local Graph Partitioning Algorithm Using Heat Kernel Pagerank
    Fan Chung · 2009 · Internet Mathematics
13. PageRank and Random Walks on Graphs
    Fan Chung, Wenbo Zhao · 2010 · Bolyai Society mathematical studies
14. Efficient personalized pagerank with accuracy assurance
    Yasuhiro Fujiwara, Makoto Nakatsuji, Takeshi Yamamuro, Hiroaki Shiokawa, Makoto Onizuka · 2012 · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)
15. $\mathsf {pSCAN}$ : Fast and Exact Structural Graph Clustering
    Lijun Chang, Wei Li, Lu Qin, Wenjie Zhang, Shiyu Yang · 2017 · IEEE Transactions on Knowledge and Data Engineering
16. User community detection via embedding of social network structure and temporal content
    Hossein Fani, Eric Jiang, Ebrahim Bagheri A, Feras N. Al-Obeidat, Weichang Du, Mehdi Kargar · 2019 · Information Processing & Management
17. Local Partitioning for Directed Graphs Using PageRank
    Reid Andersen, Fan Chung, Kevin Lang · 2008 · Internet Mathematics
18. Scalable discovery of best clusters on large graphs
    Kathy Macropol, Ambuj K. Singh · 2010 · Proceedings of the VLDB Endowment
19. Personalized PageRank Clustering: A graph clustering algorithm based on random walks
    Shayan A. Tabrizi, Azadeh Shakery, Masoud Asadpour, Maziar Abbasi, Mohammad Ali Tavallaie · 2013 · Physica A Statistical Mechanics and its Applications
20. A Local Algorithm for Structure-Preserving Graph Cut
    Dawei Zhou, Si Zhang, Mehmet Yigit Yildirim, Scott Alcorn, Hanghang Tong, Hasan Davulcu, Jingrui He · 2017 · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)
21. GAP: Generalizable Approximate Graph Partitioning Framework
    Azade Nazi, Will Hang, Anna Goldie, Sujith Ravi, Azalia Mirhoseini · 2019 · arXiv (Cornell University)
22. Topology-Imbalance Learning for Semi-Supervised Node Classification
    Deli Chen, Yankai Lin, Guangxiang Zhao, Xuancheng Ren, Peng Li, Jie Zhou, Xu Sun · 2021 · arXiv (Cornell University)
23. Local context selection for outlier ranking in graphs with multiple numeric node attributes
    Patricia Iglesias Sánchez, Emmanuel Müller, Oretta Irmler, Klemens Böhm · 2014 · International Conference on Scientific and Statistical Database Management
24. A Work-Efficient Parallel Sparse Matrix-Sparse Vector Multiplication Algorithm
    Ariful Azad, Aydın Buluç · 2017 · IEEE International Parallel and Distributed Processing Symposium (IPDPS)
25. Overlapping community detection by constrained personalized PageRank
    Yang Gao, Xiangzhan Yu, Hongli Zhang · 2021 · Expert Systems with Applications
26. Approximating the Expansion Profile and Almost Optimal Local Graph Clustering
    Shayan Oveis Gharan, Luca Trevisan · 2012 · Annual Symposium on Foundations of Computer Science
27. A Dynamic Algorithm for Local Community Detection in Graphs
    Anita Zakrzewska, David A. Bader · 2015 · IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)
28. Efficient Algorithms for the Identification of Top-$k$ Structural Hole Spanners in Large Social Networks
    Wenzheng Xu, Mojtaba Rezvani, Weifa Liang, Jeffrey Xu Yu, Chengfei Liu A · 2017 · IEEE Transactions on Knowledge and Data Engineering
29. Parallel personalized pagerank on dynamic graphs
    Wentian Guo, Yuchen Li, Mo Sha, Kian‐Lee Tan · 2017 · Proceedings of the VLDB Endowment
30. Local Community Detection in Multiple Networks
    Dongsheng Luo, Yuchen Bian, Yaowei Yan, Xiao Liu, Jun Huan, Xiang Zhang · 2020 · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)
31. Personalized PageRank to a Target Node, Revisited
    Hanzhi Wang, Zhewei Wei, Junhao Gan, Sibo Wang, Zengfeng Huang · 2020 · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)
32. Fast nearest-neighbor search in disk-resident graphs
    Purnamrita Sarkar, Andrew Moore · 2010 · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)
33. Efficient inference and learning in a large knowledge base
    William Yang Wang, Kathryn Mazaitis, Ni Lao, William W. Cohen · 2015 · Machine Learning
34. KnowSim: A Document Similarity Measure on Structured Heterogeneous Information Networks
    Chenguang Wang, Yangqiu Song, Haoran Li, Ming Zhang, Jiawei Han · 2015 · Proceedings
35. BePI
    Jinhong Jung, Namyong Park, Lee Sael, U Kang · 2017 · ACM SIGMOD International Conference on Management of Data (SIGMOD)
36. Adapting Community Detection Algorithms for Disease Module Identification in Heterogeneous Biological Networks
    Beethika Tripathi, Srinivasan Parthasarathy, Himanshu Sinha, Karthik Raman, Balaraman Ravindran · 2019 · Frontiers in Genetics
37. In a World That Counts
    Yixuan Li, Oscar Martinez, Xing Chen, Yi Li, John E. Hopcroft · 2016 · International World Wide Web Conference (WWW)
38. Quick Detection of Top-k Personalized PageRank Lists
    Konstantin E. Avrachenkov, Nelly Litvak, Danil Nemirovsky, Elena Smirnova, Marina Sokol · 2011 · Lecture notes in computer science
39. The Power of Local Information in Social Networks
    Christian Borgs, Michael Brautbar, Jennifer Chayes, Sanjeev Khanna, Brendan Lucier · 2012 · Lecture notes in computer science
40. Maximally selective single-cell target for circuit control in epilepsy models
    Darian H. Hadjiabadi, Matthew Lovett-Barron, Ivan Raikov, Fraser T. Sparks, Zhenrui Liao, Scott C. Baraban, Jure Leskovec, Attila Losonczy, Karl A. Deisseroth, Iván Soltész · 2021 · Neuron
41. A recommender system based on local random walks and spectral methods
    Zeinab Abbassi, Vahab Mirrokni · 2007
42. Efficient Algorithms for Personalized PageRank Computation: A Survey
    Mingji Yang, Hanzhi Wang, Zhewei Wei, Sibo Wang, Ji-Rong Wen · 2024 · IEEE Transactions on Knowledge and Data Engineering
43. Efficient Algorithms for Approximate Single-Source Personalized PageRank Queries
    Sibo Wang, Renchi Yang, Runhui Wang, Xiaokui Xiao, Zhewei Wei, Wenqing Lin, Yin Yang, Nan Tang · 2019 · ACM Transactions on Database Systems
44. Attributed Network Alignment: Problem Definitions and Fast Solutions
    Si Zhang, Hanghang Tong · 2018 · IEEE Transactions on Knowledge and Data Engineering
45. Temporal PageRank
    Polina Rozenshtein, Aristides Gionis · 2016 · Lecture notes in computer science
46. The Laplacian Paradigm: Emerging Algorithms for Massive Graphs
    Shang‐Hua Teng · 2010 · Lecture notes in computer science
47. Fast Matrix Computations for Pairwise and Columnwise Commute Times and Katz Scores
    Francesco Bonchi, Pooya Esfandiar, David F. Gleich, Chen Greif, Laks V. S. Lakshmanan · 2012 · Internet Mathematics
48. High-confidence near-duplicate image detection
    Wei Dong, Zhe Wang, Moses Charikar, Kai Li · 2012 · International Conference on Multimedia Retrieval
49. A local algorithm for finding dense subgraphs
    Reid Andersen · 2010 · ACM Transactions on Algorithms
50. Shift-Robust GNNs: Overcoming the Limitations of Localized Graph Training Data
    Qi Zhu, Natalia Ponomareva, Jiawei Han, Bryan Perozzi · 2021 · arXiv (Cornell University)
51. Incremental and accuracy-aware personalized pagerank through scheduled approximation
    Fanwei Zhu, Yuan Fang, Kevin Chen–Chuan Chang, Ying Jing · 2013 · Proceedings of the VLDB Endowment
52. A Dynamical System for PageRank with Time-Dependent Teleportation
    David F. Gleich, Ryan A. Rossi · 2014 · Internet Mathematics
53. SLING
    Boyu Tian, Xiaokui Xiao · 2016 · ACM SIGMOD International Conference on Management of Data (SIGMOD)
54. Influence Propagation Model for Clique-Based Community Detection in Social Networks
    Noha Alduaiji, Amitava Datta, Jianxin Li · 2018 · IEEE Transactions on Computational Social Systems
55. Consistency of cheeger and ratio graph cuts
    Nicolás García Trillos, Dejan Slepčev, James H. von Brecht, Thomas Laurent, Xavier Bresson · 2016 · KiltHub Repository
56. Approximate Graph Propagation
    Hanzhi Wang, Mingguo He, Zhewei Wei, Sibo Wang, Ye Yuan, Xiaoyong Du, Ji-Rong Wen · 2021 · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)
57. Scalable Data-Driven PageRank: Algorithms, System Issues, and Lessons Learned
    Joyce Jiyoung Whang, Andrew Lenharth, Inderjit S. Dhillon, Keshav K. Pingali · 2015 · Lecture notes in computer science
58. Minimizing Localized Ratio Cut Objectives in Hypergraphs
    Nate Veldt, Austin R. Benson, Jon Michael Kleinberg · 2020 · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)
59. Spectral affinity in protein networks
    Konstantin Voevodski, Shang‐Hua Teng, Yu Xia · 2009 · BMC Systems Biology
60. Finding Endogenously Formed Communities
    Maria-Florina Balcan, Christian Borgs, Mark Braverman, Jennifer Chayes, Shang‐Hua Teng · 2013 · ACM-SIAM Symposium on Discrete Algorithms (SODA)
61. Overlapping community detection in heterogeneous social networks via the user model
    Mingqing Huang, Guobing Zou, Bofeng Zhang, Yue Liu, Yajun Gu, Keyuan Jiang · 2017 · Information Sciences
62. Detecting DoS Attack in Smart Home IoT Devices Using a Graph-Based Approach
    Ramesh Paudel, Timothy Muncy, William Eberle · 2019 · IEEE International Conference on Big Data (BigData)
63. Massively parallel algorithms for personalized pagerank
    Guanhao Hou, Xingguang Chen, Sibo Wang, Zhewei Wei · 2021 · Proceedings of the VLDB Endowment
64. Multiscale Local Community Detection in Social Networks
    Wenjian Luo, Daofu Zhang, Ni Li, Nannan Lu · 2019 · IEEE Transactions on Knowledge and Data Engineering
65. Discovering Communities and Anomalies in Attributed Graphs
    Bryan Perozzi, Leman Akoglu · 2018 · ACM Transactions on Knowledge Discovery from Data
66. Realtime top-k personalized pagerank over large graphs on GPUs
    J. Y. Shi, Renchi Yang, Tianyuan Jin, Xiaokui Xiao, Yin Yang · 2019 · Proceedings of the VLDB Endowment
67. Graph theory in the information age
    Fan Chung, Linyuan Lü · 2006 · Regional conference series in mathematics
68. Multiple Local Community Detection
    Alexandre Hollocou, Thomas Bonald, Marc Lelarge · 2018 · ACM SIGMETRICS Performance Evaluation Review
69. E-tail Product Return Prediction via Hypergraph-based Local Graph Cut
    Jianbo Li, Jingrui He, Yada Zhu · 2018 · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)
70. T owards an SDP- based A pproach to S pectral M ethods : A Nearly-Linear-Time Algorithm for Graph Partitioning and Decomposition
    Lorenzo Orecchia, Nisheeth K. Vishnoi · 2011 · ACM-SIAM Symposium on Discrete Algorithms (SODA)
71. A review of protein–protein interaction network alignment: From pathway comparison to global alignment
    Chengyu Ma, Chung-Shou Liao · 2020 · Computational and Structural Biotechnology Journal
72. Unifying the Global and Local Approaches: An Efficient Power Iteration with Forward Push
    Hao Wu, Junhao Gan, Zhewei Wei, Rui Zhang · 2021 · ACM SIGMOD International Conference on Management of Data (SIGMOD)
73. Detecting Sharp Drops in PageRank and a Simplified Local Partitioning Algorithm
    Reid Andersen, Fan Chung · 2007 · Springer eBooks
74. Local Partitioning for Directed Graphs Using PageRank
    Reid Andersen, Fan Chung, Kevin Lang · 2007 · Springer eBooks
75. On Fully Dynamic Graph Sparsifiers
    Abraham, I., Durfee, D., Koutis, I., Krinninger, S., Richard Peng · 2016 · MPG.PuRe (Max Planck Society)
76. Random Alpha PageRank
    Paul G. Constantine, David F. Gleich · 2009 · Internet Mathematics
77. Four proofs for the Cheeger inequality and graph partition algorithms
    Fan Chung · 2007
78. Faster Algorithms for Computing the Stationary Distribution, Simulating Random Walks, and More
    Richard Peng, Aaron Sidford, Michael B. Cohen, Jonathan A. Kelner, John Peebles, Adrian Vladu · 2016 · DSpace@MIT (Massachusetts Institute of Technology)
79. Random Walk with Restart on Large Graphs Using Block Elimination
    Jinhong Jung, Kijung Shin, Lee Sael, U Kang · 2016 · ACM Transactions on Database Systems
80. Local weak convergence for PageRank
    Alessandro Garavaglia, Remco van der Hofstad, Nelly Litvak · 2020 · The Annals of Applied Probability
81. Personalized PageRank to a Target Node
    Peter Lofgren, Ashish Goel · 2013 · arXiv (Cornell University)
82. Local Network Community Detection with Continuous Optimization of Conductance and Weighted Kernel K-Means
    Twan van Laarhoven, Elena Marchiori · 2016 · arXiv (Cornell University)
83. A comparative study on community detection methods in complex networks
    Zhongying Zhao, Zheng Shaoqiang, Chao Li, Jinqing Sun, Liang Chang, Francisco Chiclana · 2018 · Journal of Intelligent & Fuzzy Systems
84. Supervised and extended restart in random walks for ranking and link prediction in networks
    Woojeong Jin, Jinhong Jung, U Kang · 2019 · PLoS ONE
85. Community Search over Big Graphs
    Xin Sunny Huang, Laks V. S. Lakshmanan, Jianliang Xu · 2019 · Synthesis lectures on data management
86. Locality-aware subgraphs for inductive link prediction in knowledge graphs
    Hebatallah A. Mohamed, Diego Pilutti, Stuart James, Alessio Del Bue, Marcello Pelillo, Sebastiano Vascon · 2023 · Pattern Recognition Letters
87. Using Local Spectral Methods to Robustify Graph-Based Learning Algorithms
    David F. Gleich, Michael W. Mahoney · 2015 · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)
88. Erdos Goes Neural: an Unsupervised Learning Framework for Combinatorial Optimization on Graphs
    Nikolaos Karalias, Andreas Loukas · 2020 · arXiv (Cornell University)
89. A Sublinear Time Algorithm for PageRank Computations
    Christian Borgs, Michael Brautbar, Jennifer Chayes, Shang‐Hua Teng · 2012 · Lecture notes in computer science
90. Graph-based Sybil detection in social and information systems
    Yazan Boshmaf, Konstantin Beznosov, Matei Ripeanu · 2013 · IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)
91. Generalized PageRank on directed configuration networks
    Ningyuan Chen, Nelly Litvak, Mariana Olvera‐Cravioto · 2016 · Random Structures and Algorithms
92. Efficient Estimation of Heat Kernel PageRank for Local Clustering
    Renchi Yang, Xiaokui Xiao, Zhewei Wei, Sourav Saha Bhowmick, Jun Zhao, Rong-Hua Li · 2019 · ACM SIGMOD International Conference on Management of Data (SIGMOD)
93. Fast and Accurate Random Walk with Restart on Dynamic Graphs with Guarantees
    Minji Yoon, Woojeong Jin, U Kang · 2018 · International World Wide Web Conference (WWW)
94. Krylov Subspace Approximation for Local Community Detection in Large Networks
    Kun He, Pan Shi, David Bindel, John E. Hopcroft · 2019 · ACM Transactions on Knowledge Discovery from Data
95. Simrank++
    Ioannis Antonellis, Héctor García-Molina, Chi-Chao Chang · 2008 · International World Wide Web Conference (WWW)
96. Local Community Detection in Dynamic Networks
    Daniel J. DiTursi, Gaurav Ghosh, Petko Bogdanov · 2017 · Proceedings
97. Local Flow Partitioning for Faster Edge Connectivity
    Monika Rauch Henzinger, Satish B. Rao, Di Wang · 2017 · ACM-SIAM Symposium on Discrete Algorithms (SODA)
98. On the embeddability of random walk distances
    Xiaohan Zhao, Adelbert Chang, Atish Das Sarma, Hai-Tao Zheng, Ben Y. Zhao · 2013 · Proceedings of the VLDB Endowment
99. Streaming Balanced Graph Partitioning Algorithms for Random Graphs
    Isabelle Stanton · 2012
100. Breaking quadratic time for small vertex connectivity and an approximation scheme
     Danupon Nanongkai, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai · 2019 · ACM Symposium on Theory of Computing (STOC)