There is a great deal of interest in analyzing data that is best represented as a graph. Examples include the WWW, social networks, biological networks, communication networks, transportation networks, energy grids, and many others. These graphs are typically multi-modal, multi-relational and dynamic. In the era of big data, the importance of being able to effectively mine and learn from such data is growing, as more and more structured and semi-structured data is becoming available. The workshop serves as a forum for researchers from a variety of fields working on mining and learning from graphs to share and discuss their latest findings.
There are many challenges involved in effectively mining and learning from this kind of data, including:
Traditionally, a number of subareas have contributed to this space: communities in graph mining, learning from structured data, statistical relational learning, inductive logic programming, and, moving beyond subdisciplines in computer science, social network analysis, and, more broadly network science.
Due to public health concerns in light of the unfolding COVID-19 outbreak. We will follow exactly the option that ACM SIGKDD and the KDD 2020 organizing committee will suggest and will follow the style that the KDD conference adopts. Please check this website regularly for updates.
This workshop is a forum for exchanging ideas and methods for mining and learning with graphs, developing new common understandings of the problems at hand, sharing of data sets where applicable, and leveraging existing knowledge from different disciplines. The goal is to bring together researchers from academia, industry, and government, to create a forum for discussing recent advances in graph analysis. In doing so, we aim to better understand the overarching principles and the limitations of our current methods and to inspire research on new algorithms and techniques for mining and learning with graphs.
To reflect the broad scope of work on mining and learning with graphs, we encourage submissions that span the spectrum from theoretical analysis to algorithms and implementation, to applications and empirical studies. As an example, the growth of user-generated content on blogs, microblogs, discussion forums, product reviews, etc., has given rise to a host of new opportunities for graph mining in the analysis of social media. We encourage submissions on theory, methods, and applications focusing on a broad range of graph-based approaches in various domains.
Topics of interest include, but are not limited to:
We welcome many kinds of papers, such as, but not limited to:
Authors should clearly indicate in their abstracts the kinds of submissions that the papers belong to, to help reviewers better understand their contributions.
All papers will be peer reviewed, single-blinded. Submissions must be in PDF, no more than 8 pages long — shorter papers are welcome — and formatted according to the standard double-column ACM Proceedings Style.
The accepted papers will be published on the workshop’s website and will not be considered archival for resubmission purposes.
Authors whose papers are accepted to the workshop will have the opportunity to participate in a spotlight and poster session, and some set will also be chosen for oral presentation.
For paper submission, please proceed to the submission website.
This year MLG will be held jointly with the International Workshop on Deep Learning on Graphs (KDD-DLG). DLG will maintain a separate submission website and program committee.
Please send enquiries to email@example.com.
Paper Submission Deadline: June 15, 2020
Author Notification: July 15, 2020
Camera Ready: August 1, 2020
Workshop: August 24, 2020
Research Scientist Manager
University of California San Diego
University of Notre Dame
Siddharth Bhatia (National University of Singapore) Jundong Li (University of Virginia) Shin-Chieng Ngo (Xin-Zeng Wu) (USC-ISI) Stefano Leucci (University of L'Aquila) Jin Kyu Kim (Facebook) Hocine Cherifi (University of Burgundy) Dhivya Eswaran (Amazon) Ting Chen (University of California, Los Angeles) Ivan Brugere (University of Illinois at Chicago) Yuan Fang (Singapore Management University) Blaz Novak (Jozef Stefan Institute) Sucheta Soundarajan (Syracuse University) Fred Morstatter (University of Southern California) Acar Tamersoy (NortonLifeLock Research Group) John Palowitch (Google) Austin Benson (Cornell University)
Hanghang Tong (University of Illinois at Urbana-Champaign) Larry Holder (Washington State University) Aaron Clauset (University of Colorado Boulder) Jan Ramon (INRIA) Christian Bauckhage (Fraunhofer) Bryan Hooi (National University of Singapore) William Hamilton (Stanford University) Aris Anagnostopoulos (Sapienza University of Rome) Ulf Brefeld (Leuphana Universität Lüneburg) Ali Pinar (Sandia National Laboratories) Alessandro Epasto (Google) Danai Koutra (University of Michigan) Evangelos Papalexakis (University of California Riverside) Stefan Wrobel (Fraunhofer IAIS & Univ. of Bonn) Ana Paula Appel (IBM Research Brazil) Marco Bressan (Sapienza University of Rome)
2019, Anchorage, USA (co-located with KDD) 2018, London, United Kingdom (co-located with KDD) 2017, Halifax, Nova Scotia, Canada (co-located with KDD) 2016, San Francisco, USA (co-located with KDD) 2013, Chicago, USA (co-located with KDD) 2012, Edinburgh, Scotland (co-located with ICML) 2011, San Diego, USA (co-located with KDD) 2010, Washington, USA (co-located with KDD) 2009, Leuven, Belgium (co-located with SRL and ILP) 2008, Helsinki, Finland (co-located with ICML) 2007, Firenze, Italy 2006, Berlin, German (co-located with ECML and PKDD) 2005, Porto, Portugal, October 7, 2005 2004, Pisa, Italy, September 24, 2004 2003, Cavtat-Dubrovnik, Croatia