Print

Print


*****  To join INSNA, visit http://www.insna.org  *****

*August 20, 2018London, UK (co-located with KDD
2018)https://urldefense.proofpoint.com/v2/url?u=http-3A__www.mlgworkshop.org_2018_&d=DwIFaQ&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=zMabF0rFqf2I0CzmYJjowDLTys6amCxXoxplJA36O8g&s=7R7fkOGlF7gZ81qYcmLHOtoXr5MkWvJe2W2JfsRNcXk&e= <https://urldefense.proofpoint.com/v2/url?u=http-3A__www.mlgworkshop.org_2018_&d=DwIFaQ&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=zMabF0rFqf2I0CzmYJjowDLTys6amCxXoxplJA36O8g&s=7R7fkOGlF7gZ81qYcmLHOtoXr5MkWvJe2W2JfsRNcXk&e=>
Deadlines: (Abstract) May 8, 2018 - (Submission) May 15, 2018Keynotes:Tanya
Berger-Wolf (University of Illinois Chicago)Luna Dong (Amazon)Christos
Faloutsos (Carnegie Mellon University)Kristina Lerman (University of
Southern California - ISI)Sujith Ravi (Google Research)Taha Yasseri
(University of Oxford)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,
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: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 graphsAlgorithms 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 graphsApplications and analysis: -
Analysis of social media- Analysis of biological networks- Knowledge graph
construction- Large-scale analysis and modelingAll 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 conferenceAuthors 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
<https://urldefense.proofpoint.com/v2/url?u=http-3A__www.acm.org_publications_proceedings-2Dtemplate-23aL2&d=DwIFaQ&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=zMabF0rFqf2I0CzmYJjowDLTys6amCxXoxplJA36O8g&s=-QC9Iac_CZofieo6BvMvoguvYrs47tFNvSwNYjcyOkg&e=>. 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 and considered for $1,000 best paper award sponsored by
Kyndi.Timeline:Abstract Deadline: May 8, 2018Submission Deadline: May 15,
2018Notification: June 8, 2018 Final Version: June 28, 2018Workshop: August
20, 2018Submission instructions can be found on
https://urldefense.proofpoint.com/v2/url?u=http-3A__www.mlgworkshop.org_2018_&d=DwIFaQ&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=zMabF0rFqf2I0CzmYJjowDLTys6amCxXoxplJA36O8g&s=7R7fkOGlF7gZ81qYcmLHOtoXr5MkWvJe2W2JfsRNcXk&e= <https://urldefense.proofpoint.com/v2/url?u=http-3A__www.mlgworkshop.org_2018_&d=DwIFaQ&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=zMabF0rFqf2I0CzmYJjowDLTys6amCxXoxplJA36O8g&s=7R7fkOGlF7gZ81qYcmLHOtoXr5MkWvJe2W2JfsRNcXk&e=> Please
send enquiries to [log in to unmask]
<[log in to unmask]>Organizers:Shobeir Fakhraei (University of Southern
California, ISI)Danai Koutra (University of Michigan, Ann Arbor)Julian
McAuley (University of California, San Diego) Bryan Perozzi (Google
Research)Tim Weninger (University of Notre Dame)Program Committee:Aris
Anagnostopoulos (Sapienza University of Rome), Ana Paula Appel (I.B.M.),
Miguel Araujo (Feedzai), Arindam Banerjee (University of Minnesota),
Christian Bauckhage (Fraunhofer IAIS), Ulf Brefeld (Leuphana Universität
Lüneburg), Ivan Brugere (University of Illinois at Chicago), Aaron Clauset
(University of Colorado at Boulder), Alessandro Epasto (Google), Emilio
Ferrara (University of Southern California), Thomas Gärtner (University of
Nottingham), David Gleich (Purdue University), Mohammad Hasan (Indiana
U.–Purdue U. Indianapolis), Jake Hofman (Microsoft Research), Larry Holder
(Washington State University), Bert Huang (Virginia Tech), Kristian
Kersting (TU Darmstadt), Stefano Leucci (ETH Zurich), Fred Morstatter
(University of Southern California), Vagelis Papalexakis (University of
California Riverside), Ali Pinar (Sandia National Laboratories), Aditya
Prakash (Virginia Tech), Arti Ramesh (Binghamton University), Jan Ramon
(INRIA), Xiang Ren (University of Southern California), Neil Shah (Snap
Inc.), Sucheta Soundarajan (Syracuse University), Yizhou Sun (University of
California, Los Angeles), Acar Tamersoy (Symantec Research Labs), Jiliang
Tang (Michigan State University), Hanghang Tong (Arizona State University),
Stefan Wrobel (Fraunhofer IAIS), Xin-Zeng Wu (Information Sciences
Institute), Zhongfei Zhang (Binghamton University), Elena Zheleva
(University of Illinois at Chicago)To receive updates about the current and
future workshops and the Graph Mining community, please join the mailing
list: https://urldefense.proofpoint.com/v2/url?u=https-3A__groups.google.com_d_forum_mlg-2Dlist&d=DwIFaQ&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=zMabF0rFqf2I0CzmYJjowDLTys6amCxXoxplJA36O8g&s=Y1V1C5hbEnk4W7-6VcqI1bei9MaaIrOcyEfVni0sSfg&e=
<https://urldefense.proofpoint.com/v2/url?u=https-3A__groups.google.com_d_forum_mlg-2Dlist&d=DwIFaQ&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=zMabF0rFqf2I0CzmYJjowDLTys6amCxXoxplJA36O8g&s=Y1V1C5hbEnk4W7-6VcqI1bei9MaaIrOcyEfVni0sSfg&e=>   or follow the twitter
account: https://urldefense.proofpoint.com/v2/url?u=https-3A__twitter.com_mlgworkshop&d=DwIFaQ&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=zMabF0rFqf2I0CzmYJjowDLTys6amCxXoxplJA36O8g&s=341BDNhkNzuJIbegFBpKNqvYW9UPVLfMgFUj77nARyA&e= <https://urldefense.proofpoint.com/v2/url?u=https-3A__twitter.com_mlgworkshop&d=DwIFaQ&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=zMabF0rFqf2I0CzmYJjowDLTys6amCxXoxplJA36O8g&s=341BDNhkNzuJIbegFBpKNqvYW9UPVLfMgFUj77nARyA&e=>
Find a PDF copy of this CFP here:
https://urldefense.proofpoint.com/v2/url?u=http-3A__www.mlgworkshop.org_2018_MLG2018-5FCFP.pdf&d=DwIFaQ&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=zMabF0rFqf2I0CzmYJjowDLTys6amCxXoxplJA36O8g&s=E5c_E19AUXFR83Y0I300UZ_roPyy7RgWqd9yQBHUNJg&e=
<https://urldefense.proofpoint.com/v2/url?u=http-3A__www.mlgworkshop.org_2018_MLG2018-5FCFP.pdf&d=DwIFaQ&c=pZJPUDQ3SB9JplYbifm4nt2lEVG5pWx2KikqINpWlZM&r=uXI5O6HThk1ULkPyaT6h2Ws3RKNKSY__GQ4DuS9UHhs&m=zMabF0rFqf2I0CzmYJjowDLTys6amCxXoxplJA36O8g&s=E5c_E19AUXFR83Y0I300UZ_roPyy7RgWqd9yQBHUNJg&e=> We look forward to seeing
you at the workshop!*

_____________________________________________________________________
SOCNET is a service of INSNA, the professional association for social
network researchers (http://www.insna.org). To unsubscribe, send
an email message to [log in to unmask] containing the line
UNSUBSCRIBE SOCNET in the body of the message.