Publication

Personalizing Top-k Processing Online in a Peer-to-Peer Social Tagging Network

Related publications (43)

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.

To Tag or Not to Tag ? Harvesting Adjacent Metadata in Large-Scale Tagging Systems

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

We present HAMLET, a suite of principles, scoring models and algorithms to automatically propagate metadata along edges in a document neighborhood. As a showcase scenario we consider tag prediction in community-based Web 2.0 tagging applications. Experimen ...

ACM2008

Simplifying complex networks

David Gfeller

The framework of complex networks has been shown to describe adequately a wide class of complex systems made up of a large number of interacting units. In this framework, a node is associated to each unit and two nodes are connected by an edge if the two u ...

EPFL2007

Spectral coarse graining of complex networks

Paolo De Los Rios, David Gfeller

Reducing the complexity of large systems described as complex networks is key to understanding them and a crucial issue is to know which properties of the initial system are preserved in the reduced one. Here we use random walks to design a coarse graining ...

American Physical Society2007

Enhancing synchronizability of dynamical networks using the connection graph stability method

Martin Hasler, Ali Ajdari Rad, Mahdi Jalili

Dynamical networks with diffusive couplings are investigated from the point of view of synchronizability. Arbitrary connection graphs are admitted but the coupling is symmetric. Networks with equal interaction coefficients for all edges of the interaction ...

2007

Personalized information access in a wiki using structured tagging

Karl Aberer, Akshay Kiran Singh

Environmental engineers from different organizations work in interdisciplinary projects having the need of information exchange. In particular, a collaborative environment with personalized access to information is needed, which supports strongly varying i ...

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

Multilayer description of large scale communication networks

Sébastien Rumley, Christian Gaumier

Data exchanges between various modules and tools raise interfacing difficulties in a multilayer environment. This aspect may become particularly critical in a distributed context. ...

Springer, 233 Spring Street, New York, Ny 10013, United States2007

A statistical physics perspective of complex networks

Thomas Petermann

A statistical physics perspective of complex networks: from the architecture of the Internet and the brain to the spreading of an epidemic Statistical physics has revealed itself as the ideal framework to describe large networks appearing in a variety of d ...

EPFL2005

Synchronization in complex networks with blinking interactions

Martin Hasler, Igor Belykh

We propose a new model of small-world networks of cells with a time-varying coupling and study its synchronization properties. In each time interval of length /spl tau/ such a coupling is switched on with probability p and the corresponding switching rando ...

2005

Time-dependent strength of colloidal gels

Suliana Manley

Colloidal silica gels are shown to stiffen with time, as demonstrated by both dynamic light scattering and bulk rheological measurements. Their elastic moduli increase as a power law with time, independent of particle volume fraction; however, static light ...

2005

A Lower Bound for Broadcasting in Mobile Ad Hoc Networks

André Schiper, David Cavin, Yoav Sasson

We give a lower bound of

\Omega(n)

rounds for broadcasting in a mobile ad hoc network, where

n

is the number of nodes in the network. A round is the time taken by a node to successfully transmit a message to all its neighbors. It has been shown by Brus ...

2004