<?xml version="1.0" encoding="utf-8"?>
<feed xmlns="http://www.w3.org/2005/Atom">
  <title>Linhao Luo</title>
  
  
  <link href="https://rmanluo.github.io/atom.xml" rel="self"/>
  
  <link href="https://rmanluo.github.io/"/>
  <updated>2026-04-09T10:24:30.526Z</updated>
  <id>https://rmanluo.github.io/</id>
  
  <author>
    <name>Linhao Luo</name>
    
  </author>
  
  <generator uri="https://hexo.io/">Hexo</generator>
  
  <entry>
    <title>Talks</title>
    <link href="https://rmanluo.github.io/2024/11/25/Talks/"/>
    <id>https://rmanluo.github.io/2024/11/25/Talks/</id>
    <published>2024-11-25T14:44:19.000Z</published>
    <updated>2026-04-09T10:24:30.526Z</updated>
    
    <content type="html"><![CDATA[<h1 id="Talks"><a href="#Talks" class="headerlink" title="Talks"></a>Talks</h1><hr><ul><li><p>EMNLP 2025 Tutorial, <a href="https://monashnlp.github.io/monashnlp/files/monash_emnlp_tutorial_final.pdf">Continual Learning for Large Language Models</a>, 2025.</p></li><li><p>KDD 2025 Tutorial, <a href="https://sites.google.com/view/medklm2025/home">Unifying Large Language Models and Knowledge Graphs for Medicine and Healthcare</a>, 2025.</p></li><li><p>The WebConf 2025 Tutorial, <a href="https://www.cs.emory.edu/~jyang71/files/klm-tutorial.pdf" target="_blank">Integrating Large Language Models and Knowledge Graphs for Next-level AGI</a>, 2025.<br><a href="files/KG_LLM_AGI_WWW25_tut-final.pdf" target="_blank">[Slides]</a>.</p></li><li><p>AJCAI Tutorial, <a href="https://monashnlp.github.io/monashnlp/cl4llm/">Continual Learning for Large Language Models</a>, 2024.</p></li></ul>]]></content>
    
    
      
      
    <summary type="html">&lt;h1 id=&quot;Talks&quot;&gt;&lt;a href=&quot;#Talks&quot; class=&quot;headerlink&quot; title=&quot;Talks&quot;&gt;&lt;/a&gt;Talks&lt;/h1&gt;&lt;hr&gt;
&lt;ul&gt;
&lt;li&gt;&lt;p&gt;EMNLP 2025 Tutorial, &lt;a href=&quot;https://monash</summary>
      
    
    
    
    
  </entry>
  
  <entry>
    <title>Teaching</title>
    <link href="https://rmanluo.github.io/2024/07/26/Teaching/"/>
    <id>https://rmanluo.github.io/2024/07/26/Teaching/</id>
    <published>2024-07-26T03:07:19.000Z</published>
    <updated>2026-04-09T10:24:30.526Z</updated>
    
    <content type="html"><![CDATA[<h1 id="Teaching"><a href="#Teaching" class="headerlink" title="Teaching"></a>Teaching</h1><hr><ul><li>Lecturer, <a href="https://handbook.monash.edu/2025/units/FIT5217?year=2026">FIT5217 - Natural language processing</a>, 2026.</li><li>Teaching Assistant, <a href="https://handbook.monash.edu/2025/units/FIT5217?year=2025">FIT5217 - Natural language processing</a>, 2025.</li><li>Teaching Assistant, <a href="https://handbook.monash.edu/2025/units/FIT5212?year=2025">FIT5212 - Data analysis for semi-structured data</a>, 2025.</li><li>Teaching Assistant, <a href="https://handbook.monash.edu/2024/units/FIT9136?year=2024">FIT9136 - Algorithms and programming foundations in Python</a>, 2024.</li></ul>]]></content>
    
    
      
      
    <summary type="html">&lt;h1 id=&quot;Teaching&quot;&gt;&lt;a href=&quot;#Teaching&quot; class=&quot;headerlink&quot; title=&quot;Teaching&quot;&gt;&lt;/a&gt;Teaching&lt;/h1&gt;&lt;hr&gt;
