4 papers
Online Sparsification of Bipartite-Like Clusters in Graphs
Joyentanuj Das, Suranjan De, He Sun
Graph clustering is an important algorithmic technique for analysing massive graphs, and has been widely applied in many research fields of data science. While the objective of mos…
Dynamic Similarity Graph Construction with Kernel Density Estimation
Steinar Laenen, Peter Macgregor, He Sun
In the kernel density estimation (KDE) problem, we are given a set of data points in , a kernel function $k: \mathbb{R}^d \times \mathbb{R}^d \rightarrow \mathbb{…
Dynamic Spectral Clustering with Provable Approximation Guarantee
Steinar Laenen, He Sun
This paper studies clustering algorithms for dynamically evolving graphs , in which new edges (and potential new vertices) are added into a graph, and the underlying clust…
Three Hardness Results for Graph Similarity Problems
He Sun, Danny Vagnozzi
Notions of graph similarity provide alternative perspective on the graph isomorphism problem and vice-versa. In this paper, we consider measures of similarity arising from mismatch…