1 / 10

Group Recommendation System for Facebook

E nkh-Amgalan Baatarjav Jedsada Chartree Thiraphat Meesumrarn. Group Recommendation System for Facebook. University of North Texas. Overview. Evolution of Communication Online Social Networking (OSN) Architecture Profile feature Profile Analysis Similarity inference

flint
Télécharger la présentation

Group Recommendation System for Facebook

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Enkh-AmgalanBaatarjav JedsadaChartree ThiraphatMeesumrarn Group Recommendation System for Facebook University of North Texas

  2. Overview • Evolution of Communication • Online Social Networking (OSN) • Architecture • Profile feature • Profile Analysis • Similarity inference • Clustering coefficient • Decision tree • Conclusion • Traditional medium of communication • Mail, telephone, fax, E-mail, etc. • Key to successful communication • Sharing common value

  3. Online Social Networking • User-driven content • Overwhelming number of groups • Finding suitable groups • Sharing a common value • Improving online social network

  4. Architecture • Profile feature extraction • Classification engine • Clustering • Building decision tree • Group recommendation

  5. Profile Feature • Group profile defined by profile features of users • Time Zone - Age • Gender - Relationship Status • Political View - Activities • Interest - Music • TV shows - Movies • Books - Affiliations • Note counts - Wall counts • Number of Fiends

  6. Profile Analysis

  7. Similarity Inference • Hierarchical clustering • Normalizing data [0, 1] • Computing distance matrix to calculate similarity among all pairs of members (a) • Finding average distance between all pairs in given two clusters s and r (a) (b)

  8. Clustering Coefficient • Ri is the normalized Euclidean distance from the center of member i • Nk is the normalized number of members within distance k from the center

  9. Decision Tree • Decision tree algorithm, based on binary recursive partitioning • Splitting rules • Gini, Twoing, Deviance • Tree optimization • Cross-validation (computation intense)

  10. Conclusion • Improving QoS of Online Social Networking • Architecture • Hierarchical clustering • Threshold value to reduce noise • Decision tree • Result

More Related