[Adapt] FW: Visiting SHJT on March 8

Kenny Zhu kzhu at cs.sjtu.edu.cn
Wed Mar 8 14:56:57 CST 2017

If you are interested, there’s  a talk in Room 200 now by Reynold from HKU.




From: Reynold Cheng [mailto:ckcheng at cs.hku.hk] 
Sent: Wednesday, March 08, 2017 2:55 PM
To: Yanyan Shen
Cc: Yanmin Zhu; kzhu at cs.sjtu.edu.cn; yaobin
Subject: Re: Visiting SHJT on March 8


We are now having the talk in Room 200.


On 8 Mar 2017, at 2:52 PM, Yanyan Shen <shen-yy at cs.sjtu.edu.cn> wrote:


Yes. Where is your talk?


发件人: Reynold Cheng [mailto:ckcheng at cs.hku.hk] 
发送时间: Wednesday, March 8, 2017 2:49 PM
收件人: Yanmin Zhu <yzhu at cs.sjtu.edu.cn>; kzhu at cs.sjtu.edu.cn; Yanyan Shen <shen-yy at cs.sjtu.edu.cn>
抄送: yaobin <yaobin at cs.sjtu.edu.cn>
主题: Re: Visiting SHJT on March 8


Dear all, 


We are almost done finishing the area overview in your department.  Are you around at 3-4pm so that we can have some discussions?





On 1 Mar 2017, at 8:38 AM, Yanmin Zhu < <mailto:yzhu at cs.sjtu.edu.cn> yzhu at cs.sjtu.edu.cn> wrote:


Dear Reynold,


I am happy to learn that you are visiting us and giving a talk. 


I will ask my students to join your talk. 


Look forward to meeting you soon.










From: Reynold CK Cheng [ <mailto:ckcheng at cs.hku.hk> mailto:ckcheng at cs.hku.hk] 
Sent: Tuesday, February 28, 2017 5:23 PM
To:  <mailto:kzhu at cs.sjtu.edu.cn> kzhu at cs.sjtu.edu.cn;  <mailto:yzhu at cs.sjtu.edu.cn> yzhu at cs.sjtu.edu.cn;  <mailto:shen-yy at cs.sjtu.edu.cn> shen-yy at cs.sjtu.edu.cn
Cc: yaobin < <mailto:yaobin at cs.sjtu.edu.cn> yaobin at cs.sjtu.edu.cn>; ckcheng < <mailto:ckcheng at cs.hku.hk> ckcheng at cs.hku.hk>
Subject: Re: Visiting SHJT on March 8


Dear Prof. Kenny Zhu, Prof. Yanmin Zhu, and Dr. Shen, 


Greetings! This is Reynold Cheng of HKU Computer Science. I am an associate professor specialized in database, data mining, crowdsourcing, and knowledge bases.


I am coordinating with Prof. Ma Lizhuang to organize a visit to your department!  


We plan to give an afternoon seminar to your department on March 8 (next Wed), talking about the department and research area overview. I will then give a technical talk which I will discuss my recent work.


I have visited Prof. Bin Yao before, and Bin told me to contact you. If you will be around on March 8, it would be great if you and your students can come to our talk and give me your valuable comments.  Of course, we could also find some time to have further discussions.  For your interest, here are talk details.  Look forward to seeing you in SHJT! 


Best Regards,

Associate Professor
MPhil/PhD Programme Director
Department of Computer Science
The University of Hong Kong
email:  <mailto:ckcheng at cs.hku.hk> ckcheng at cs.hku.hk
 <http://www.cs.hku.hk/~ckcheng> http://www.cs.hku.hk/~ckcheng

Title: Meta Paths and Meta Structures: Computing Relevance in Large Heterogeneous Information Networks 


A heterogeneous information network (HIN) is a graph model in which objects and edges are annotated with types. Large and complex databases, such as YAGO and DBLP, can be modeled as HINs. A fundamental problem in HINs is the computation of closeness, or relevance, between two HIN objects. Relevance measures can be used in various applications, including information retrieval, entity resolution, and product recommendation. We study the problem of discovering meta paths, a recently proposed concept used for relevance computation in HINs. A meta path is essentially a sequence of node classes and edge types between two nodes in a HIN. Current methods assume that meta paths are found by domain experts. However, in a large and complex HIN, retrieving meta paths manually can be tedious and difficult. We examine how to find meta paths automatically. Specifically, users are asked to provide example pairs of nodes that exhibit high proximity. We then investigate how to generate meta paths that can best explain the relationship between these node pairs. Since this problem is computationally intractable, we propose a greedy algorithm to select the most relevant meta paths. We also present a data structure to enable efficient execution of this algorithm. We incorporate hierarchical relationships among node classes in our solutions. Extensive experiments on YAGO and DBLP show that our approach captures important meta paths in an efficient and scalable manner.

