A scalable pattern mining approach to web graph compression with communities
WSDM '08 Proceedings of the 2008 International Conference on Web Search and Data Mining
A local algorithm for finding dense subgraphs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A recommender system based on local random walks and spectral methods
Proceedings of the 9th WebKDD and 1st SNA-KDD 2007 workshop on Web mining and social network analysis
Statistical properties of community structure in large social and information networks
Proceedings of the 17th international conference on World Wide Web
Estimating PageRank on graph streams
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Communities in Large Networks: Identification and Ranking
Algorithms and Models for the Web-Graph
Simrank++: query rewriting through link analysis of the click graph
Proceedings of the VLDB Endowment
A Local Graph Partitioning Algorithm Using Heat Kernel Pagerank
WAW '09 Proceedings of the 6th International Workshop on Algorithms and Models for the Web-Graph
A Recommender System Based on Local Random Walks and Spectral Methods
Advances in Web Mining and Web Usage Analysis
Finding sparse cuts locally using evolving sets
Proceedings of the forty-first annual ACM symposium on Theory of computing
Networks, communities and kronecker products
Proceedings of the 1st ACM international workshop on Complex networks meet information & knowledge management
Accuracy estimate and optimization techniques for SimRank computation
The VLDB Journal — The International Journal on Very Large Data Bases
Detecting sharp drops in PageRank and a simplified local partitioning algorithm
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Empirical comparison of algorithms for network community detection
Proceedings of the 19th international conference on World wide web
Determining factors behind the PageRank log-log plot
WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
Local computation of PageRank contributions
WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
Local partitioning for directed graphs using PageRank
WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
A local algorithm for finding dense subgraphs
ACM Transactions on Algorithms (TALG)
Fast nearest-neighbor search in disk-resident graphs
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
The community-search problem and how to plan a successful cocktail party
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Scalable discovery of best clusters on large graphs
Proceedings of the VLDB Endowment
Estimating PageRank on graph streams
Journal of the ACM (JACM)
Algorithms to detect multiprotein modularity conserved during evolution
ISBRA'11 Proceedings of the 7th international conference on Bioinformatics research and applications
Quick detection of top-k personalized pagerank lists
WAW'11 Proceedings of the 8th international conference on Algorithms and models for the web graph
Spectral Sparsification of Graphs
SIAM Journal on Computing
Overlapping clusters for distributed computation
Proceedings of the fifth ACM international conference on Web search and data mining
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The laplacian paradigm: emerging algorithms for massive graphs
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Community detection in Social Media
Data Mining and Knowledge Discovery
Approximate computation and implicit regularization for very large-scale data analysis
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Advantage of overlapping clusters for minimizing conductance
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Computer Science Review
High-confidence near-duplicate image detection
Proceedings of the 2nd ACM International Conference on Multimedia Retrieval
Efficient personalized pagerank with accuracy assurance
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Vertex neighborhoods, low conductance cuts, and good seeds for local community methods
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Streaming graph partitioning for large distributed graphs
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
SIAM Journal on Scientific Computing
The small community phenomenon in networks: models, algorithms and applications
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Defining and evaluating network communities based on ground-truth
Proceedings of the ACM SIGKDD Workshop on Mining Data Semantics
Algorithms, graph theory, and the solution of laplacian linear equations
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
A sublinear time algorithm for pagerank computations
WAW'12 Proceedings of the 9th international conference on Algorithms and Models for the Web Graph
Ranking and sparsifying a connection graph
WAW'12 Proceedings of the 9th international conference on Algorithms and Models for the Web Graph
Crowdsourced comprehension: predicting prerequisite structure in Wikipedia
Proceedings of the Seventh Workshop on Building Educational Applications Using NLP
Towards hierarchical clustering
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
The power of local information in social networks
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
E-rank: A Structural-Based Similarity Measure in Social Networks
WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 01
Spectral analysis of communication networks using Dirichlet eigenvalues
Proceedings of the 22nd international conference on World Wide Web
Spectral sparsification of graphs: theory and algorithms
Communications of the ACM
Graph-based Sybil detection in social and information systems
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
The Journal of Machine Learning Research
Accurate and scalable nearest neighbors in large networks based on effective importance
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Overlapping community detection using seed set expansion
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Hierarchical community decomposition via oblivious routing techniques
Proceedings of the first ACM conference on Online social networks
A seed-centric community detection algorithm based on an expanding ring search
AWC '13 Proceedings of the First Australasian Web Conference - Volume 144
Incremental and accuracy-aware personalized pagerank through scheduled approximation
Proceedings of the VLDB Endowment
On the embeddability of random walk distances
Proceedings of the VLDB Endowment
A spectral approach to detecting subtle anomalies in graphs
Journal of Intelligent Information Systems
Latency based group discovery algorithm for network aware cloud scheduling
Future Generation Computer Systems
Hi-index | 0.02 |
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than the size of the input graph. In this paper, we present a local partitioning algorithm using a variation of PageRank with a specified starting distribution. We derive a mixing result for PageRank vectors similar to that for random walks, and show that the ordering of the vertices produced by a PageRank vector reveals a cut with small conductance. In particular, we show that for any set C with conductance \Phiand volume k, a PageRank vector with a certain starting distribution can be used to produce a set with conductance O\left( {\sqrt {\Phi \log k} } \right). We present an improved algorithm for computing approximate PageRank vectors, which allows us to find such a set in time proportional to its size. In particular, we can find a cut with conductance at most \not o , whose small side has volume at least 2b, in time O\left( {2^b \log ^2 m/\not o^2 } \right) where m is the number of edges in the graph. By combining small sets found by this local partitioning algorithm, we obtain a cut with conductance \not o and approximately optimal balance in time O\left( {m\log ^4 m/\not o^2 } \right).