• Publications
  • Influence
Group Recommendation: Semantics and Efficiency
TLDR
This paper analyzes the desiderata of group recommendation and proposes a formal semantics that accounts for both item relevance to a group and disagreements among group members and designs and implements algorithms for efficiently computing group recommendations. Expand
Minimization of tree pattern queries
TLDR
A fast algorithm is presented, CDM, that identifies and eliminates local redundancies due to ICs, based on propagating “information labels” up the tree pattern, and shows the surprising result that the algorithm obtained by first augmenting the tree patterns using ICS, and then applying CIM, always finds the unique minimal equivalent query. Expand
Automatic construction of travel itineraries using social breadcrumbs
TLDR
It is indicated that high quality itineraries can be automatically constructed from Flickr data, by constructing intra-city travel itineraries automatically by tapping a latent source reflecting geo-temporal breadcrumbs left by millions of tourists. Expand
Tree Pattern Relaxation
TLDR
This paper studies the problem of approximate XML query matching, based on tree pattern relaxations, and devise efficient algorithms to evaluate relaxed tree patterns, and designs data pruning algorithms where intermediate query results are filtered dynamically during the evaluation process. Expand
FleXPath: flexible structure and full-text querying for XML
TLDR
This paper provides an elegant definition of relaxation on structure and defines primitive operators to span the space of relaxations for ranking schemes and proposes natural ranking schemes that adhere to these principles. Expand
Texquery: a full-text search extension to xquery
TLDR
TeXQuery provides a rich set of fully composable full-text search primitives, such as Boolean connectives, phrase matching, proximity distance, stemming and theauri, which enables users to seamlessly query over both structured and text data by embedding TeXQuery primitives in XQuery. Expand
Tree pattern query minimization
TLDR
A fast algorithm is presented, CDM, that identifies and eliminates local redundancies due to ICs, based on propagating ”information labels” up the tree pattern, which can be applied prior to ACIM for improving the minimization efficiency. Expand
Efficient network aware search in collaborative tagging sites
TLDR
This paper investigates efficient top-k processing when the score of an answer is computed as its popularity among members of a seeker's network, and develops algorithms based on maintaining score upper-bounds. Expand
It takes variety to make a world: diversification in recommender systems
TLDR
This paper develops efficient diversification algorithms built upon the notion of explanation-based diversity and demonstrates their efficiency and effectiveness in diversification on two real life data sets: del.icio.us and Yahoo! Movies. Expand
Structure and Content Scoring for XML
TLDR
This work proposes novel XML scoring methods that are inspired by tf*idf and that account for both structure and content while considering query relaxations and proposes efficient data structures in order to speed up ranked query processing. Expand
...
1
2
3
4
5
...