Algorithms and Applications of Edge-Colored Hypergraph Clustering

Explore algorithms and applications of edge-colored hypergraph clustering in this seminar presentation that addresses the challenge of classifying individuals based on their categorical multiway interactions. Learn about the formal framework of Edge-Colored Clustering (ECC) in hypergraphs, which provides solutions for problems such as determining academic researchers' fields based on their collaborative publications with specific categorical labels. Discover several algorithmic results with approximation guarantees for different problem variants, examine practical applications including categorizing food ingredients based on recipe types, and understand the connection between ECC and frameworks for classifying labeled nodes in temporal bipartite graphs. The presentation covers combinatorial algorithms and discrete optimization techniques for network analysis and data science, delivered by an expert in computational discrete algorithms who has received recognition for contributions to the field.