Fast Estimation of Pairwise Biharmonic Distance on Graphs (CCF A).
Chang'an Liu
I am a postdoctoral Research Fellow with the College of Computing and Data Science, Nanyang Technological University, working with Prof. Siqiang Luo. I received my PhD from the College of Computing and Artificial Intelligence, Fudan University, where I was fortunately supervised by Prof. Zhongzhi Zhang. Before that, I received my Bachelor's degree from the School of Software, Dalian University of Technology, advised by Prof. Feng Xia. My current research interests lie in graph data mining, graph algorithm learning, and graph foundation model.
Github G. Scholar
Internship opportunities are available, and I'm always open to collaboration. Feel free to contact me: changan.liu@ntu.edu.sg
What’s New
Efficient Algorithms for Random Walk Centrality (CCF A).
Promoting Fairness in Information Access Within Social Networks (CCF A).
Efficient Edge Rewiring Strategies for Enhancing PageRank Fairness (CCF B).
Professional Services
- Reviewer, International Conference on Machine Learning (ICML)
- Program member, The Web Conference (WWW)
- Reviewer, ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)
- Reviewer, IEEE Transactions on Information Theory (TIT)
- Reviewer, IEEE Transactions on Neural Networks and Learning Systems (TNNLS)
- Reviewer, IEEE Transactions on Knowledge and Data Engineering (TKDE)
- Reviewer, Data & Knowledge Engineering (DKE)