Local Graph Partitioning using PageRank Vectors
Andersen, Reid, Chung, Fan, Lang, Kevin·2006·2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)
Cited by (966)
Items 401–500 of 966
- Mathematical and Algorithmic Analysis of Network and Biological DataCharalampos E. Tsourakakis · 2014 · arXiv (Cornell University)
- Efficient Tree-SVD for Subset Node Embedding over Large Dynamic GraphsXinyu Du, Xingyi Zhang, Sibo Wang, Zengfeng Huang · 2023 · Proceedings of the ACM on Management of Data
- Integrating multi-modal deep learning on knowledge graph for the discovery of synergistic drug combinations against infectious diseasesQing Ye, Ruolan Xu, Dan Li, Yu Kang, Yafeng Deng, Feng Zhu, Jiming Chen, Shibo He, Chang‐Yu Hsieh, Tingjun Hou · 2023 · Cell Reports Physical Science
- Targeted pandemic containment through identifying local contact network bottlenecksShenghao Yang, Priyabrata Senapati, Di Wang, Chris T. Bauch, Kimon Fountoulakis · 2021 · PLoS Computational Biology
- Edge-based local push for personalized PageRankHanzhi Wang, Zhewei Wei, Junhao Gan, Ye Yuan, Xiaoyong Du, Ji-Rong Wen · 2022 · Proceedings of the VLDB Endowment
- Anchored Densest SubgraphYizhou Dai, Miao Qiao, Lijun Chang · 2022 · ACM SIGMOD International Conference on Management of Data (SIGMOD)
- To Be Connected, or Not to Be ConnectedNatali Ruchansky, Francesco Bonchi, David García-Soriano, Francesco Gullo, Nicolas Kourtellis · 2017 · ACM International Conference on Information and Knowledge Management (CIKM)
- Hierarchical data structures for flowchartPeng Zhang, Wen-zhang Dou, Huaping Liu · 2023 · Scientific Reports
- An agent-based algorithm exploiting multiple local dissimilarities for clusters mining and knowledge discoveryFilippo Maria Bianchi, Enrico Maiorino, Lorenzo Livi, Antonello Rizzi, Alireza Sadeghian · 2015 · Soft Computing
- Finding and Visualizing Graph Clusters Using PageRank OptimizationFan Chung, Alexander Tsiatas · 2012 · Internet Mathematics
- A short-graph fourier transform via personalized pagerank vectorsMariano Tepper, Guillermo Sapiro · 2016 · IEEE International Conference on Acoustics Speech and Signal Processing
- LASAGNE: Locality and Structure Aware Graph Node EmbeddingEvgeniy Faerman, Felix Borutta, Kimon Fountoulakis, Michael W. Mahoney · 2018 · IEEE/WIC/ACM International Conference on Web Intelligence
- Mean Field Analysis of Personalized PageRank with Implications for Local Graph ClusteringKonstantin E. Avrachenkov, Arun Kadavankandy, Nelly Litvak · 2018 · Journal of Statistical Physics
- Learning Resolution Parameters for Graph ClusteringNate Veldt, David F. Gleich, Anthony Ian Wirth · 2019 · International World Wide Web Conference (WWW)
- Clustering for Private Interest-based AdvertisingAlessandro Epasto, Andrés Muñoz Medina, Steven G. Avery, Yijian Bai, Róbert Busa‐Fekete, CJ Carey, Ya Gao, David Guthrie, Subham Ghosh, James Ioannidis et al. · 2021 · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)
- Finding Small Sparse Cuts by Random WalkTsz Chiu Kwok, Lap Chi Lau · 2012 · Lecture notes in computer science
- Static and Dynamic Community Detection Methods That Optimize a Specific Objective Function: A Survey and Experimental EvaluationKamal Taha · 2020 · IEEE Access
- Semi-supervised Eigenvectors for Large-scale Locally-biased LearningToke Jansen Hansen, Michael W. Mahoney · 2013 · arXiv (Cornell University)
- Indexed fast network proximity queryingMustafa Coşkun, Ananth Y. Grama, Mehmet Koyutürk · 2018 · Proceedings of the VLDB Endowment
- Fast Approximation Algorithms for Cut-based Problems in Undirected GraphsAleksander Mądry · 2010 · arXiv (Cornell University)
- $p$-Norm Flow Diffusion for Local Graph ClusteringKimon Fountoulakis, Di Wang, Shenghao Yang · 2020 · arXiv (Cornell University)
- iNet: visual analysis of irregular transition in multivariate dynamic networksDongming Han, Jiacheng Pan, Rusheng Pan, Dawei Zhou, Nan Cao, Jingrui He, Mingliang Xu, Wei Chen · 2021 · Frontiers of Computer Science
- Algorithms to Detect Multiprotein Modularity Conserved during EvolutionLuqman Mushila Hodgkinson, Richard M. Karp · 2011 · IEEE Transactions on Computational Biology and Bioinformatics
- Fast Katz and Commuters: Efficient Estimation of Social Relatedness in Large NetworksPooya Esfandiar, Francesco Bonchi, David F. Gleich, Chen Greif, Laks V. S. Lakshmanan, Byung-Won On · 2010 · Lecture notes in computer science
- Efficient Batch One-Hop Personalized PageRanksSiqiang Luo, Xiaokui Xiao, Wenqing Lin, Ben Kao · 2019 · IEEE International Conference on Data Engineering (ICDE)
- Robust Hierarchical Overlapping Community Detection With Personalized PageRankYinglong Zhang, Xuewen Xia, Xing Xu, Fei Yu, Hongrun Wu, Ying Yu, Bo Wei · 2020 · IEEE Access
- Incomplete Network AlignmentSi Zhang, Hanghang Tong, Jie Tang, Jiejun Xu, Wei Fan · 2020 · ACM Transactions on Knowledge Discovery from Data
- Towards Efficient Motif-based Graph Partitioning: An Adaptive Sampling ApproachShixun Huang, Yuchen Li, Zhifeng Bao, Zhao Li · 2021 · IEEE International Conference on Data Engineering (ICDE)
- Attributed multi-query community search via random walk similarityQingqing Li, Huifang Ma, Ju Li, Zhixin Li, Liang Chang · 2023 · Information Sciences
- MTP: discovering high quality partitions in real world graphsYongsub Lim, Won-Jo Lee, Ho‐Jin Choi, U Kang · 2016 · World Wide Web
- Faster Algorithms for Computing the Stationary Distribution, Simulating Random Walks, and MoreMichael B. Cohen, Jonathan A. Kelner, John Peebles, Richard Peng, Aaron Sidford, Adrian Vladu · 2016 · Annual Symposium on Foundations of Computer Science
- Graph Clustering Based on Attribute-Aware Graph EmbeddingEsra Akbaş, Peixiang Zhao · 2019 · Lecture notes in social networks
- Local Graph Clustering With Network LassoAlexander Jung, Yasmin SarcheshmehPour · 2020 · IEEE Signal Processing Letters
- Uncovering overlapping community structure in static and dynamic networksYang Gao, Xiangzhan Yu, Hongli Zhang · 2020 · Knowledge-Based Systems
- PageRank asymptotics on directed preferential attachment networksSayan Banerjee, Mariana Olvera‐Cravioto · 2022 · The Annals of Applied Probability
- Algorithms and Models for the Web GraphDavid F. Gleich, Júlia Komjáthy, Nelly Litvak · 2015 · Lecture notes in computer science
- Local Community Detection in Dynamic Graphs Using Personalized CentralityEisha Nathan, Anita Zakrzewska, Jason Riedy, David A. Bader · 2017 · Algorithms
- The blessing of transitivity in sparse and stochastic networksKarl Rohe, Tai Qin · 2013 · arXiv (Cornell University)
- Combinatorial Approximation Algorithms for MaxCut using Random WalksSatyen Kale, Comandur Seshadhri · 2010 · arXiv (Cornell University)
- SLING: A Near-Optimal Index Structure for SimRankBoyu Tian, Xiaokui Xiao · 2016 · arXiv (Cornell University)
- Semantic Web and Web Page Clustering Algorithms: A Landscape ViewAhmed J. Obaid, Tanusree Chatterjee, Abhishek Bhattacharya · 2020 · EAI Endorsed Transactions on Energy Web
- Effective and Efficient PageRank-based Positioning for Graph VisualizationShiqi Zhang, Renchi Yang, Xiaokui Xiao, Xiao Yan, Bo Tang · 2023 · Proceedings of the ACM on Management of Data
- Scalable decoupling graph neural network with feature-oriented optimizationNingyi Liao, Dingheng Mo, Siqiang Luo, Xiang Li, Pengcheng Yin · 2023 · The VLDB Journal
- Learning-Based Attribute-Augmented Proximity Matrix Factorization for Attributed Network EmbeddingKun Xie, Xiangyu Dong, Yusong Zhang, Xingyi Zhang, Qintian Guo, Sibo Wang · 2024 · IEEE Transactions on Knowledge and Data Engineering
- Networks, communities and kronecker productsJure Leskovec · 2009
- Random surfing on multipartite graphsΑθανάσιος Ν. Νικολακόπουλος, Antonia Korba, John D. Garofalakis · 2016 · IEEE International Conference on Big Data (BigData)
- Sublinear Algorithms for Local Graph Centrality EstimationMarco Bressan, Enoch Peserico, Luca Pretto · 2018 · Annual Symposium on Foundations of Computer Science
- Multiscale Wasserstein Shortest-Path Graph Kernels for Graph ClassificationWei Ye, Hao Tian, Qijun Chen · 2023 · IEEE Transactions on Artificial Intelligence
- Algorithms, Graph Theory, and the Solution of Laplacian Linear EquationsDaniel Alan Spielman · 2012 · Lecture notes in computer science
- Latency Based Dynamic Grouping Aware Cloud SchedulingSheheryar Malik, Fabrice Huet, Denis Caromel · 2012 · International Conference on Advanced Information Networking and Applications Workshops (WAINA)
- A min-cut approach to functional regionalization, with a case study of the Italian local labour market areasGianpiero Bianchi, Renato Bruni, Alessandra Reale, Fabio Sforzi · 2015 · Optimization Letters
- Improved Cheeger's Inequality and Analysis of Local Graph Partitioning using Vertex Expansion and Expansion ProfileTsz Chiu Kwok, Lap Chi Lau, Yin Tat Lee · 2017 · SIAM Journal on Computing
- A Review of Graph-Based Models for Entity-Oriented SearchJosé Luís Devezas, Sérgio Nunes · 2021 · SN Computer Science
- A local updating algorithm for personalized PageRank via Chebyshev polynomialsEsteban Bautista, Matthieu Latapy B · 2022 · Social Network Analysis and Mining
- Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and PerformanceKimon Fountoulakis, Meng Liu, David F. Gleich, Michael W. Mahoney · 2023 · SIAM Review
- Spectral analysis of communication networks using Dirichlet eigenvaluesAlexander Tsiatas, Iraj Saniee, Onuttom Narayan, Matthew Andrews · 2013 · International World Wide Web Conference (WWW)
- Advantage of Overlapping Clusters for Minimizing ConductanceRohit Khandekar, Guy Kortsarz, Vahab Mirrokni · 2012 · Lecture notes in computer science
- Graph clustering based on mixing time of random walksKonstantin E. Avrachenkov, Mahmoud El Chamie, Giovanni Neglia · 2014 · International Conference on Communications
- Ranking and Sparsifying a Connection GraphFan Chung, Wenbo Zhao · 2012 · Lecture notes in computer science
- Perron-Frobenius Theory in Nearly Linear Time: Positive Eigenvectors, M-matrices, Graph Kernels, and Other ApplicationsAmirMahdi Ahmadinejad, Arun Jambulapati, Amin Saberi, Aaron Sidford · 2019 · Society for Industrial and Applied Mathematics eBooks
- Constrained fractional set programs and their application in local clustering and community detectionThomas B hler, Syama Sundar Rangapuram, Simon Setzer, Matthias Hein · 2013 · International Conference on Machine Learning
- Memory-based random walk for multi-query local community detectionYuchen Bian, Dongsheng Luo, Yaowei Yan, Wei Cheng, Wei William Wang, Xiang Zhang · 2019 · Knowledge and Information Systems
- Applying Fairness Constraints on Graph Node Ranks Under Personalization BiasEmmanouil Krasanakis, Symeon Papadopoulos, Ioannis Yiannis Kompatsiaris · 2021 · Studies in computational intelligence
- User-Relatedness and Community Structure in Social Interaction NetworksFolke Mitzlaff, Martin Atzmueller, Benz, Dominik, Andreas Hotho A, Gerd Stumme A · 2013 · arXiv (Cornell University)
- Finding large and small dense subgraphsReid Andersen · 2007 · arXiv (Cornell University)
- Approximating PageRank locally with sublinear query complexity.Marco Bressan, Enoch Peserico, Luca Pretto · 2014 · Padua Research Archive (University of Padova)
- Constrained fractional set programs and their application in local clustering and community detectionSyama Sundar Rangapuram, Simon Setzer, Setzer, Simon, Hein, Matthias · 2013 · arXiv (Cornell University)
- Object-Plane Co-Represented and Graph Propagation-Based Semantic Descriptor for RelocalizationZhiqiang Deng, Yunzhou Zhang, Yanmin Wu, Zhexue Ge, Xinggang Hu, Wenkai Sun · 2022 · IEEE Robotics and Automation Letters
- Illegal Community Detection in Bitcoin Transaction NetworksDany Kamuhanda, Mengtian Cui, Claudio Juan Tessone · 2023 · Entropy
- Spreading rumours without the networkPaweł Brach, Alessandro Epasto, Alessandro Panconesi, Piotr Sankowski · 2014 · Conference on Online Social Networks
- Analyzing the Harmonic Structure in Graph-Based LearningXiao-Ming Wu, Zhenguo Li, Shih-Fu Chang · 2013
- Tracking local communities in streaming graphs with a dynamic algorithmAnita Zakrzewska, David A. Bader · 2016 · Social Network Analysis and Mining
- Finding low-conductance sets with dense interactions (FLCD) for better protein complex predictionYijie Wang, Xiaoning Qian · 2017 · BMC Systems Biology
- Local Algorithm for User Action Prediction Towards Display AdsHongxia Yang, Yada Zhu, Jingrui He · 2017 · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)
- Motif-Preserving Dynamic Local Graph CutDawei Zhou, Jingrui He, Hasan Davulcu, Ross Maciejewski · 2018 · IEEE International Conference on Big Data (BigData)
- Graph Partitioning Using Heuristic Kernighan-Lin Algorithm for Parallel ComputingSiddheshwar Vilas Patil, D.B. Kulkarni · 2020 · Advances in intelligent systems and computing
- Graph Neural Networks in Data MiningYao Ma, Jiliang Tang · 2021 · Cambridge University Press eBooks
- Detecting Communities on Topic of Transportation With Sparse Crowd AnnotationsCao Jianping, Senzhang Wang, Hui Wang · 2016 · IEEE Transactions on Intelligent Transportation Systems
- Improving PageRank for Local Community DetectionAlexandre Hollocou, Thomas Bonald, Marc Lelarge · 2016 · arXiv (Cornell University)
- Mixing Time Power Laws at CriticalityYun Long, Asaf Nachmias, Yuval Peres · 2007 · Annual Symposium on Foundations of Computer Science
- E-rank: A Structural-Based Similarity Measure in Social NetworksMingxi Zhang, Zhenying He, Hao Hu, Wei Wang · 2012 · IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT)
- Accurate and Scalable Graph Neural Networks for Billion-Scale GraphsJuxiang Zeng, Pinghui Wang, Lin Lan, Junzhou Zhao, Feiyang Sun, Jing Tao, Junlan Feng, Min Hu, Xiaohong Guan · 2022 · IEEE International Conference on Data Engineering (ICDE)
- Accelerating Personalized PageRank Vector ComputationZhen Chen, Xingzhi Guo, Baojian Zhou, Deqing Yang, Steven Skiena · 2023 · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)
- Detecting Local Communities within a Large Scale Social Network Using MapreduceHongjun Yin, Jing Li, Yue Niu · 2014 · International Journal of Intelligent Information Technologies
- A trust structure for detection of sybil attacks in opportunistic networksSamaneh Rashidibajgan · 2016 · International Conference for Internet Technology and Secured Transactions
- An Efficient and Balanced Graph Partition Algorithm for the Subgraph-Centric Programming Model on Large-scale Power-law GraphsShuai Zhang, Zite Jiang, Xingzhong Hou, Zhen Guan, Mengting Yuan, Haihang You · 2021 · IEEE International Conference on Distributed Computing Systems (ICDCS)
- Stalk and lie—The cost of Sybil attacks in opportunistic networksSacha Trifunovic, Andreea Picu · 2015 · Computer Communications
- Constructing near spanning trees with few local inspectionsReut Levi, Guy Moshkovitz, Dana Ron, Ronitt Rubinfeld, Asaf Shapira · 2016 · Random Structures and Algorithms
- sonSchema: A Conceptual Schema for Social NetworksZhifeng Bao, Y. C. Tay, Jingbo Zhou · 2013 · Lecture notes in computer science
- On the Advantage of Overlapping Clusters for Minimizing ConductanceRohit Khandekar, Guy Kortsarz, Vahab Mirrokni · 2013 · Algorithmica
- Boosted seed oversampling for local community rankingEmmanouil Krasanakis, Manos Schinas, Symeon Papadopoulos, Ioannis Yiannis Kompatsiaris, Andreas L. Symeonidis · 2019 · Information Processing & Management
- Sublinear Column-wise Actions of the Matrix Exponential on Social NetworksDavid F. Gleich, Kyle Kloster · 2014 · Internet Mathematics
- Finding and Visualizing Graph Clusters Using PageRank OptimizationFan Chung Graham, Alexander Tsiatas · 2010 · Lecture notes in computer science
- Density Sensitive Random Walk for Local Community DetectionYuqi Yi, Luhua Jin, Heng Yu, Haoran Luo, Fan Cheng · 2021 · IEEE Access
- Some Applications of Eigenvalues of GraphsSebastian M. Cioabă · 2010 · Birkhäuser Boston eBooks
- Local Higher-Order Community Detection Based on Fuzzy Membership FunctionsTao Meng, Lijun Cai, Tingqin He, Lei Chen, Ziyun Deng · 2019 · IEEE Access
- Data Exploration Using Example-Based MethodsMatteo Lissandrini, Davide Mottin, Themis Palpanas, Yannis Velegrakis · 2018 · Synthesis lectures on data management
- Hitting times, commute distances and the spectral gap for large random geometric graphsUlrike Von Luxburg A, Agnes Radl, Matthias Hein · 2010 · arXiv (Cornell University)
- Monte Carlo Methods for Top-k Personalized PageRank Lists and Name DisambiguationKonstantin E. Avrachenkov, Nelly Litvak, Danil Nemirovsky, Smirnova, Elena, Marina Sokol · 2010 · arXiv (Cornell University)
- On the Structure and Efficient Computation of IsoRank Node SimilaritiesEhsan Mohamad Kazemi, Matthias Grossglauser · 2016 · arXiv (Cornell University)