Dongsheng Luo

Assistant Professor, Knight Foundation School of Computing and Information Sciences, Florida International University


Lecture Information:
  • September 16, 2022
  • 2:00 PM
  • CASE 241

Speaker Bio

Dongsheng Luo obtained his Ph.D. degree at the College of Information Science and Technology, Pennsylvania State University, supervised by Prof. Xiang Zhang and his B.Eng degree in computer science and technology from Beihang University in 2017, supervised by Prof. Shuai Ma. His research lies primarily in data mining and machine learning, with a special focus on graph mining, such as graph neural networks, clustering algorithms in complex networks. He interned at Baidu Research and NEC lab America. His research work is recognized by multiple prestigious awards, including the Award for Research Excellence at the College of IST and the best paper award Candidate in ICDM 2018.

Abstract

Graphs are prevalent in various domains to describe complex relationships among entities and have been used widely in many real-world applications, such as social networks, author collaboration networks, and brain networks. Inspired by the great achievements of deep learning on i.i.d data, Graph Neural Networks (GNNs) generalize the deep learning model to process graph-structured data and have shown to be powerful tools for graph analytics.

Despite the success of deep graph learning, there are still several challenges unsolved when handling noise and heterogeneous graph data generated in real-life applications. First, existing GNNs are sensitive to the quality of the input graph. Real-world graphs are often noisy with task-irrelevant connections, leading to suboptimal generalization performance in the learned GNN models. Second, a key issue for data science is handling data collected from multiple information sources that may involve many different types of information interrelated in a complex way. Generalizing graph learning that is designed for single and homogenous data to multiple and heterogeneous information networks is another challenge for complex graph analytics.

In this talk, I will focus on these two critical issues in graph learning systems and present mitigating solutions. I will first introduce a general framework to denoise graphs by learning to drop edges, which can be plugged into various GNN models to improve their robustness, followed by an application of the learning to drop strategy in the GNN explanation. I will then discuss graph learning on multiple networks and present an integrative learning method for multiple network clustering.

Click here for the live recording.