Schedule

The workshop will be held on August 25th, 2025. in the Drummond Room at Wyndham Grand Fallsview, Niagara Falls, Canada.

Schedule

Here is the schedule for the workshop:

Time	Event	Speaker(s)
10:30–10:35	Opening Remarks	Andrea Failla
10:35–11:15	Keynote: Modularity Based Community Detection in Hypergraphs	Pawel Pralat
11:15–11:35	Detecting Patterns of Interaction in Temporal Hypergraphs via Edge Clustering	Ryan DeWolfe, François Théberge
11:35–11:55	Beyond Pairwise Links: Hypergraph Modeling for Scientific Trend Forecasting	Nithyasree Kusakula, Navyamsh Gangavaram, Liz Torres, Russell Funk, Mehmet Aktas
11:55–12:15	Evaluation of Genetic Algorithm and Decision Tree Optimisations for Anomaly Detection	Ali Gharaee, Hossein Gharaee Garakani
12:15–12:30	Closing & Discussion	Andrea Failla

Keynote Talk

Pawel Pralat

Modularity Based Community Detection in Hypergraphs

Abstract: In this talk, we present a scalable community detection algorithm using hypergraph modularity function, h–Louvain. It is an adaptation of the classical Louvain algorithm in the context of hypergraphs. We observe that a direct application of the Louvain algorithm to optimize the hypergraph modularity function often fails to find meaningful communities. We propose a solution to this issue by adjusting the initial stage of the algorithm via carefully and dynamically tuned linear combination of the graph modularity function of the corresponding two-section graph and the desired hypergraph modularity function. The process is guided by Bayesian optimization of the hyper-parameters of the proposed procedure. Various experiments on synthetic as well as real-world networks are performed showing that this process yields improved results in various regimes.