Machine Learning on Graphs (MLoG) Workshop

About

Graphs, which encode pairwise relations between entities, are a kind of universal data structure for a lot of real-world data, including social networks, transportation networks, and chemical molecules. Many important applications on these data can be treated as computational tasks on graphs. Recently, machine learning techniques are widely developed and utilized to effectively tame graphs for discovering actionable patterns and harnessing them for advancing various graph-related computational tasks. Huge success has been achieved and numerous real-world applications have benefited from it. However, since in today’s world we are generating and gathering data in a much faster and diverse way, real-world graphs are becoming increasingly large-scale and complex. More dedicated efforts are needed to propose more advanced machine learning techniques and properly deploy them for real-world applications in a scalable way.

MLoG at WSDM'23 provides a venue to gather the academia researchers and industry researchers/practitioners to present the recent progress of machine learning on graphs.

Topics of Interest

Graphs are a kind of universal data structure for representing pair-wise relationships between entities, which can be ubiquitously observed in different domains ranging from computer science, social science, physics, chemistry, to biology. Many real-world applications can be treated as computational tasks on graphs. For example, friend recommendation in social networks can be regarded as a link prediction task and predicting properties of chemical compounds can be treated as a graph classification task. To facilitate these tasks, machine learning techniques have been widely adopted to perform analysis. As our ability of generating and collecting data constantly increasing in a unprecedented way, the graph-structure data we are facing in the modern era (especially coming from the web) are becoming more and more diverse, complex and large-scale. Hence, more efforts are required for developing more effective algorithms and deploying them efficiently for real-world applications. In this workshop, we aim to discuss the recent research progress of machine learning on graphs in both theoretical foundations and practical applications. We invite submissions that focus on recent advances in research/development of machine learning on graphs along with their applications.

Theory and methodology papers are welcome from any of the following areas, including but not limited to:

Graph Kernels
Graph Summarization
Graph Coarsening
Graph Alignment
Graph Generative Models
Graph Mining
Graph Neural Networks
Network Embedding
Machine Learning for Graph Combinatorial Optimization
Graph Feature Engineering and Selection
Scalable Graph Learning Models and Methods

and application papers focused on but not limited to:

Recommender Systems
Computer Vision
Natural Language Processing
Bioinformatics (e.g., drug discovery)
Cybersecurity (e.g., malware detection/propagation)
Financial security (e.g., fraudster detection)
Transportation/mobility networks (e.g., traffic prediction)
Graph ML Platforms and Systems (e.g., in-database machine learning)

Submission Details

We invite both long research papers (5-10 pages) and short research/application papers (2-4 pages) including references. All submissions must be in PDF format and formatted according to the new ACM format published in ACM guidelines (e.g., using the ACM LaTeX template on Overleaf here) and selecting the "sigconf" sample. Following the WSDM conference submission policy, reviews are double-blind, and author names and affiliations should NOT be listed. Submitted works will be assessed based on their novelty, technical quality, potential impact, and clarity of writing (and should be in English). For papers that primarily rely on empirical evaluations, the experimental settings and results should be clearly presented and repeatable. We encourage authors to make data and code available publicly when possible. Accepted papers will be posted on this workshop website and will not appear in the WSDM proceedings and are thus non-archival (allowing you to submit works to MLoG at WSDM'23 even if they are current under review elsewhere). The best paper (according to the reviewers' ratings and organizing committee) will be announced at the end of the workshop.

All submissions must be uploaded electronically to EasyChair at: Submission Page

At least one of the authors of the accepted workshop papers must register for the workshop and be present on the day of the workshop.

For questions regarding submissions, please contact us at: wsdm2023mlog@easychair.org

Workshop Program

Accepted Papers

Creating Generalizable Downstream Graph Models with Random Projections.
Anton Amirov, Chris Quirk, and Jennifer Neville

Graph-Structured Crawling: Model and Approach.
Mohammadhossein Bateni, Lin Chen, Hossein Esfandiari, and Sasan Tavakkol (authors listed in alphabetical order)

Global Counterfactual Explainer for Graph Neural Networks.
Zexi Huang*, Mert Kosan*, Sourav Medya, Sayan Ranu, and Ambuj Singh (* co-first author)
***Best Paper Award***

Metapath-Based Data-Augmentation for Knowledge Graphs.
Saurav Manchanda

Goodness-of-Fit of Attributed Probabilistic Graph Generative Models.
Pablo Robles-Granda, Katherine Tsai, and Oluwasanmi Koyejo

DEMOMOTIF: Demographic Inference from Sparse Records of Shopping Transactions based on Motif Patterns.
Jiayun Zhang, Xinyang Zhang, Dezhi Hong, Rajesh Gupta, and Jingbo Shang

Smooth Anonymity for Sparse Graphs.
Alessandro Epasto, Hossein Esfandiari, Vahab Mirrokni, Andres Munoz Medina and Sergei Vassilvitskii

Workshop Program. (Local time GMT+8 in Singapore at WSDM'23).

08:30 - 09:15 Keynote - Wenqi Fan of PolyU (virtual)
09:15 - 10:00 Keynote - Yuan Fang of SMU (in-person)

10:00 - 10:30 Coffee break

10:30 - 11:15 Keynote - Feng Xia of RMIT (virtual)
11:15 - 11:30 Contributing Talk - Mert Kosan of UCSB (in-person)
11:30 - 11:45 Contributing Talk - Anton Amirov of Microsoft (in-person)
11:45 - 12:00 Contributing Talk - Hossein Esfandiari of Google (in-person)

12:00 - 13:30 Lunch Break

13:30 - 14:15 Keynote - Vijay Prakash Dwivedi of NTU (virtual)
14:15 - 15:00 Keynote - Bryan Hooi of NUS (in-person)

15:00 - 15:30 Coffee break

15:30 - 16:15 Keynote - Shuo Yu of DUT (virtual)
16:15 - 17:00 Keynote - Xiao Huang of PolyU (in-person)
17:00 Final Remarks & Best Paper Award Announcement