Clustering on the Edge: Learning Structure in Graphs
arXiv:1605.01779
Abstract
With the recent popularity of graphical clustering methods, there has been an increased focus on the information between samples. We show how learning cluster structure using edge features naturally and simultaneously determines the most likely number of clusters and addresses data scale issues. These results are particularly useful in instances where (a) there are a large number of clusters and (b) we have some labeled edges. Applications in this domain include image segmentation, community discovery and entity resolution. Our model is an extension of the planted partition model and our solution uses results of correlation clustering, which achieves a partition O(log(n))-close to the log-likelihood of the true clustering.
References in corpus (9)
- Cooperative Game Theory Approaches for Network Partitioning
- Stochastic blockmodels and community structure in networks
- An efficient and principled method for detecting communities in networks
- A Bayesian Approach to Network Modularity
- Stochastic blockmodels with growing number of classes
- Uncovering latent structure in valued graphs: A variational approach
- Structural Inference of Hierarchies in Networks
- Model Selection for Degree-corrected Block Models
- Valued Ties Tell Fewer Lies: Why Not To Dichotomize Network Edges With Thresholds