&lt;ul&gt;
&lt;li&gt;Lecturer, &lt;a href=&quot;https://handbook</summary>
      
    
    
    
    
  </entry>
  
  <entry>
    <title>Services</title>
    <link href="https://rmanluo.github.io/2022/12/28/Services/"/>
    <id>https://rmanluo.github.io/2022/12/28/Services/</id>
    <published>2022-12-28T03:21:05.000Z</published>
    <updated>2026-04-09T10:24:30.526Z</updated>
    
    <content type="html"><![CDATA[<h1 id="Services"><a href="#Services" class="headerlink" title="Services"></a>Services</h1><hr><h2 id="Conference-Organization"><a href="#Conference-Organization" class="headerlink" title="Conference Organization"></a>Conference Organization</h2><ul><li>Special Session Chair: <a href="https://ijcnn-2026-kg-llm.github.io/">Integrating Large Language Models and Knowledge Graphs</a>, IJCNN 2026.</li></ul><h2 id="Journal-Reviewer"><a href="#Journal-Reviewer" class="headerlink" title="Journal Reviewer"></a>Journal Reviewer</h2><ul><li><a href="https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6221036">IEEE Transactions on Cybernetics</a> (IF: 19.11)</li><li><a href="https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=69">IEEE Transactions on Knowledge and Data Engineering</a> (TKDE, IF: 9.235)</li><li><a href="https://www.sciencedirect.com/journal/information-sciences">Information Sciences</a> (IF: 8.233)</li><li><a href="https://www.sciencedirect.com/journal/information-processing-and-management">Information Processing &amp; Management</a> (IF: 7.466)</li><li><a href="https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5962385">IEEE Transactions on Neural Networks and Learning Systems</a> (TNNLS, IF: 14.255)</li><li><a href="https://www.springer.com/journal/778/">The International Journal on Very Large Data Bases</a> (VLDB, IF: 4.243)</li><li><a href="https://www.springer.com/journal/10115">Knowledge and Information Systems</a> (KAIS, IF: 2.531)</li><li><a href="https://www.springer.com/journal/11227">The Journal of Supercomputing</a> (IF: 2.557)</li><li><a href="https://dl.acm.org/journal/tkdd">ACM Transactions on Knowledge Discovery from Data</a> (IF: 4.711)</li></ul><h2 id="Conference-Reviewer"><a href="#Conference-Reviewer" class="headerlink" title="Conference Reviewer"></a>Conference Reviewer</h2><ul><li>ICLR, PC Member (2024, 2025, 2026)</li><li>ICML, PC Member (2025, 2026)</li><li>NeurIPS, PC Member (2023, 2024, 2025)</li><li>AAAI, PC Member (2022, 2024, 2025, 2026)</li><li>IJCAI, PC Member (2024, 2025, 2026)</li><li>KDD, PC Member (2023, 2024, 2025, 2026)</li><li>TheWebConf, PC Member (2023, 2024, 2026)</li><li>ICDE, PC Member (2021, 2023)</li><li>CIKM, PC Member (2021, 2022, 2024, 2025)</li></ul>]]></content>
    
    
      
      
    <summary type="html">&lt;h1 id=&quot;Services&quot;&gt;&lt;a href=&quot;#Services&quot; class=&quot;headerlink&quot; title=&quot;Services&quot;&gt;&lt;/a&gt;Services&lt;/h1&gt;&lt;hr&gt;
