Every single day, lots of users actively participate in social media sites (e.g., Facebook, YouTube, Last.fm, Flicker, etc.) upload photos, videos, share bookmarks, write blogs and annotate/comment on content provided by others. With the recent proliferation of social media sites, users are overwhelmed by the huge amount of available content. Therefore, organizing and retrieving appropriate multimedia content is becoming an increasingly important and challenging task. This challenging task led a number of research communities to concentrate on social tagging systems (also known as folksonomy) that allow users to freely annotate their media items (e.g., music, images, or video) with any sort of arbitrary words, referred to as tags. Tags assist users to organize their own content, as well as to find relevant content shared by other users. In this thesis, we first analyze how useful a folksonomy is for improving personalized services such as tag recommendation, tag-based search and item annotation. We then propose two new algorithms for social media retrieval and tag recommendation respectively. The first algorithm computes the latent preferences of tags for users from other similar tags, as well as latent annotations of tags for items from other similar items. We then seamlessly map the tags onto items, depending on an individual user’s query, to find the most desirable content relevant to the user’s needs. The second algorithm improves tag-recommendation and item annotation by adapting the Katz measure, a path-ensemble based proximity measure, for the use in social tagging systems. In this algorithm we model folksonomy as a weighted, undirected tripartite graph. We then apply the Katz measure to this graph, and exploit it to provide personalized tag recommendation for individual users. We evaluate our algorithms on two real-world folksonomies collected from Last.fm and CiteULike. The experimental results demonstrate that the proposed algorithms improve the search and the recommendation performance, and obtain significant gains in cold start situations where relatively little information is known about a user or an item

Every single day, lots of users actively participate in social media sites (e.g., Facebook, YouTube, Last.fm, Flicker, etc.) upload photos, videos, share bookmarks, write blogs and annotate/comment on content provided by others. With the recent proliferation of social media sites, users are overwhelmed by the huge amount of available content. Therefore, organizing and retrieving appropriate multimedia content is becoming an increasingly important and challenging task. This challenging task led a number of research communities to concentrate on social tagging systems (also known as folksonomy) that allow users to freely annotate their media items (e.g., music, images, or video) with any sort of arbitrary words, referred to as tags. Tags assist users to organize their own content, as well as to find relevant content shared by other users. In this thesis, we first analyze how useful a folksonomy is for improving personalized services such as tag recommendation, tag-based search and item annotation. We then propose two new algorithms for social media retrieval and tag recommendation respectively. The first algorithm computes the latent preferences of tags for users from other similar tags, as well as latent annotations of tags for items from other similar items. We then seamlessly map the tags onto items, depending on an individual user’s query, to find the most desirable content relevant to the user’s needs. The second algorithm improves tag-recommendation and item annotation by adapting the Katz measure, a path-ensemble based proximity measure, for the use in social tagging systems. In this algorithm we model folksonomy as a weighted, undirected tripartite graph. We then apply the Katz measure to this graph, and exploit it to provide personalized tag recommendation for individual users. We evaluate our algorithms on two real-world folksonomies collected from Last.fm and CiteULike. The experimental results demonstrate that the proposed algorithms improve the search and the recommendation performance, and obtain significant gains in cold start situations where relatively little information is known about a user or an item