


























Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
A graph-based approach to link prediction in social networks using a pareto-optimal genetic algorithm. The author explores the limitations of traditional friend-of-friend filtering and introduces components such as betweenness centrality, community detection, and clique percolation method (cpm) for filtering. The document also covers the implementation of a 10-dimensional pareto-optimal genetic algorithm for feature subset selection. The goal is to find the best combination of features that can determine friendships in social networks.
Typology: Slides
1 / 34
This page cannot be seen from the preview
Don't miss anything!
‣ Social networks = ‣ Dynamic, judgmental environment ‣ Affect friendships over time
‣ 1-2 hop distance only ‣ Friend-of-friend
‣ Multiple hops; > ‣ Structural; purely graph-based ‣ No explicit correlation between potential friends...
Filtering
friend than any other random person”
Mitchell M., Complex Systems: Network Thinking , 2006.
Indexes
What’s missing? ‣ Heterogeneity ‣ Human behavior and preferences ‣ Multiple hops
My approach ‣ Components (for filtering) ‣ Betweenness centrality ‣ Community detection ‣ Clique Percolation Method (CPM) ‣ Friends of friends ‣ 10-dimensional Pareto-optimal genetic algorithm