Publication

Spam Fighting in Social Tagging Systems

Related publications (40)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Entity-based Classification of Twitter Messages

Karl Aberer, Zoltán Miklós, Surender Reddy Yerva

Twitter is a popular micro-blogging service on theWeb, where people can enter short messages, which then become visible to some other users of the service. While the topics of these messages varies, there are a lot of messages where the users express their ...

2012

Collaborative Personalized Top-k Processing

Rachid Guerraoui, Anne-Marie Kermarrec

This article presents P4Q, a fully decentralized gossip-based protocol to personalize query processing in social tagging systems. P4Q dynamically associates each user with social acquaintances sharing similar tagging behaviors. Queries are gossiped among s ...

Association for Computing Machinery2011

Leveraging User-Generated Content for Information Discovery on the Web

Adriana Budura

The large-scale adoption of the Web 2.0 paradigm has revolutionized the way we interact with the Web today. End-users, so far mainly passive consumers of information are now becoming active information producers, creating, uploading, and commenting on all ...

EPFL2010

Object-based Tag Propagation for Semi-automatic Annotation of Images

Touradj Ebrahimi, Jong Seok Lee, Lutz Goldmann, Ivan Ivanov, Péter Vajda

Over the last few years, social network systems have greatly increased users’ involvement in online content creation and annotation. Since such systems usually need to deal with a large amount of multimedia data, it becomes desirable to realize an interact ...

2010

Labelling Game for Twitter Streams

Valérian Hanser

The main goal of this project is to build a mean and to populate a database with correct information regarding some decided pairings. This database will then be compared to the results of algorithms that process the same pairings, which provides a way to a ...

2010

The Participation Payoff: Challenges and Opportunities for Multimedia Access in Networked Communities

Frédéric Dufaux

Increasingly, multimedia collections are associated with networked communities consisting of interconnected groups of users who create, annotate, share, view, critique and remix collection content. Information arises within networked communities via connec ...

2010

Computing in Social Networks

Rachid Guerraoui, Anne-Marie Kermarrec, Kévin Clément Huguenin, Andrei Giurgiu

This paper defines the problem of Scalable Secure Computing in a Social network: we call it the S-3 problem. In short, nodes, directly reflecting on associated users, need to compute a function f : V -> U of their inputs in a set of constant size, in a sca ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010

Neighborhood-based Tag Prediction

Karl Aberer, Philippe Cudré-Mauroux, Sebastian Michel, Adriana Budura

We consider the problem of tag prediction in collaborative tagging systems where users share and annotate resources on the Web. We put forward HAMLET, a novel approach to automatically propagate tags along the edges of a graph which relates similar documen ...

2009

Analyzing Flickr Groups

Daniel Gatica-Perez, Radu Andrei Negoescu

There is an explosion of community-generated multimedia content available online. In particular, Flickr constitutes a 200-million photo sharing system where users participate following a variety of social motivations and themes. Flickr groups are increasin ...

ACM2008

Analyzing Flickr Groups

Daniel Gatica-Perez, Radu Andrei Negoescu

IDIAP2008