Home Courses Facebook Friend Recommendation using Graph Mining Feature engineering on Graphs:Jaccard & Cosine Similarities

Feature engineering on Graphs:Jaccard & Cosine Similarities

Instructor: Applied AI Course Duration: 15 mins

This content is restricted. Please Login

Prev

Next

EDA:Train and test split.

PageRank

Facebook Friend Recommendation using Graph Mining

1.1

Problem definition

6 min

1.2

Overview of Graphs: node/vertex, edge/link, directed-edge, path.

11 min

1.3

Data format & Limitations.

9 min

1.4

Mapping to a supervised classification problem.

9 min

1.5

Business constraints & Metrics.

7 min

1.6

EDA:Basic Stats

14 min

1.7

EDA:Follower and following stats.

12 min

1.8

EDA:Binary Classification Task

16 min

1.9

Kartz Centrality

6 min

1.10

10 min

1.11

11 min

1.12

Weight features

6 min

1.13

10 min

1.14

EDA:Train and test split.

11 min

1.15

Feature engineering on Graphs:Jaccard & Cosine Similarities

15 min

1.16

14 min

1.17

4 min

1.18

Connected-components

12 min

1.19

12 min