Let us hear what he has to say about his defense and an abstract of his thesis.
Knowledge graphs (KGs) find rich applications in knowledge management and discovery, recommendation systems, fraud detection, chatbots, etc. KGs are directed relational graphs. They are formed by a collection of triples in the form of (head, relation, tail), where heads and tails are called entities and represented by nodes while relations are links in KGs. Since KGs are often incomplete, one critical task in KG is to predict missing information based on available knowledge. Knowledge graph embedding (KGE) is one of the most popular approaches for link prediction and entity typing due to its effectiveness, efficiency, and explainability.
In this thesis, we propose a KGE inspired by compounding three-dimensional geometric transformation named CompoundE3D. Specifically, we apply an adapted beam search algorithm to discover the best performing variants and experiment with different ensemble strategies to achieve state-of-the-art results on four benchmarking datasets. We also analyze the properties of different operators under the CompoundE3D framework and empirically verify their advantages.
I’d like to thank Prof. Kuo for his advising throughout the last 4 years. The working style in MCL has been very effective. Without the weekly reports and meetings, it would probably take me more time to grow. I really respect Prof. Kuo’s research vision and the research direction we embark on will be appreciated in the long term. I’m also very fortunate to be with a group of very nice fellow students in the lab. Everyone is so supportive and willing to help each other. MCL is a perfect fit for students like me who may not be the most talented but are determined to work hard and do good research.
— Xiou Ge
