计算机科学与技术学院系列报告

讲座名称：计算机科学与技术学院系列报告

讲座时间：6月24日15:00

讲座地点：北校区主楼II区319

主办单位：计算机科学与技术学院

报告1：Subgraph Matching: Past and Present

讲座人介绍：

林学民，澳大利亚新南威尔士大学杰出教授，是该校数据库与知识研究组负责人，IEEE Fellow。它的研究兴趣包括数据库、数据挖掘、算法设计等，特别是在大规模复杂非结构化数据（如图、时空、流、文本及不确定数据）的可扩展处理与挖掘上。

讲座内容：

Graph data are key parts of Big Data and widely used for modelling complex structured data with a broad spectrum of applications. Over the last decade, tremendous research efforts have been devoted to many fundamental problems in managing and analysing graph data. In this talk, I will focus on a fundamental problem, subgraph matching. I will cover solutions for single computer, as well as distributed solutions.

报告2：An Introduction of Model-based Text Clustering

讲座人介绍：

尹建华博士目前是山东大学计算机科学与技术学院副教授。他2012年在西电获得学士学位，2017年于清华大学获得博士学位。他曾访问UIUC。它的主要研究方向包括文本聚类和贝叶斯推断。

讲座内容：

Text clustering is an important technology in data mining and machine learning. It is widely used in event discovery and tracking, document summarization, search results clustering, and other issues. Although there are many researches on text clustering, there are still many challenging problems to be solved: (1) How to set the number of clusters? Is it possible to automatically discover the number of clusters from the data? (2) How to deal with the sparsity of short text? (3) How to automatically discover abnormal documents in a dataset? (4) How to deal with the concept drift problem of stream text clustering? In this report, Dr. Jianhua Yin will share his work on text clustering and the stories behind these papers when he was a PhD student at Tsinghua University, hoping to inspire the younger students who are interested in scientific research.