Have any question ?
+91 8106-920-029
+91 6301-939-583
team@appliedaicourse.com
Register
Login
COURSES
Applied Machine Learning Course
Diploma in AI and ML
GATE CS Blended Course
Interview Preparation Course
AI Workshop
AI Case Studies
Courses
Applied Machine Learning Course
Workshop
Case Studies
Job Guarantee
Job Guarantee Terms & Conditions
Incubation Center
Student Blogs
Live Sessions
Success Stories
For Business
Upskill
Hire From Us
Contact Us
Home
Courses
Facebook Friend Recommendation using Graph Mining
HITS Score
HITS Score
Instructor:
Applied AI Course
Duration:
10 mins
Full Screen
Close
This content is restricted. Please
Login
Prev
Next
Kartz Centrality
SVD
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
HITS Score
10 min
1.11
SVD
11 min
1.12
Weight features
6 min
1.13
Modeling
10 min
1.14
EDA:Train and test split.
11 min
1.15
Feature engineering on Graphs:Jaccard & Cosine Similarities
15 min
1.16
PageRank
14 min
1.17
Shortest Path
4 min
1.18
Connected-components
12 min
1.19
Adar Index
12 min
Close