Blair D. Sullivan

Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges

We consider a framework for clustering edge-colored hypergraphs, where the goal is to cluster (equivalently, to *color*) objects based on the primary type of multiway interactions they participate in. One well-studied objective is to color nodes to minimize the number of *unsatisfied* hyperedges---t…