<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Kaggle |</title><link>https://rajraghuwansh.github.io/tags/kaggle/</link><atom:link href="https://rajraghuwansh.github.io/tags/kaggle/index.xml" rel="self" type="application/rss+xml"/><description>Kaggle</description><generator>HugoBlox Kit (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Tue, 01 Feb 2022 00:00:00 +0000</lastBuildDate><image><url>https://rajraghuwansh.github.io/media/icon_hu_fb558a5ed99f547e.png</url><title>Kaggle</title><link>https://rajraghuwansh.github.io/tags/kaggle/</link></image><item><title>Link Prediction in Citation Networks</title><link>https://rajraghuwansh.github.io/projects/link-prediction/</link><pubDate>Tue, 01 Feb 2022 00:00:00 +0000</pubDate><guid>https://rajraghuwansh.github.io/projects/link-prediction/</guid><description>&lt;p&gt;This project presents our solution for the CentraleSupélec Data Science Kaggle Competition, where we achieved &lt;strong&gt;2nd Place&lt;/strong&gt; for the task of &lt;strong&gt;link prediction in citation networks&lt;/strong&gt;.&lt;/p&gt;
&lt;p&gt;The goal of the project was to predict missing links between papers in a citation graph using machine learning and graph-based methods. The task required understanding the structure of citation networks and designing models that could effectively infer whether an edge should exist between two nodes.&lt;/p&gt;
&lt;p&gt;Our approach focused on leveraging graph representations and learning meaningful relationships between papers based on the network structure. This project highlights the use of &lt;strong&gt;Graph Neural Networks (GNNs)&lt;/strong&gt; and related techniques for relational learning on graph data.&lt;/p&gt;
&lt;p&gt;You can view the full winning solution here:&lt;/p&gt;
&lt;p&gt;
&lt;/p&gt;</description></item></channel></rss>