Graph clustering is a fundamental task in network analysis where the goa...
A recent trend in data mining has explored (hyper)graph clustering algor...
Learning a smooth graph signal from partially observed data is a well-st...
We present and discuss seven different open problems in applied
combinat...
Hypergraph clustering is a basic algorithmic primitive for analyzing com...
This paper presents a fast and simple new 2-approximation algorithm for
...
We study the approximability of a recently introduced framework for
clus...
Correlation clustering is a framework for partitioning datasets based on...
Minimizing a sum of simple submodular functions of limited support is a
...
Finding dense subgraphs of a large graph is a standard problem in graph
...
Homophily is the seemingly ubiquitous tendency for people to connect wit...
Hypergraphs are a natural modeling paradigm for a wide range of complex
...
In recent years, hypergraph generalizations of many graph cut problems h...
The ability for machine learning to exacerbate bias has led to many
algo...
Graph clustering objective functions with tunable resolution parameters ...
Local graph clustering algorithms are designed to efficiently detect sma...
The minimum s-t cut problem in graphs is one of the most fundamental
pro...
Graphs and networks are a standard model for describing data or systems ...
Resolution parameters in graph clustering represent a size and quality
t...
Finding clusters of well-connected nodes in a graph is an extensively st...
Many clustering applications in machine learning and data mining rely on...
Flow-based methods for local graph clustering have received significant
...
We present new results for LambdaCC and MotifCC, two recently introduced...
We outline a new approach for solving optimization problems which enforc...
We present and analyze a new framework for graph clustering based on a
s...