Keynote Speakers
Professor Ingo Scholtes
Ingo Scholtes is a Full Professor for Machine Learning in Complex Networks at the Center for Artificial Intelligence and Data Science of Julius-Maximilians-Universität Würzburg, Germany as well as SNSF Professor for Data Analytics at the Department of Computer Science at the University of Zürich, Switzerland. He has a background in computer science and mathematics and obtained his doctorate degree from the University of Trier, Germany. At CERN, he developed a large-scale data distribution system, which is currently used to monitor particle collision data from the ATLAS detector. After finishing his doctorate degree, he was a postdoctoral researcher at the interdisciplinary Chair of Systems Design at ETH Zürich from 2011 till 2016. In 2016 he held an interim professorship for Applied Computer Science at the Karlsruhe Institute of Technology, Germany. In 2017 he returned to ETH Zürich as a senior assistant and lecturer. In 2019 he was appointed Full Professor at the University of Wuppertal. Since 2021 he holds the CAIDAS-Chair of Computer Science - Machine Learning for Complex Networks at Julius-Maximilians-Universität Würzburg, Germany.
Talk Title
Higher-Order Models of Causal Topologies in Temporal Networks - From Modelling to Deep Learning
Abstract
Graph Neural Networks (GNNs) have become a cornerstone for the application of deep learning to data on complex networks. However, we increasingly have access to time-resolved data that not only capture which nodes are connected to each other, but also when and in which temporal order those connections occur. A number of works have shown how the timing and ordering of links shapes the causal topology of networked systems, i.e. which nodes can influence each other over time. Moreover, higher-order models have been developed that allow us to model patterns in the resulting causal topology. While those works have shed light on the question how the time dimension of temporal graphs influences node centralities, community structures, or diffusion processes, we lack methods to incorporate those insights into state-of-the-art graph learning techniques.
Addressing this gap, we introduce De Bruijn Graph Neural Networks (DBGNNs), a time-aware graph neural network architecture for temporal network data. Our approach accounts for temporal-topological patterns that unfold via causal walks, i.e. temporally ordered sequences of links by which nodes can influence each other over time. We develop a graph neural network architecture that utilizes De Bruijn graphs of multiple orders to implement a message passing scheme that follows a non-Markovian dynamics, which enables us to learn patterns in the causal topology of dynamic graphs.
Professor Kijung Shin
Kijung Shin is an Associate Professor (jointly affiliated) at the Kim Jaechul Graduate School of AI and the School of Electrical Engineering at KAIST, South Korea. He received his Ph.D. from the Computer Science Department at Carnegie Mellon University (USA) in 2019. He has published more than 70 referred articles in major data mining, database, and machine learning venues. He won the best research paper award at KDD 2016 and the best student paper runner-up award at ICDM 2023. He also delivered tutorials on hypergraph-structured data mining at KDD 2023, WWW 2023, ICDM 2022, and CIKM 2022.
His research interests span a wide range of topics related to data mining and machine learning for (hyper)graph-structured data, with a focus on scalable algorithm design and empirical patterns in the real world.
More information about Kijung can be found on his homepage https://kijungs.github.io.
Talk Title
Mining of Real-world Hypergraphs: Patterns, Tools, and Generators
Abstract
Group interactions are prevalent in various complex systems (e.g., collaborations of researchers and group discussions on online Q&A sites), and they are commonly modeled as hypergraphs. Hyperedges, which compose a hypergraph, are non-empty subsets of any number of nodes, and thus, each hyperedge naturally represents a group interaction among entities. The higher-order nature of hypergraphs brings about unique structural properties that have not been considered in ordinary pairwise graphs.
In this talk, I'll offer a comprehensive overview of a new research topic called hypergraph mining. First, I'll present recently revealed structural properties of real-world hypergraphs, including (a) static and dynamic patterns, (b) global and local patterns, and (c) connectivity and overlapping patterns. Together with the patterns, I'll introduce advanced data mining tools used for their discovery. Lastly, I'll describe simple yet realistic hypergraph generative models that provide an explanation of the structural properties.