&lt;h2 id=&quot;Conference-Organization&quot;&gt;&lt;a href=&quot;#C</summary>
      
    
    
    
    
  </entry>
  
  <entry>
    <title>Award</title>
    <link href="https://rmanluo.github.io/2022/12/28/award/"/>
    <id>https://rmanluo.github.io/2022/12/28/award/</id>
    <published>2022-12-28T03:21:05.000Z</published>
    <updated>2026-04-09T10:24:30.526Z</updated>
    
    <content type="html"><![CDATA[<h1 id="Awards"><a href="#Awards" class="headerlink" title="Awards"></a>Awards</h1><hr><ul><li><a href="https://www.monash.edu/graduate-research/support-and-resources/examination/prestigious-awardees">2025 Mollie Holman Award</a>, Monash’s highest academic honor for outstanding PhD researchers. (Mar., 2026)</li><li>Monash FIT 2025 Dean’s Award for Excellence by A Graduate Research Student. (Oct., 2025)</li><li>ICDM 2023 TuGraph Competition: Pretrained Model-based Community Detection and Fraudulent Group Mining, Third Place Award (Dec., 2023)</li><li>SIGIR 2023 Student Travel Award. (May., 2023)</li></ul>]]></content>
    
    
      
      
    <summary type="html">&lt;h1 id=&quot;Awards&quot;&gt;&lt;a href=&quot;#Awards&quot; class=&quot;headerlink&quot; title=&quot;Awards&quot;&gt;&lt;/a&gt;Awards&lt;/h1&gt;&lt;hr&gt;
