[esip-semantictech] FW: [EXTERNAL] [SIG-IRList] [CFP] ACM KDD MLG'19 -- 15th International Workshop on Mining and Learning with Graphs
Mcgibbney, Lewis J (398M)
lewis.j.mcgibbney at jpl.nasa.gov
Tue Apr 23 15:42:26 EDT 2019
Dr. Lewis John McGibbney Ph.D., B.Sc.(Hons)
Data Scientist III
Computer Science for Data Intensive Applications Group (398M)
Instrument Software and Science Data Systems Section (398)
Jet Propulsion Laboratory
California Institute of Technology
4800 Oak Grove Drive
Pasadena, California 91109-8099
Mail Stop : 158-256C
Tel: (+1) (818)-393-7402
Cell: (+1) (626)-487-3476
Fax: (+1) (818)-393-1190
Email: lewis.j.mcgibbney at jpl.nasa.gov<mailto:lewis.j.mcgibbney at jpl.nasa.gov>
ORCID: orcid.org/0000-0003-2185-928X
[signature_1198815115]
Dare Mighty Things
From: ACM SIGIR Mailing List <SIGIR at LISTSERV.ACM.ORG> on behalf of Shobeir Fakhraei <shobeir at GMAIL.COM>
Reply-To: Shobeir Fakhraei <shobeir at GMAIL.COM>
Date: Monday, April 22, 2019 at 11:13 PM
To: "SIGIR at LISTSERV.ACM.ORG" <SIGIR at LISTSERV.ACM.ORG>
Subject: [EXTERNAL] [SIG-IRList] [CFP] ACM KDD MLG'19 -- 15th International Workshop on Mining and Learning with Graphs
15th International Workshop on Mining and Learning with Graphs (MLG 2019)[https://lh6.googleusercontent.com/F2XNhznd7U9l1bZk-752N-IyVDhPk2b_UjvxwR_beCyMa0y4shleuQ7Zn3bvlIgbtobNdXS1v2wupAklxsS9T-oxJakWJMj0rCmnbx-8_F-an88C7ycHjAx3V4-UPsQqH6OkORQg]
August 6, 2019
Anchorage, Alaska, USA (co-located with KDD 2019)
http://www.mlgworkshop.org/2019/
Deadlines: (Abstract) May 5, 2019 - (Submission) May 15, 2019
Call for papers:
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 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, 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:
Theoretical aspects:
·
·
· Computational or statistical learning theory related to graphs
·
·
·
· Theoretical analysis of graph algorithms or models
·
·
·
· Sampling and evaluation issues in graph algorithms
·
·
·
· Analysis of dynamic graphs
·
Algorithms and methods:
·
·
· Graph mining
·
·
·
· Probabilistic and graphical models for structured data
·
·
·
· Heterogeneous/multi-model graph analysis
·
·
·
· Network embedding models
·
·
·
· Statistical models of graph structure
·
·
·
· Combinatorial graph methods
·
·
·
· Semi-supervised learning, active learning, transductive inference, and transfer learning in the
· context of graphs
·
Applications and analysis:
·
·
· Analysis of social media
·
·
·
· Analysis of biological networks
·
·
·
· Knowledge graph construction
·
·
·
· Large-scale analysis and modeling
·
All papers will be peer reviewed, single-blinded. We welcome many kinds of papers, such as, but not limited to:
·
·
· Novel research papers
·
·
·
· Demo papers
·
·
·
· Work-in-progress papers
·
·
·
· Visionary papers (white papers)
·
·
·
· Appraisal papers of existing methods and tools (e.g., lessons learned)
·
·
·
· Relevant work that has been previously published
·
·
·
· Work that will be presented at the main conference
·
Authors should clearly indicate in their abstracts the kinds of submissions that the papers belong to, to help reviewers better understand their contributions. 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<http://www.acm.org/publications/proceedings-template#aL2>. 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.
Timeline:
Paper Abstract Deadline: May 5, 2019
Paper Submission Deadline: May 12, 2019
Author Notification: June 1, 2019
Camera Ready: June 22, 2019
Submission instructions can be found on http://www.mlgworkshop.org/2019/
Please send enquiries to chair at mlgworkshop.org<mailto:chair at mlgworkshop.org>
Organizers:
Shobeir Fakhraei (University of Southern California, ISI)
Aude Hofleitner (Facebook)
Danai Koutra (University of Michigan, Ann Arbor)
Julian McAuley (University of California, San Diego)
Bryan Perozzi (Google Research)
Tim Weninger (University of Notre Dame)
To receive updates about the current and future workshops and the Graph Mining community, please join the mailing list: https://groups.google.com/d/forum/mlg-list
or follow the twitter account: https://twitter.com/mlgworkshop
We look forward to seeing you at the workshop!
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.esipfed.org/pipermail/esip-semanticweb/attachments/20190423/d61e29be/attachment-0001.htm>
-------------- next part --------------
A non-text attachment was scrubbed...
Name: image001.png
Type: image/png
Size: 3432 bytes
Desc: image001.png
URL: <http://lists.esipfed.org/pipermail/esip-semanticweb/attachments/20190423/d61e29be/attachment-0001.png>
More information about the esip-semanticweb
mailing list