News
News
Schedule
|
Workshop Schedule at a Glance |
|
|
August 12, 2012 Sunday |
|
|
08:30-9:30 |
Opening ceremony |
|
Keynote Speech: Influence propagation in large graphs - theorems and algorithms |
|
|
9:30-10:10 |
Session 1: Mining Social Semantics 1
|
|
10:10-10:30 |
Coffee break |
|
10:30-11:15 |
Invited Talk: Meta-Path-Based Search and Mining in Heterogeneous Information Networks |
|
11:15-12:20 |
Session 2: Mining Social Semantics 2
|
|
12:20-13:30 |
Lunch |
|
13:30-14:15 |
Invited Talk: What's Special about Mobile Recommender Systems |
|
14:15-15:10 |
Session 3: Mining Data Semantics 1
|
|
15:10-15:30 |
Coffee Break |
|
15:30-16:15 |
Invited Talk: Tractable models of heterogeneous networks |
|
16:15-17:30 |
Session 4: Mining Data Semantics 2
|
Invited Speaker
**News** Christos Faloutsos accepted to give the keynote speech!
**News** Jure Leskovec accepted to give an invited talk!
**News** Hui Xiong accepted to give an invited talk!
**News** Yizhou Sun accepted to give an invited talk!
**News** The best papers will be invited to submit their extensions to a top journal (SCI, impact factor>2).
Objectives
Objectives
This workshop aims to motivate researchers and practitioners from multidisciplinary fields to study the problem of mining semantics in heterogeneous information networks. The recent efforts on converting and generating semantic data provide large knowledge base for us to analyze and practice now. The pressing needs coming from life science for integrating and mining data provide an excellent opportunity to showcase the values of semantic technologies for mining information networks. Recognizing the research challenges, it is important for KDD, one of the most influential venues for data mining research, to play a leading role and address that. Unlike the other workshops which focus primarily on the algorithmic aspects, the intent of this workshop is to continue the research effort on semantic data mining, and to encourage the academia and industrial researchers to share their study and experience on semantic data mining algorithms, theory and applications. The objective of the workshop is to the better collaboration, idea exchange, and information sharing, a thorough analysis and mining on mining the data semantics. The anticipated outcome includes a fruitful discussion about the emerging challenges in this field, inspiration of the novel theories for mining semantic graph data, and motivating the interesting applications. The broader anticipated outcome includes: fostering future research directions, publishing high quality papers, attracting new researchers to this field, and concrete solutions to the existing problems.
The workshop will provide a forum for researchers from all over the world to share information on their latest investigations in SM and its application particularly in academic research area and industrial sectors. The broader context of the workshop can be related in some respects to the areas of Web Mining, Social Networks Analysis, Semantic Web, Information Retrieval, and Natural Language Processing. In addition to paper presentations and depending on time limitations, we will solicit an invited talk or a panel that will stress the interdisciplinary challenges of Semantic Graph Mining. Topics of interest include but are not limited to:
- Metadata integration;
- Classification and prediction in heterogeneous networks;
- Clustering and ranking methods for heterogeneous networks;
- Pattern-analysis methods;
- Link mining and link prediction;
- Semantic search over heterogeneous networks;
- Mining with user interactions;
- Semantic mining with light-weight reasoning;
- Extending LOD and Quality of LOD disambiguation, identity, provenance, integration;
- Personalized mining in hetereogeneous networks;
- Domain specific mining (e.g., Life Science and Health Care);
- Multi-scale visualization;
- Collective intelligence mining.
Keynotes & Dates
Confirmed Keynote/Invited Speakers
- Christos Faloutsos, Carnegie Mellon University
Title: Influence propagation in large graphs - theorems and algorithms
Abstract: Given the specifics of a virus (or product, or hashtag), how quickly will it propagate on a contact network? Will it create an epidemic, or will it quickly die out? The way a virus/product/meme propagates on a graph is important, because it can help us design immunization policies (if we want to stop it) or marketing policies (if we want it to succeed). We present some surprising results on the so-called 'epidemic threshold', we discuss the effects of time-varying contact networks, and we present fast algorithms to achieve near-optimal immunization.
Bio: Christos Faloutsos is a Professor at Carnegie Mellon University. He has received the Presidential Young Investigator Award by the National Science Foundation (1989), the Research Contributions Award in ICDM 2006, the SIGKDD Innovations Award (2010), eighteen ``best paper'' awards, (including two ``test of time'') and four teaching awards. He has served as a member of the executive committee of SIGKDD; he has published over 200 refereed articles, 11 book chapters and one monograph. He holds five patents and he has given over 30 tutorials and over 10 invited distinguished lectures. His research interests include data mining for graphs and streams, fractals, database performance, and indexing for multimedia and bio-informatics data.
- Yizhou Sun, Univ. of Illinois, Urbana-Champaign
Title: Meta-Path-Based Search and Mining in Heterogeneous Information Networks
Abstract: Real-world physical and abstract data objects are interconnected, forming gigantic, interconnected networks. By structuring these data objects and interactions between these objects into multiple types, such networks become semi-structured heterogeneous information networks. Most real-world applications that handle big data, including interconnected social media and social networks, scientific, engineering, or medical information systems, online e-commerce systems, and most database systems, can be structured into heterogeneous information networks.
Bio: Yizhou Sun received her Ph.D. in Computer Science, University of Illinois at Urbana-Champaign, in 2012. She will be an assistant professor in the College of Computer and Information Science, Northeastern University. Her principal research interest is in mining information and social networks, and more generally in data mining, database systems, statistics, machine learning, information retrieval, and network science, with a focus on modeling novel problems and proposing scalable algorithms for large-scale, real-world applications. Yizhou has over 30 publications in book chapters, journals, and major conferences. Tutorials based on her thesis work on mining heterogeneous information networks have been given in several premier conferences, including EDBT 2009, SIGMOD 2010, KDD 2010, ICDE 2012, VLDB 2012 and ASONAM 2012.
- Jure Leskovec, Stanford University
Title: Tractable models of heterogeneous networks
Abstract: Networks are a powerful way to describe and represent social, technological and biological systems, where nodes represent entities (people, web sites, genes) and edges represent interactions (friendships, communication, regulation). The study of such networks then seeks to find common structural patterns and explain their emergence through tractable models of network formation.
Bio: Dr. Jure Leskovec is an assistant professor of Computer Science at Stanford University. My research focuses on mining and modeling large social and information networks, their evolution, and diffusion of information and influence over them. Problems I investigate are motivated by large scale data, the Web and on-line media.
- Hui Xiong, Management Science and Information Systems Department Rutgers, the State University of New Jersey
Title: What's Special about Mobile Recommender Systems
Abstract: Recommender systems aim to identify content of interest from overloaded information by exploiting the opinions of a community of users. Developing personalized recommender systems in mobile and pervasive environments is more challenging than developing recommender systems from traditional domains due to the complexity of spatial data, the unclear roles of context-aware information, and the increasing availability of environment-sensing capabilities. In this talk, we introduce the unique features that distinguish pervasive personalized recommendation systems from classic recommendation systems. An examination of major research needs in pervasive personalized recommendation research reveals some new opportunities for personalized recommendation in mobile and pervasive applications.
Bio: Dr. Hui Xiong is currently an Associate Professor and the Vice Chair of the Management Science and Information Systems Department at the Rutgers, the State University of New Jersey, where he received a two-year early promotion/tenure (2009), the Rutgers University Board of Trustees Research Fellowship for Scholarly Excellence (2009), the ICDM-2011 Best Research Paper Award (2011), the Junior Faculty Teaching Excellence Award (2007) and the Junior Faculty Research Award (2008) at Rutgers Business School. Dr. Xiong received his Ph.D. in Computer Science from the University of Minnesota (UMN), USA, in 2005, the B.E. degree in Automation from the University of Science and Technology of China (USTC), Hefei, China, and the M.S. degree in Computer Science from the National University of Singapore (NUS), Singapore. His general area of research is data and knowledge engineering, with a focus on developing effective and efficient data analysis techniques for emerging data intensive applications. He has published prolifically in refereed journals and conference proceedings (3 books, 40+ journal papers, and 60+ conference papers). He is the co-Editor-in-Chief of Encyclopedia of GIS (Springer, 2007) and an Associate Editor of the Knowledge and Information Systems journal. He has served regularly on the organization and program committees of numerous conferences, including as a Program Co-Chair of the Industrial and Government Track for the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD). He is a senior member of the ACM and the IEEE.
Important Dates
- Submission deadline: May 22nd, 2012
- Notification of acceptance: June 7th, 2012
- Final papers due: June 15th, 2012
All papers submitted should have a maximum length of 8 pages and must be prepared using the ACM camera-ready templatehttp://www.acm.org/sigs/pubs/proceed/template.html. Authors are required to submit their papers electronically in PDF format. The submission website is http://www.easychair.org/conferences/?conf=mds2012.
All submissions should clearly present the author information including the names of the authors, the affiliations and the emails. The best papers will be invited to submit their extensions to a top journal (indexed by SCI, impact factor>2).
Organizers
Organizers
- Ying Ding, Indiana University
- Jiawei Han, University of Illinois at Urbana-Champaign
- Jie Tang, Tsinghua University
- Philip Yu, University of Chicago