<div dir="ltr"><div><span id="gmail-docs-internal-guid-a314da03-5fc5-89fa-dc6f-6747b182766b"><font face="arial, helvetica, sans-serif"><div style="text-align:left"><img src="cid:ii_15e5fc7e7f98b85c" alt="Inline image 1" width="283" height="88" style="background-color: transparent; color: rgb(28, 69, 135); font-weight: 700; white-space: pre-wrap; margin-right: 0px;"></div></font></span></div><font face="arial, helvetica, sans-serif"><span style="background-color:transparent;color:rgb(28,69,135);font-weight:700;white-space:pre-wrap">HeteroNAM 2018: International Workshop on Heterogeneous Networks Analysis and Mining</span><br><span style="background-color:transparent;color:rgb(28,69,135);white-space:pre-wrap">Feb 9, 2018</span><br><span style="background-color:transparent;color:rgb(28,69,135);white-space:pre-wrap">Los Angeles, California, USA, 2018 (co-located with WSDM’18)</span><br><a href="http://www.heteronam.org/2018" style="text-decoration-line:none"><span style="color:rgb(28,69,135);background-color:transparent;text-decoration-line:underline;vertical-align:baseline;white-space:pre-wrap">http://www.heteronam.org/2018</span></a><span style="background-color:transparent;color:rgb(28,69,135);vertical-align:baseline;white-space:pre-wrap"> </span><br></font><div><span><p dir="ltr" style="text-align:left;line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="color:rgb(255,0,0);background-color:transparent;font-weight:700;vertical-align:baseline;white-space:pre-wrap"><font face="arial, helvetica, sans-serif">Submission Deadline: Nov 20, 2017</font></span></p></span></div><div><span><font face="arial, helvetica, sans-serif"><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><br></p><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="color:rgb(0,0,0);background-color:transparent;font-weight:700;vertical-align:baseline;white-space:pre-wrap">Call for papers:</span></p><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt;text-align:justify"><span style="color:rgb(0,0,0);background-color:transparent;vertical-align:baseline;white-space:pre-wrap">This workshop is a forum for exchanging ideas and methods for heterogeneous networks analysis and mining, 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 this area. 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 heterogeneous networks analysis and mining.</span></p><br><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt;text-align:justify"><span style="color:rgb(0,0,0);background-color:transparent;vertical-align:baseline;white-space:pre-wrap">To reflect the broad scope of work on heterogeneous networks analysis and mining, we encourage submissions that span the spectrum from theoretical analysis to algorithms and implementation, to applications and empirical studies is various domains. The need for analysis and learning methods that go beyond mining simple graphs is emerging in many disciplines and are referred to with different names depending on the type of data augmenting the simple graph. </span></p><br><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt;text-align:justify"><span style="color:rgb(0,0,0);background-color:transparent;vertical-align:baseline;white-space:pre-wrap">General topics of interest include, but are not limited to:</span></p><br><ul style="margin-top:0pt;margin-bottom:0pt"><li dir="ltr" style="list-style-type:disc;color:rgb(0,0,0);background-color:transparent;vertical-align:baseline"><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt;text-align:justify"><span style="background-color:transparent;vertical-align:baseline;white-space:pre-wrap">Heterogeneous Information Networks</span></p></li><li dir="ltr" style="list-style-type:disc;color:rgb(0,0,0);background-color:transparent;vertical-align:baseline"><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt;text-align:justify"><span style="background-color:transparent;vertical-align:baseline;white-space:pre-wrap">Multi-Relational Networks</span></p></li><li dir="ltr" style="list-style-type:disc;color:rgb(0,0,0);background-color:transparent;vertical-align:baseline"><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt;text-align:justify"><span style="background-color:transparent;vertical-align:baseline;white-space:pre-wrap">Signed Networks</span></p></li><li dir="ltr" style="list-style-type:disc;color:rgb(0,0,0);background-color:transparent;vertical-align:baseline"><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt;text-align:justify"><span style="background-color:transparent;vertical-align:baseline;white-space:pre-wrap">Attributed Networks</span></p></li><li dir="ltr" style="list-style-type:disc;color:rgb(0,0,0);background-color:transparent;vertical-align:baseline"><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt;text-align:justify"><span style="background-color:transparent;vertical-align:baseline;white-space:pre-wrap">Aligned Networks</span></p></li><li dir="ltr" style="list-style-type:disc;color:rgb(0,0,0);background-color:transparent;vertical-align:baseline"><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt;text-align:justify"><span style="background-color:transparent;vertical-align:baseline;white-space:pre-wrap">Multigraphs</span></p></li><li dir="ltr" style="list-style-type:disc;color:rgb(0,0,0);background-color:transparent;vertical-align:baseline"><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt;text-align:justify"><span style="background-color:transparent;vertical-align:baseline;white-space:pre-wrap">Multidimensional Networks</span></p></li><li dir="ltr" style="list-style-type:disc;color:rgb(0,0,0);background-color:transparent;vertical-align:baseline"><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt;text-align:justify"><span style="background-color:transparent;vertical-align:baseline;white-space:pre-wrap">Multilayer Networks</span></p></li><li dir="ltr" style="list-style-type:disc;color:rgb(0,0,0);background-color:transparent;vertical-align:baseline"><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt;text-align:justify"><span style="background-color:transparent;vertical-align:baseline;white-space:pre-wrap">Complex Networks</span></p></li><li dir="ltr" style="list-style-type:disc;color:rgb(0,0,0);background-color:transparent;vertical-align:baseline"><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt;text-align:justify"><span style="background-color:transparent;vertical-align:baseline;white-space:pre-wrap">Multimodal Networks</span></p></li></ul><br><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt;text-align:justify"><span style="color:rgb(0,0,0);background-color:transparent;vertical-align:baseline;white-space:pre-wrap">Heterogenous networks are becoming the key component in many emerging applications and data-mining and graph-mining related tasks. Some of the related research areas and tasks related to heterogeneous networks include:</span></p><br><ul style="margin-top:0pt;margin-bottom:0pt"><li dir="ltr" style="list-style-type:disc;color:rgb(0,0,0);background-color:transparent;vertical-align:baseline"><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt;text-align:justify"><span style="background-color:transparent;vertical-align:baseline;white-space:pre-wrap">Link and relationship strength prediction</span></p></li><li dir="ltr" style="list-style-type:disc;color:rgb(0,0,0);background-color:transparent;vertical-align:baseline"><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt;text-align:justify"><span style="background-color:transparent;vertical-align:baseline;white-space:pre-wrap">Clustering and community detection and formation modeling</span></p></li><li dir="ltr" style="list-style-type:disc;color:rgb(0,0,0);background-color:transparent;vertical-align:baseline"><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt;text-align:justify"><span style="background-color:transparent;vertical-align:baseline;white-space:pre-wrap">Learning to rank in information networks</span></p></li><li dir="ltr" style="list-style-type:disc;color:rgb(0,0,0);background-color:transparent;vertical-align:baseline"><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt;text-align:justify"><span style="background-color:transparent;vertical-align:baseline;white-space:pre-wrap">Similarity measures and relationship extraction</span></p></li><li dir="ltr" style="list-style-type:disc;color:rgb(0,0,0);background-color:transparent;vertical-align:baseline"><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt;text-align:justify"><span style="background-color:transparent;vertical-align:baseline;white-space:pre-wrap">Applications to modeling of weblogs, social media, social networks, medical networks, and the semantic web</span></p></li><li dir="ltr" style="list-style-type:disc;color:rgb(0,0,0);background-color:transparent;vertical-align:baseline"><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt;text-align:justify"><span style="background-color:transparent;vertical-align:baseline;white-space:pre-wrap">Statistical relational learning</span></p></li><li dir="ltr" style="list-style-type:disc;color:rgb(0,0,0);background-color:transparent;vertical-align:baseline"><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt;text-align:justify"><span style="background-color:transparent;vertical-align:baseline;white-space:pre-wrap">Tensor factorization </span></p></li><li dir="ltr" style="list-style-type:disc;color:rgb(0,0,0);background-color:transparent;vertical-align:baseline"><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt;text-align:justify"><span style="background-color:transparent;vertical-align:baseline;white-space:pre-wrap">Network-based classification </span></p></li><li dir="ltr" style="list-style-type:disc;color:rgb(0,0,0);background-color:transparent;vertical-align:baseline"><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt;text-align:justify"><span style="background-color:transparent;vertical-align:baseline;white-space:pre-wrap">Hybrid recommender systems </span></p></li><li dir="ltr" style="list-style-type:disc;color:rgb(0,0,0);background-color:transparent;vertical-align:baseline"><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt;text-align:justify"><span style="background-color:transparent;vertical-align:baseline;white-space:pre-wrap">Information fusion </span></p></li><li dir="ltr" style="list-style-type:disc;color:rgb(0,0,0);background-color:transparent;vertical-align:baseline"><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt;text-align:justify"><span style="background-color:transparent;vertical-align:baseline;white-space:pre-wrap">Network evolution and dynamic networks</span></p></li></ul><br><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt;text-align:justify"><span style="color:rgb(0,0,0);background-color:transparent;vertical-align:baseline;white-space:pre-wrap">All papers will be peer reviewed, single-blinded. We welcome many kinds of papers, such as, but not limited to:</span></p><br><ul style="margin-top:0pt;margin-bottom:0pt"><li dir="ltr" style="list-style-type:disc;color:rgb(0,0,0);background-color:transparent;vertical-align:baseline"><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt;text-align:justify"><span style="background-color:transparent;vertical-align:baseline;white-space:pre-wrap">Novel research papers</span></p></li><li dir="ltr" style="list-style-type:disc;color:rgb(0,0,0);background-color:transparent;vertical-align:baseline"><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt;text-align:justify"><span style="background-color:transparent;vertical-align:baseline;white-space:pre-wrap">Demo papers</span></p></li><li dir="ltr" style="list-style-type:disc;color:rgb(0,0,0);background-color:transparent;vertical-align:baseline"><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt;text-align:justify"><span style="background-color:transparent;vertical-align:baseline;white-space:pre-wrap">Work-in-progress papers</span></p></li><li dir="ltr" style="list-style-type:disc;color:rgb(0,0,0);background-color:transparent;vertical-align:baseline"><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt;text-align:justify"><span style="background-color:transparent;vertical-align:baseline;white-space:pre-wrap">Visionary papers (white papers)</span></p></li><li dir="ltr" style="list-style-type:disc;color:rgb(0,0,0);background-color:transparent;vertical-align:baseline"><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt;text-align:justify"><span style="background-color:transparent;vertical-align:baseline;white-space:pre-wrap">Appraisal papers of existing methods and tools (e.g., lessons learned)</span></p></li><li dir="ltr" style="list-style-type:disc;color:rgb(0,0,0);background-color:transparent;vertical-align:baseline"><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt;text-align:justify"><span style="background-color:transparent;vertical-align:baseline;white-space:pre-wrap">Relevant work that has been previously published</span></p></li><li dir="ltr" style="list-style-type:disc;color:rgb(0,0,0);background-color:transparent;vertical-align:baseline"><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt;text-align:justify"><span style="background-color:transparent;vertical-align:baseline;white-space:pre-wrap">Work that will be presented at the main conference of WSDM</span></p></li></ul><br><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt;text-align:justify"><span style="color:rgb(0,0,0);background-color:transparent;vertical-align:baseline;white-space:pre-wrap">Authors should clearly indicate in their abstracts the kinds of submissions that the papers belong to, to help reviewers better understand their contributions. </span></p><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt;text-align:justify"><span style="color:rgb(0,0,0);background-color:transparent;vertical-align:baseline;white-space:pre-wrap">Submissions must be in PDF,</span><span style="color:rgb(0,0,0);background-color:transparent;font-weight:700;vertical-align:baseline;white-space:pre-wrap"> no more than 8 pages long</span><span style="color:rgb(0,0,0);background-color:transparent;vertical-align:baseline;white-space:pre-wrap"> — shorter papers are welcome — and formatted according to the standard double-column </span><a href="http://www.acm.org/publications/proceedings-template#aL2" style="text-decoration-line:none"><span style="background-color:transparent;text-decoration-line:underline;vertical-align:baseline;white-space:pre-wrap">ACM Proceedings Style</span></a><span style="color:rgb(0,0,0);background-color:transparent;vertical-align:baseline;white-space:pre-wrap">.</span></p><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt;text-align:justify"><span style="color:rgb(0,0,0);background-color:transparent;vertical-align:baseline;white-space:pre-wrap">The accepted papers will be published on the workshop’s website and will not be considered archival for resubmission purposes.</span></p><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt;text-align:justify"><span style="color:rgb(0,0,0);background-color:transparent;vertical-align:baseline;white-space:pre-wrap">Authors whose papers are accepted to the workshop will have the opportunity to participate in a spotlight and poster session, and some set may also be chosen for oral presentation. </span></p><br><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="color:rgb(0,0,0);background-color:transparent;font-weight:700;vertical-align:baseline;white-space:pre-wrap">Timeline:</span></p><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="color:rgb(0,0,0);background-color:transparent;vertical-align:baseline;white-space:pre-wrap">Paper Submission Deadline: Nov 20, 2017 </span></p><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="color:rgb(0,0,0);background-color:transparent;vertical-align:baseline;white-space:pre-wrap">Author Notification: Dec 14, 2017</span></p><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="color:rgb(0,0,0);background-color:transparent;vertical-align:baseline;white-space:pre-wrap">Final Version: Jan 1, 2018</span></p><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="color:rgb(0,0,0);background-color:transparent;vertical-align:baseline;white-space:pre-wrap">Workshop: Feb 9, 2018</span></p><br><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="color:rgb(0,0,0);background-color:transparent;font-weight:700;vertical-align:baseline;white-space:pre-wrap">Submission Instructions:</span></p><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><a href="http://www.heteronam.org/2018" style="text-decoration-line:none"><span style="background-color:transparent;text-decoration-line:underline;vertical-align:baseline;white-space:pre-wrap">http://www.heteronam.org/2018</span></a><span style="color:rgb(0,0,0);background-color:transparent;vertical-align:baseline;white-space:pre-wrap"> </span></p><br><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="color:rgb(0,0,0);background-color:transparent;vertical-align:baseline;white-space:pre-wrap">Please send enquiries to </span><b><a href="mailto:chair@heteronam.org" style="text-decoration-line:none"><span style="background-color:transparent;text-decoration-line:underline;vertical-align:baseline;white-space:pre-wrap">chair@heteronam.org</span></a><span style="color:rgb(0,0,0);background-color:transparent;vertical-align:baseline;white-space:pre-wrap"> </span></b></p><br><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="color:rgb(0,0,0);background-color:transparent;vertical-align:baseline;white-space:pre-wrap">We look forward to your participation!</span></p><br><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="color:rgb(0,0,0);background-color:transparent;font-weight:700;vertical-align:baseline;white-space:pre-wrap">Organizers:</span></p><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="color:rgb(0,0,0);background-color:transparent;vertical-align:baseline;white-space:pre-wrap">Shobeir Fakhraei (USC Information Sciences Institute)</span></p><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="color:rgb(0,0,0);background-color:transparent;vertical-align:baseline;white-space:pre-wrap">Yanen Li (Snap Inc.)</span></p><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="color:rgb(0,0,0);background-color:transparent;vertical-align:baseline;white-space:pre-wrap">Yizhou Sun (University of California Los angeles)</span></p><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="color:rgb(0,0,0);background-color:transparent;vertical-align:baseline;white-space:pre-wrap">Tim Weninger (University of Notre Dame)</span></p><br><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt;text-align:justify"><span style="color:rgb(0,0,0);background-color:transparent;vertical-align:baseline;white-space:pre-wrap">To receive updates about the current and future workshops and the Graph Mining community, please join the mailing list: </span><a href="https://groups.google.com/d/forum/mlg-list" style="text-decoration-line:none"><span style="background-color:transparent;text-decoration-line:underline;vertical-align:baseline;white-space:pre-wrap">https://groups.google.com/d/forum/mlg-list</span></a><span style="color:rgb(0,0,0);background-color:transparent;vertical-align:baseline;white-space:pre-wrap">   </span></p><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt;text-align:justify"><span style="color:rgb(0,0,0);background-color:transparent;vertical-align:baseline;white-space:pre-wrap">or follow the twitter account: </span><a href="https://twitter.com/heteronam" style="text-decoration-line:none"><span style="background-color:transparent;text-decoration-line:underline;vertical-align:baseline;white-space:pre-wrap">https://twitter.com/heteronam</span></a><span style="color:rgb(0,0,0);background-color:transparent;vertical-align:baseline;white-space:pre-wrap"> </span></p><div><span><font face="arial, helvetica, sans-serif"><br></font></span></div><div><span><font face="arial, helvetica, sans-serif">Please find a printable version of the CFP here: <a href="http://www.heteronam.org/2018/HeteroNAM18_CFP1.pdf">http://www.heteronam.org/2018/HeteroNAM18_CFP1.pdf</a><br></font></span></div><br><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="color:rgb(0,0,0);background-color:transparent;vertical-align:baseline;white-space:pre-wrap">Best Regards, </span></p><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="color:rgb(0,0,0);background-color:transparent;vertical-align:baseline;white-space:pre-wrap">-- HeteroNAM Organizers </span></p><p dir="ltr" style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><b><a href="mailto:chair@heteronam.org" style="text-decoration-line:none"><span style="background-color:transparent;text-decoration-line:underline;vertical-align:baseline;white-space:pre-wrap">chair@heteronam.org</span></a><span style="color:rgb(0,0,0);background-color:transparent;vertical-align:baseline;white-space:pre-wrap"> </span></b></p><br></font></span></div><div><br></div></div>