We further generalize the notion of meta path to ``meta structure’’, which is a directed acyclic graph of object types with edge types connecting in between. The meta structure, which is more expressive than the meta path, can describe complex relationship between two HIN objects (e.g., two papers in DBLP share the same authors and topics). We develop three relevance measures based on meta structure. Due to the computational complexity of these measures, we design an algorithm with data structures proposed to support their evaluation. Our extensive experiments show that meta structure relevance is more effective than meta paths.

Personal brief introduction 

Dr. Reynold Cheng is an Associate Professor of the Department of Computer Science in the University of Hong Kong. He was an Assistant Professor in HKU in 2008-11. He received his BEng ( Computer Engineering ) in 1998, and MPhil ( Computer Science and Information Systems ) in 2000, from the Department of Computer Science in the University of Hong Kong. He then obtained his MSc and PhD from Department of Computer Science of Purdue University in 2003 and 2005 respectively. Dr. Cheng was an Assistant Professor in the Department of Computing of the Hong Kong Polytechnic University during 2005-08. He was a visiting scientist in the Institute of Parallel and Distributed Systems in the University of Stuttgart during the summer of 2006. 

Dr. Cheng was granted an Outstanding Young Researcher Award 2011-12 by HKU. He was the recipient of the 2010 Research Output Prize in the Department of Computer Science of HKU. He also received the U21 Fellowship in 2011. He received the Performance Reward in years 2006 and 2007 awarded by the Hong Kong Polytechnic University. He is the Chair of the Department Research Postgraduate Committee, and was the Vice Chairperson of the ACM ( Hong Kong Chapter ) in 2013. He is a member of the IEEE, the ACM, the Special Interest Group on Management of Data ( ACM SIGMOD ), and the UPE (Upsilon Pi Epsilon Honor Society). He is an editorial board member of TKDE, DAPD and IS, and was a guest editor for TKDE, DAPD, and Geoinformatica. He is an area chair of ICDE 2017, a senior PC member for DASFAA 2015, PC co-chair of APWeb 2015, area chair for CIKM 2014, area chair for Encyclopedia of Database Systems, program co-chair of SSTD 2013, and a workshop co-chair of ICDE 2014. He received an Outstanding Service Award in the CIKM 2009 conference. He has served as PC members and reviewer for top conferences (e.g., SIGMOD, VLDB, ICDE, EDBT, KDD, ICDM, and CIKM) and journals (e.g., TODS, TKDE, VLDBJ, IS, and TMC).






On Feb 23, 2017, at 3:18 PM, yaobin < <mailto:yaobin at cs.sjtu.edu.cn> yaobin at cs.sjtu.edu.cn> wrote:


Please check with these three:

 <http://www.cs.sjtu.edu.cn/~yzhu/> http://www.cs.sjtu.edu.cn/~yzhu/

 <http://www.cs.sjtu.edu.cn/PeopleDetail.aspx?id=340> http://www.cs.sjtu.edu.cn/PeopleDetail.aspx?id=340

 <http://www.cs.sjtu.edu.cn/~kzhu/> http://www.cs.sjtu.edu.cn/~kzhu/

在 2017年2月23日,下午3:19,Reynold CK Cheng < <mailto:ckcheng at cs.hku.hk> ckcheng at cs.hku.hk> 写道:


Dear Bin,


Just want to ask for a favor: can you also give me the contact of your colleague who is also working in our area?  Then I can get in touch with him/her before the talk, and see whether we can establish some collaboration.


Best Regards,

Associate Professor
MPhil/PhD Programme Director
Department of Computer Science
The University of Hong Kong
email:  <mailto:ckcheng at cs.hku.hk> ckcheng at cs.hku.hk
 <http://www.cs.hku.hk/~ckcheng> http://www.cs.hku.hk/~ckcheng


-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://cs.sjtu.edu.cn/pipermail/adapt/attachments/20170308/3a5832b0/attachment-0001.html>

More information about the Adapt mailing list