No article text was recorded for this version.
seed-based local clustering
Version 2 of 2274 papers401 conceptsfrozen 2026-10-04
Papers in this version
- Blog: A Short Introduction to Local Graph Clustering Methods and Software
- Blog: Corrections to "Flow-Based Clustering on Directed Graphs: A Structural Entropy Minimization Approach"
- Blog: Overlapping Community Detection via Local Spectral Clustering
- Blog: Constant-Time Approximation Algorithms for the Optimum Branching Problem on Sparse Graphs
- Blog: Fast Algorithms for Intimate-Core Group Search in Weighted Graphs
- Blog: Heat kernel based community detection
- Blog: A Simple and Strongly-Local Flow-Based Method for Cut Improvement
- Blog: Heat kernel based community detection
- Blog: Densest Subhypergraph: Negative Supermodular Functions and Strongly Localized Methods
- Blog: Uncovering the Local Hidden Community Structure in Social Networks
- Blog: A Distributed Hybrid Community Detection Methodology for Social Networks
- Blog: Flow-Based Clustering on Directed Graphs: A Structural Entropy Minimization Approach
- Blog: Flow-based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance
- Blog: A Simple and Strongly-Local Flow-Based Method for Cut Improvement
- Blog: p-Norm Flow Diffusion for Local Graph Clustering
- Blog: Severability of mesoscale components and local time scales in dynamical networks
- Blog: Local Algorithms for Finding Densely Connected Clusters
- Blog: Strongly Local Hypergraph Diffusions for Clustering and Semi-supervised Learning
- Blog: An optimization approach to locally-biased graph algorithms
- Blog: Capacity Releasing Diffusion for Speed and Locality
- Blog: Local Algorithms for Estimating Effective Resistance
- Blog: Finding Endogenously Formed Communities
- Blog: Structural entropy minimization combining graph representation for money laundering identification
- Blog: HellRank: a Hellinger-based centrality measure for bipartite social networks
- Blog: A Compressed Sensing Based Least Squares Approach to Semi-supervised Local Cluster Extraction
- Blog: A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning
- Blog: Minimizing Localized Ratio Cut Objectives in Hypergraphs
- Blog: Strongly local p-norm-cut algorithms for semi-supervised learning and local graph clustering
- Blog: Local Hyper-Flow Diffusion
- Blog: Finding Endogenously Formed Communities
- Blog: Flow-Based Algorithms for Local Graph Clustering
- Blog: Uncovering the Small Community Structure in Large Networks: A Local Spectral Approach
- Blog: Flow-Based Local Graph Clustering with Better Seed Set Inclusion
- Blog: Localized Flow-Based Clustering in Hypergraphs
- Blog: Local Hyper-flow Diffusion
- Blog: Local Core Members Aided Community Structure Detection
- Blog: Multiscale Matrix Sampling and Sublinear-Time PageRank Computation
- Blog: Efficient and Local Parallel Random Walks
- Blog: Hide and Seek: Outwitting Community Detection Algorithms
- Blog: Community Detection Using Time-Dependent Personalized PageRank
- Blog: Incorporating User's Preference into Attributed Graph Clustering
- Blog: Local Clustering in Contextual Multi-Armed Bandits
- Blog: Computer Science in the Information Age
- Blog: Provably Extending PageRank-based Local Clustering Algorithm to Weighted Directed Graphs with Self-Loops and to Hypergraphs
- Blog: Efficient and Local Parallel Random Walks
- Blog: A scalable distributed dynamical systems approach to compute the strongly connected components and diameter of networks
- Blog: A Local Algorithm for Product Return Prediction in E-Commerce
- Blog: In a World that Counts: Clustering and Detecting Fake Social Engagement at Scale
- Blog: In a World That Counts: Clustering and Detecting Fake Social Engagement at Scale
- Blog: HiTSEE KNIME: a visualization tool for hit selection and analysis in high-throughput screening experiments for the KNIME platform
- Blog: Krylov Subspace Approximation for Local Community Detection in Large Networks
- Blog: Size-bounded Community Search over Large Bipartite Graphs
- Blog: Detecting and Characterizing Small Dense Bipartite-like Subgraphs by the Bipartiteness Ratio Measure
- Blog: Searching for a Single Community in a Graph
- Blog: Local Computation Algorithms for Spanners
- Blog: Defining and evaluating network communities based on ground-truth
- Blog: Fast Online Node Labeling for Very Large Graphs
- Blog: Effective and Efficient Conductance-based Community Search at Billion Scale
- Blog: Variational perspective on local graph clustering
- Blog: A Local Algorithm for Constructing Spanners in Minor-Free Graphs
Showing 60 of 274 papers.
History & citation
Current · Permanent link
- Local Spectral Methods for Community Detection merged into this direction (79% overlap)
- Community Detection as Sparse Signal Recovery merged into this direction (60% overlap)
- L1-Regularized Local Graph Clustering merged into this direction (73% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_seed_based_local_clustering_ad416622,
title = {seed-based local clustering},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/seed-based-local-clustering/rdr_ad416622674d47069156f0114ea92b6e},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 2, frozen text):
@misc{lacuna_seed_based_local_clustering_ad416622_v2,
title = {seed-based local clustering},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/seed-based-local-clustering/rdr_ad416622674d47069156f0114ea92b6e/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-20},
}