&lt;ul&gt;
&lt;li&gt;&lt;a href=&quot;https://www.monash.edu/graduate-re</summary>
      
    
    
    
    
  </entry>
  
  <entry>
    <title>News</title>
    <link href="https://rmanluo.github.io/2022/12/28/News/"/>
    <id>https://rmanluo.github.io/2022/12/28/News/</id>
    <published>2022-12-28T03:19:03.000Z</published>
    <updated>2026-04-09T10:24:30.526Z</updated>
    
    <content type="html"><![CDATA[<h1 id="News"><a href="#News" class="headerlink" title="News"></a>News</h1><hr><ul><li><font color=orange>[Award]:</font> I am honored to receive the <a href="https://www.monash.edu/graduate-research/support-and-resources/examination/prestigious-awardees">2025 Mollie Holman Award</a>, Monash’s highest academic honor for outstanding PhD researchers. (Mar., 2026)</li><li><font color=blue>[Progress]:</font> I have officially been awarded the degree of Doctor of Philosophy! 🎉 (Jan., 2025)</li><li><font color=red>[Paper]:</font> 3 papers (2 GraphRAG and 1 Multi-agent) have been accepted by ICLR 2026! (Jan., 2026)</li></ul><details>  <summary>More News (2025)</summary>  <ul><li><font color=orange>[Award]:</font> I am honor to receive Monash FIT 2025 Dean’s Award for Excellence by A Graduate Research Student. (Oct., 2025)</li><li><font color=red>[Paper]:</font> Our latest work on Graph Foundation Model for RAG: <a href="https://www.arxiv.org/abs/2502.01113">GFM-RAG: Graph Foundation Model for Retrieval Augmented Generation</a> has been accepted by NeurIPS 2025. (Sep., 2025)</li><li><font color=blue>[Progress]:</font> I am happy to start my new position as a Research Fellow at Monash University 🎉 (Sep., 2025)</li><li><font color=red>[Paper]:</font> Our paper about foundation model on <a href="https://www.nature.com/articles/s41467-025-63678-7">Large lithium-ion battery model for secure shared electric bike battery in smart cities</a> has been accepted by <a href="https://www.nature.com/ncomms/">Nature Communications</a>.</li><li><font color=red>[Paper]:</font> Our latest work on KG + LLM reasoning: <a href="https://arxiv.org/abs/2410.13080">Graph-constrained Reasoning: Faithful Reasoning on Knowledge Graphs with Large Language Models</a> has been accepted by ICML 2025. (May, 2025)</li><li><font color=red>[Paper]:</font> We are happy to release the first <strong>graph foundation model</strong>-powered RAG pipeline (<a href="https://www.arxiv.org/abs/2502.01113">GFM-RAG</a>) that combines the power of GNNs with LLMs to enhance reasoning. <a href="https://github.com/RManLuo/gfm-rag">Code</a> (Feb., 2025)</li><li><font color=blue>[Progress]:</font> I have passed my PhD final review! 🎉 (Feb., 2025)</li><li><font color=red>[Paper]:</font> Our tutorial on Integrating Large Language Models and Knowledge Graphs for Next-level AGI and one paper of GraphRAG for explainable recommendation has been accepted by WWW 2025. See you in Sydney! (Jan., 2025)</details></li></ul><details>  <summary>More News (2024 and before)</summary><ul><li><font color=red>[Paper]:</font> Our paper “<a href="https://arxiv.org/abs/2405.14170">Large Language Models-guided Dynamic Adaptation for Temporal Knowledge Graph Reasoning</a>“ has been accepted by NeurIPS 2024! (Sep., 2024)</li><li><font color=red>[Paper]:</font> Our paper “<a href="https://arxiv.org/abs/2402.11199">Direct Evaluation of Chain-of-Thought in Multi-hop Reasoning with Knowledge Graphs</a>“ has been accepted by <a href="https://2024.aclweb.org/">ACL 2024</a>. (May., 2024)</li><li><font color=red>[Paper]:</font> Our paper “<a href="https://arxiv.org/abs/2310.01061">Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning</a>“ has been accepted by <a href="https://iclr.cc/">ICLR 2024</a>. (Jan., 2024)</li><li><font color=orange>[Award]:</font> I am honor to receive the Third Place Award of ICDM 2023 TuGraph Competition. (Dec., 2023)</li><li><font color=purple>[Service]:</font> I will serve as a PC member of <a href="https://aaai-24.aaai.org/">AAAI 2024</a>. (Jul., 2023)</li><li><font color=red>[Paper]:</font> Our paper “<a href="https://arxiv.org/abs/2306.08302">Unifying Large Language Models and Knowledge Graphs: A Roadmap.</a>“ is now public. (Jun. 2023)</li><li><font color=red>[Paper]:</font> Our paper “Towards Few-shot Inductive Link Prediction on Knowledge Graphs: A Relational Anonymous Walk-guided Neural Process Approach” has been accepted by <a href="https://2023.ecmlpkdd.org/">ECML PKDD 2023</a>. (Jun. 2023)</li><li><font color=orange>[Award]:</font> I am honor to receive the SIGIR 2023 Student Travel Award. (May., 2023)</li><li><font color=red>[Paper]:</font> Our paper “<a href="https://arxiv.org/abs/2208.06144">GSim: A Graph Neural Network based Relevance Measure for Heterogeneous Graphs</a>“ has been accepted by <a href="https://ieeexplore.ieee.org/">TKDE</a>. (Apr., 2023)</li><li><font color=purple>[Service]:</font> I will serve as a PC member of <a href="http://bigdataieee.org/BigData2023/">IEEE BigData 2023</a>. (Apr., 2023)</li><li><font color=red>[Paper]:</font> Two papers have been accepted by <a href="https://sigir.org/sigir2023/">SIGIR 2023</a>. (Apr., 2023)</li><li><font color=purple>[Service]:</font> I will serve as a TPC member of <a href="https://2023.ijcnn.org/">IJCNN 2023</a>. (Feb., 2023)</li><li><font color=red>[Paper]:</font> Our paper “<a href="https://arxiv.org/abs/2202.12524">MAMDR: A Model Agnostic Learning Method for Multi-Domain Recommendation</a>“ has been accepted by <a href="https://icde2023.ics.uci.edu/">ICDE 2023</a>, Industry and Applications Track. (Feb., 2023)</li><li><font color=blue>[Progress]:</font> I have passed my MPhil confirmation milestone and will transfer to the PhD candidate. (Nov., 2022)</li><li><font color=red>[Paper]:</font> Our paper “<a href="https://arxiv.org/abs/2211.08568">Graph Sequential Neural ODE Process for Link Prediction on Dynamic and Sparse Graphs</a>“ has been accepted by <a href="https://www.wsdm-conference.org/2023/">WSDM 2023</a>. (Oct., 2022)</details></li></ul>]]></content>
    
    
      
      
    <summary type="html">&lt;h1 id=&quot;News&quot;&gt;&lt;a href=&quot;#News&quot; class=&quot;headerlink&quot; title=&quot;News&quot;&gt;&lt;/a&gt;News&lt;/h1&gt;&lt;hr&gt;
