Previous research investigated how to leverage the new type of social data available on the
web, eg, tags, ratings and reviews, in recommending and personalizing information …

Internet users are shifting from searching on traditional media to social network platforms
(SNPs) to retrieve up-to-date and valuable information. SNPs have two unique …

We propose an indexing scheme for top-k shortest-path distance queries on graphs, which
is useful in a wide range of important applications such as network-aware search and link …

The distance between vertices is one of the most fundamental measures for representing
relations between them, and it is the basis of other classic measures of vertices, such as …

Answering exact shortest path distance queries is a fundamental task in graph theory.
Despite a tremendous amount of research on the subject, there is still no satisfactory …

The constantly growing amount of Web content and the success of the Social Web lead to
increasing needs for Web archiving. These needs go beyond the pure preservation of Web …

As the number of scientific papers getting published is likely to soar, most of modern paper
management systems (eg ScienceWise, Mendeley, CiteULike) support tag-based retrieval …

The all-distances sketch (ADS) has recently emerged as a promising paradigm of graph
neighborhood sketching. An ADS is a probabilistic data structure that is defined for each …

With the rapid growth of social tagging systems, many research efforts are being put into
personalized search and recommendation using social tags (ie, folksonomies). As users can …

We demonstrate the Taagle system for top-k retrieval in social tagging systems (also known
as folksonomies). The general setting is the following: users form a weighted social network …