tenclea10 / facebook-friend-recommendation-using-graph-mining

In this challenge we have given a directed social graph, and we have to predict missing links to recommend users (Link Prediction in graph)

Problem statement:

This project is based on social media link prediction whether two users are going to be friend in future or not.

Data Overview

Taken data from facebook's recruting challenge on kaggle https://www.kaggle.com/c/FacebookRecruiting data contains two columns source and destination eac edge in graph

• Data columns (total 2 columns):
• source_node int64
• destination_node int64

Mapping the problem into supervised learning problem:

Generated training samples of good and bad links from given directed graph and for each link got some features like no of followers, is he followed back, page rank, katz score, adar index, some svd fetures of adj matrix, some weight features etc. and trained ml model based on these features to predict link.

Business objectives and constraints:

No low-latency requirement. Probability of prediction is useful to recommend ighest probability links.

Performance metric for supervised learning:

Both precision and recall is important so F1 score is good choice Confusion matrix.