cluestr mobile social networking for enhanced group communication l.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
Cluestr: Mobile Social Networking for Enhanced Group Communication PowerPoint Presentation
Download Presentation
Cluestr: Mobile Social Networking for Enhanced Group Communication

Loading in 2 Seconds...

play fullscreen
1 / 25

Cluestr: Mobile Social Networking for Enhanced Group Communication - PowerPoint PPT Presentation


  • 566 Views
  • Uploaded on

Cluestr: Mobile Social Networking for Enhanced Group Communication. Reto Grob (Swisscom) Michael Kuhn (ETH Zurich) Roger Wattenhofer (ETH Zurich) Martin Wirz (ETH Zurich) GROUP 2009 Sanibel Island, FL, USA. Biggest online social network?. Facebook (200M). Orkut (67M). MySpace (250M).

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

Cluestr: Mobile Social Networking for Enhanced Group Communication


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.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
    Presentation Transcript
    1. Cluestr: Mobile Social Networking for Enhanced Group Communication Reto Grob (Swisscom) Michael Kuhn (ETH Zurich) Roger Wattenhofer (ETH Zurich) Martin Wirz (ETH Zurich) GROUP 2009 Sanibel Island, FL, USA

    2. Biggest online social network? Michael Kuhn, ETH Zurich @ GROUP 2009

    3. Facebook (200M) Orkut (67M) MySpace (250M) Classmates (50M) LinkedIn (35M) Windows Live Spaces (120M) E-Mail (1.6B Internet users) (March 2009) Mobile Phone Contact Book (4B mobile subscribers) (March 2009) Michael Kuhn, ETH Zurich @ GROUP 2009

    4. borders between offline and online interaction are diminishing Michael Kuhn, ETH Zurich @ GROUP 2009

    5. social interaction gets mobile Michael Kuhn, ETH Zurich @ GROUP 2009

    6. online communication gets mobile virtual meets real-world communication mobile group interaction Michael Kuhn, ETH Zurich @ GROUP 2009

    7. „There‘s no training tonight!“ „What movie are we going to watch?“ „Be home at 8pm!“ Our Survey (342 participants from Europe) little support in current devices hardly anybody is willing to manually maintain groups Michael Kuhn, ETH Zurich @ GROUP 2009

    8. How to bridge this gap? Our approach: mechansim for group initialization on mobile devices Michael Kuhn, ETH Zurich @ GROUP 2009

    9. updated group recommended contacts group (i.e. „invited“ contacts) new recommendations Michael Kuhn, ETH Zurich @ GROUP 2009

    10. How to know which contacts to recommend? manual grouping analysis of communication patterns analysis of social network semantic analysis Michael Kuhn, ETH Zurich @ GROUP 2009

    11. Architecture Michael Kuhn, ETH Zurich @ GROUP 2009

    12. social network => recommendation? recommend best connected contacts Either:device needs to know inter-friend-connections => privacy Or:server needed for each recommendation step => server load => tunnel/mountains => traffic/costs clustering Michael Kuhn, ETH Zurich @ GROUP 2009

    13. clusters approximate communities! Michael Kuhn, ETH Zurich @ GROUP 2009

    14. Clustering for Recommendation: • send request to the server • server returns clusters • use clusters for recommendations only once for entire recommendation process if no connection available, old data can be used Michael Kuhn, ETH Zurich @ GROUP 2009

    15. 4 6 currently invited group Michael Kuhn, ETH Zurich @ GROUP 2009

    16. Hierarchical, divisive algorithm to cluster undirected, unweighted networks Based on algorithm presented by Girwan an Newman in 2002 Extended to allow overlapping clusters CONGA S. Gregory. An algorithm to find overlapping community structure in networks. In PKDD, 2007 Michael Kuhn, ETH Zurich @ GROUP 2009

    17. cluestr Michael Kuhn, ETH Zurich @ GROUP 2009

    18. Clustering accurracy How well do clusters represent communities? Effect of sparsity How well do algorithms perform in bootstrapping phase? Performance of group initialization How much time can be saved during group initialization? Evaluation Michael Kuhn, ETH Zurich @ GROUP 2009

    19. Friend-of-friend information for mobile phone contacts not available Facebook data 4 subjects (2 male, 2 female) assigned contacts to communities Ground Truth Michael Kuhn, ETH Zurich @ GROUP 2009

    20. identified by algorithm identified by subjects (ground truth) F-measure: Michael Kuhn, ETH Zurich @ GROUP 2009

    21. Clustering Accuracy • How well do clusters represent communities? • Number of clusters well matches number of communities Michael Kuhn, ETH Zurich @ GROUP 2009

    22. Effects of Sparsity How well does clustering work under such conditions? • Bootstrapping • Only few participants • Missing friendship links • Randomly removed links (10%-90%) • Randomly removed nodes (10%-90%) cluster sizes shrink only slowely precision stays, recall moderately decays precision and recall only slightly decay non-existing nodes cannot be recommended Michael Kuhn, ETH Zurich @ GROUP 2009

    23. Time Savings Community related: Considerable time savings Random: only slightly slower Sending message to contacs of a community Sending message to some contacs of a community Sending message to random contacts Michael Kuhn, ETH Zurich @ GROUP 2009

    24. We have shown that: Social network contains community information This information can be extracted by clustering algorithms The clusters can be used for contact recommendation Such recommendations save a significant amount of time Our work bridges gap identified by our survey: Group interaction is important, but badly supported by current devices Conclusion Michael Kuhn, ETH Zurich @ GROUP 2009

    25. Questions? Michael Kuhn, ETH Zurich @ GROUP 2009