S
Sihem Amer-Yahia
Researcher at University of Grenoble
Publications - 251
Citations - 6273
Sihem Amer-Yahia is an academic researcher from University of Grenoble. The author has contributed to research in topics: Computer science & XML. The author has an hindex of 39, co-authored 217 publications receiving 5812 citations. Previous affiliations of Sihem Amer-Yahia include Centre national de la recherche scientifique & Yahoo!.
Papers
More filters
Journal ArticleDOI
Group recommendation: semantics and efficiency
TL;DR: In this article, a formal semantics that accounts for both item relevance to a group and disagreements among group members is proposed for group recommendation and evaluated on MovieLens data set with 10M ratings.
Proceedings ArticleDOI
Automatic construction of travel itineraries using social breadcrumbs
TL;DR: 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.
Proceedings Article
Proceedings of the 17th ACM conference on Information and knowledge management
James G. Shanahan,Sihem Amer-Yahia,Ioana Manolescu,Yi Zhang,David A. Evans,Alek Kolcz,Key-Sun Choi,Abdur Chowdury +7 more
TL;DR: The composition of a query plan for a group-by skyline query is examined and the missing cost model for the BBS algorithm is developed and Experimental results show that the techniques are able to devise the best query plans for a variety of group- by skyline queries.
Proceedings ArticleDOI
Minimization of tree pattern queries
TL;DR: 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.
Proceedings ArticleDOI
FleXPath: flexible structure and full-text querying for XML
TL;DR: 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.