|<< Previous Entry||Next Entry >>||New Event Entry||Edit this Entry||Login to DB (to update, delete)|
|Title:||Socially Enhanced Search and Exploration in Social Tagging Networks|
|coming from:||Max-Planck-Institut für Informatik - D5|
|Visibility:||D1, D2, D3, D4, D5, SWS, RG1, MMCI|
We use this to send out email in the morning.
|Date:||Monday, 23 April 2012|
|Building:||E1 4 - MPI-INF|
|Social tagging networks have become highly popular for publishing and|
searching contents. Users in such networks can review, rate and comment
on contents, or annotate them with keywords (social tags) to give
short but exact text representations of even non-textual contents.
Moreover, there is an inherent support for interactions and relationships
among users and, thus, naturally form groups of friends or of common
This dissertation addresses in this area three research topics, namely:
i) A comprehensive framework for search in social tagging networks and
efficient top-k result retrieval. (ii) A new approach of solving the APSD Problem
for dynamically update friendship relations in large user networks. (iii)
Countering cheating in P2P authority computations over social networks.
|Video Broadcast:||No||To Location:|
|Created by:||Petra Schaaf/AG5/MPII/DE, 04/10/2012 12:47 PM||Last modified by:||Uwe Brahm/MPII/DE, 04/23/2012 06:01 AM|