TL;DR
This paper introduces a hypergraph clustering method to form diverse and experienced groups by balancing past experience and skill diversity, with applications in review platform curation.
Contribution
It models diversity and experience as hypergraph edge types, proposes a regularized clustering objective, and provides an efficient approximation algorithm for the NP-hard problem.
Findings
Developed a hypergraph clustering model balancing experience and diversity.
Designed a 2-approximation algorithm for the NP-hard problem.
Applied the framework to online review platforms for curated review sets.
Abstract
When forming a team or group of individuals, we often seek a balance of expertise in a particular task while at the same time maintaining diversity of skills within each group. Here, we view the problem of finding diverse and experienced groups as clustering in hypergraphs with multiple edge types. The input data is a hypergraph with multiple hyperedge types -- representing information about past experiences of groups of individuals -- and the output is groups of nodes. In contrast to related problems on fair or balanced clustering, we model diversity in terms of variety of past experience (instead of, e.g., protected attributes), with a goal of forming groups that have both experience and diversity with respect to participation in edge types. In other words, both diversity and experience are measured from the types of the hyperedges. Our clustering model is based on a regularized…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
