ENGLISH 中财主站 加入收藏
当前位置: 首 页 > 学术科研 > 学术活动 > 正文

讲座预告:宾夕法尼亚州立大学Zhang Xiang副教授访问我校并举行讲座

发布时间:2016-12-02来源: 浏览次数:

题目:Scalable, Robust and Integrative Algorithms for Analyzing Big Network Data

主办单位:加拿大28开奖官网预测结果

讲座地点:学院南路校区,主教309

讲座时间:2016年12月2日(星期五)下午15:00-17:00  

主讲人:Zhang Xiang ,  Associate Professor, College Information Sciences and Technology, The Pennsylvania State University

讲座主要内容:Networks (or graphs) provide a natural data model for numerous applications ranging from social, web, scientific data to biological and medical data. The real-world networks are usually very large, noisy and collected in different domains. Motivated by these properties of the data, in this talk, I will focus on three important algorithmic issues in analyzing large network data, i.e., scalability, robustness and integrativeness. I will use query and clustering, which are of fundamental importance to many advanced tasks, as examples to illustrate how we address these issues. In particular, I will introduce a local search algorithm for proximity query, a node weighting method for local clustering, and the network of networks model for integrating multiple networks.

Bio: Dr. Xiang Zhang is an Associate Professor in the College of Information Sciences and Technology at the Pennsylvania State University. His research interests include data mining, big data analysis, machine learning, network analysis, bioinformatics, and databases. His publications have been recognized by several prestigious awards including the Best Research Paper Award at SIGKDD’08, the Best Student Paper Award at ICDE’08, and best paper nominations at SDM’12 and ICDM'15. His doctoral dissertation received an honorable mention for 2012 ACM SIGKDD Dissertation Award. He received the NSF CAREER Award in 2016.

PS: Dr. Zhang is recruiting highly motivated and qualified PhD students who are interested in big data analytics, data mining and machine learning. Please email Dr. Zhang at xzhang@ist.pst.edu your resume and transcripts if interested.

       欢迎全校感兴趣的教师和学生参加!