On Clustering on Graphs with Multiple Edge Types
Matthew Rocklin, Ali Pinar

TL;DR
This paper explores clustering on multi-edge graphs, addressing challenges like metric weight variability, clustering space complexity, and recovering true clusterings, with applications to academic papers and geopolitical data.
Contribution
It generalizes clustering concepts to multi-edge graphs, proposing solutions for weight robustness, clustering space description, and weight recovery, supported by case studies.
Findings
Clustering remains effective despite changes in metric weights.
Efficient description of clustering space is achievable.
Methods can recover ground-truth metric weights.
Abstract
We study clustering on graphs with multiple edge types. Our main motivation is that similarities between objects can be measured in many different metrics. For instance similarity between two papers can be based on common authors, where they are published, keyword similarity, citations, etc. As such, graphs with multiple edges is a more accurate model to describe similarities between objects. Each edge/metric provides only partial information about the data; recovering full information requires aggregation of all the similarity metrics. Clustering becomes much more challenging in this context, since in addition to the difficulties of the traditional clustering problem, we have to deal with a space of clusterings. We generalize the concept of clustering in single-edge graphs to multi-edged graphs and investigate problems such as: Can we find a clustering that remains good, even if we…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