&lt;ul&gt;
&lt;li&gt;&lt;font color=orange&gt;[Award]:&lt;/font&gt; I am honored to </summary>
      
    
    
    
    
  </entry>
  
  <entry>
    <title>Publications</title>
    <link href="https://rmanluo.github.io/2021/11/13/Publications/"/>
    <id>https://rmanluo.github.io/2021/11/13/Publications/</id>
    <published>2021-11-13T08:04:08.000Z</published>
    <updated>2026-04-09T10:24:30.526Z</updated>
    
    <content type="html"><![CDATA[<h1 id="Selected-Publications"><a href="#Selected-Publications" class="headerlink" title="Selected Publications"></a>Selected Publications</h1><hr><p><a href="https://scholar.google.com/citations?user=RO46HpcAAAAJ">Full Publications Lists</a></p><ul><li><p><strong><a href="https://arxiv.org/abs/2509.24276">G-reasoner: Foundation Models for Unified Reasoning over Graph-structured Knowledge</a></strong><br><strong>Linhao Luo</strong>, Zicheng Zhao, Junnan Liu, Zhangchi Qiu, Junnan Dong, Serge Panev, Chen Gong, Thuy-Trang Vu, Gholamreza Haffari, Dinh Phung, Alan Wee-Chung Liew, Shirui Pan<br>ICLR 2026 (Core A*).<br><a href="https://github.com/RManLuo/gfm-rag">[Code]</a></p></li><li><p><strong><a href="https://www.arxiv.org/abs/2502.01113">GFM-RAG: Graph Foundation Model for Retrieval Augmented Generation</a></strong><br><strong>Linhao Luo</strong>, Zicheng Zhao, Gholamreza Haffari, Dinh Phung, Chen Gong, Shirui Pan<br>NeurIPS 2025 (CCF-A, Core A*).<br><a href="https://github.com/RManLuo/gfm-rag">[Code]</a></p></li><li><p><strong><a href="https://arxiv.org/abs/2410.13080">Graph-constrained Reasoning: Faithful Reasoning on Knowledge Graphs with Large Language Models</a></strong><br><strong>Linhao Luo</strong>, Zicheng Zhao, Gholamreza Haffari, Yuan-Fang Li, Chen Gong, Shirui Pan<br>ICML 2025 (CCF-A, Core A*).<br><a href="https://github.com/RManLuo/graph-constrained-reasoning">[Code]</a></p></li><li><p><strong><a href="https://arxiv.org/abs/2405.14170">Large Language Models-guided Dynamic Adaptation for Temporal Knowledge Graph Reasoning</a></strong><br>Jiapu Wang, Kai Sun, <strong>Linhao Luo</strong>, Wei Wei, Yongli Hu, Alan Wee-Chung Liew, Shirui Pan, Baocai Yin<br>NeurIPS 2024 (CCF-A, Core A*).</p></li><li><p><strong><a href="https://arxiv.org/abs/2402.11199">Direct Evaluation of Chain-of-Thought in Multi-hop Reasoning with Knowledge Graphs</a></strong><br>Nguyen Minh-Vuong, <strong>Linhao Luo</strong>, Fatemeh Shiri, Dinh Phung, Yuan-Fang Li, Thuy-Trang Vu, Gholamreza Haffari<br>ACL 2024 (CCF-A, Core A*).</p></li><li><p><strong><a href="https://arxiv.org/abs/2310.11638">Systematic Assessment of Factual Knowledge in Large Language Models</a></strong><br><strong>Linhao Luo</strong>, Thuy-Trang Vu, Dinh Phung, Gholamreza Haffari<br>EMNLP 2023 (CCF-B, Core A*).<br><a href="https://github.com/RManLuo/llm-facteval">[Code&amp;data]</a></p></li><li><p><strong><a href="https://arxiv.org/abs/2310.01061">Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning</a></strong><br><strong>Linhao Luo</strong>, Yuan-Fang Li, Gholamreza Haffari, Shirui Pan<br>ICLR 2024 (Core A*).<br><a href="https://github.com/rmanluo/reasoning-on-graphs">[Code&amp;data]</a>  <a href="https://github.com/RManLuo/reasoning-on-graphs/blob/master/Reasoning%20on%20Graphs-ICLR2024-slides.pdf">[Slides]</a> <a href="https://github.com/RManLuo/reasoning-on-graphs/blob/master/poster.pdf">[Poster]</a></p></li><li><p><strong><a href="https://arxiv.org/abs/2309.01538">ChatRule: Mining Logical Rules with Large Language Models for Knowledge Graph Reasoning</a></strong><br><strong>Linhao Luo</strong>, Jiaxin Ju, Bo Xiong, Yuan-Fang Li, Gholamreza Haffari, Shirui Pan<br>PAKDD 2025.<br><a href="https://github.com/rmanluo/chatrule">[Code&amp;data]</a></p></li><li><p><strong><a href="https://arxiv.org/abs/2306.08302">Unifying Large Language Models and Knowledge Graphs: A Roadmap.</a></strong><br>Shirui Pan, <strong>Linhao Luo</strong> (Equal contribution), Yufei Wang, Chen Chen, Jiapu Wang, Xindong Wu.<br>IEEE Transactions on Knowledge and Data Engineering, (TKDE, CCF-A, Core A).<br><a href="https://github.com/RManLuo/Awesome-LLM-KG">[Code&amp;data]</a></p></li><li><p><a href="https://arxiv.org/abs/2208.06144"><strong>GSim: A Graph Neural Network based Relevance Measure for Heterogeneous Graphs.</strong></a><br><strong>Linhao Luo</strong>, Yixiang Fang, Moli Lu, Xin Cao, Xiaofeng Zhang, and Wenjie Zhang.<br>IEEE Transactions on Knowledge and Data Engineering, (TKDE, CCF-A, Core A).<br><a href="https://github.com/RManLuo/GSim">[Code&amp;data]</a></p></li><li><p><a href="https://arxiv.org/abs/2304.08183"><strong>Normalizing Flow-based Neural Process for Few-Shot Knowledge Graph Completion.</strong></a><br><strong>Linhao Luo</strong>, Yuan-Fang Li, Gholamreza Haffari, and Shirui Pan.<br>SIGIR 2023 (CCF-A, Core A*).<br><a href="https://github.com/RManLuo/NP-FKGC">[Code&amp;data]</a></p></li><li><p><a href="https://arxiv.org/abs/2202.12524"><strong>MAMDR: A Model Agnostic Learning Method for Multi-Domain Recommendation.</strong></a><br><strong>Linhao Luo</strong>, Yumeng Li, Buyu Gao, Shuai Tang, Sinan Wang, Jiancheng Li, Tanchao Zhu, Jiancai Liu, Zhao Li, and Shirui Pan.<br>ICDE 2023, Industry and Applications Track (CCF-A, Core A*).<br><a href="https://github.com/RManLuo/MAMDR">[Code&amp;data]</a>  <a href="https://github.com/RManLuo/MAMDR/blob/master/ICDE-23-Slides-MAMDR.pdf">[Slides]</a></p></li><li><p><a href="https://arxiv.org/abs/2211.08568"><strong>Graph Sequential Neural ODE Process for Link Prediction on Dynamic and Sparse Graphs.</strong></a><br><strong>Linhao Luo</strong>, Reza Haffari, Shirui Pan.<br>WSDM 2023 (CCF-B, Core A*).<br><a href="https://github.com/RManLuo/GSNOP">[Code&amp;data]</a>  <a href="https://github.com/RManLuo/GSNOP/blob/master/WSDM-23-GSNOP-Slides.pdf">[Slides]</a> <a href="https://github.com/RManLuo/GSNOP/blob/master/WSDM-23-GSNOP-Poster.pdf">[Poster]</a></p></li><li><p><a href="https://arxiv.org/abs/2109.02058"><strong>Detecting Communities from Heterogeneous Graphs: A Context Path-based Graph Neural Network Model.</strong></a><br><strong>Linhao Luo</strong>, Yixiang Fang, Xin Cao, Xiaofeng Zhang, Wenjie Zhang.<br>In Proceedings of the 30th ACM International Conference on Information &amp; Knowledge Management (CIKM 2021, CCF-B, Core A), pp. 1170-1180.<br><a href="https://github.com/RManLuo/CP-GNN">[Code&amp;data]</a> </p></li></ul>]]></content>
    
    
      
      
    <summary type="html">&lt;h1 id=&quot;Selected-Publications&quot;&gt;&lt;a href=&quot;#Selected-Publications&quot; class=&quot;headerlink&quot; title=&quot;Selected Publications&quot;&gt;&lt;/a&gt;Selected Publications&lt;/</summary>
      
    
    
    
    
  </entry>
  
  <entry>
    <title>Biography</title>
    <link href="https://rmanluo.github.io/2021/11/13/Biography/"/>
    <id>https://rmanluo.github.io/2021/11/13/Biography/</id>
    <published>2021-11-13T07:03:08.000Z</published>
    <updated>2026-04-09T10:24:30.526Z</updated>
    
    <content type="html"><![CDATA[<h1 id="Biography"><a href="#Biography" class="headerlink" title="Biography"></a>Biography</h1><hr><p>Hello! I am Linhao Luo (罗林浩), a Research Fellow at Monash University. My research interests mainly focus on the areas of artificial intelligence and data mining, especially for the knowledge graphs, large language models, and graph neural networks.<br>Previously, I obtained my PhD degree in computer science at Monash University advised by Prof. <a href="https://shiruipan.github.io/">Shirui Pan</a>, Prof. <a href="https://rezahaffari.github.io/HomePage/HomePage.html">Reza Haffari</a>, and Prof. <a href="https://research.monash.edu/en/persons/dinh-phung">Dinh Phung</a>, with previous supervision from A/Prof. <a href="https://liyuanfang.github.io/">Yuan-Fang Li</a>. I received my bachelor’s degree in computer science from Harbin Institute of Technology, Shenzhen. I have also worked at Tencent and Alibaba as an intern.</p><p><strong>Contact</strong>: <a href="mailto:Linhao.Luo1@monash.edu">Linhao.Luo1@monash.edu</a></p>]]></content>
    
    
      
      
    <summary type="html">&lt;h1 id=&quot;Biography&quot;&gt;&lt;a href=&quot;#Biography&quot; class=&quot;headerlink&quot; title=&quot;Biography&quot;&gt;&lt;/a&gt;Biography&lt;/h1&gt;&lt;hr&gt;
&lt;p&gt;Hello! I am Linhao Luo (罗林浩), a Resea</summary>
      
    
    
    
    
  </entry>
  
</feed>
