Sciweavers

720 search results - page 91 / 144
» Gossiping personalized queries
Sort
View
COLING
2010
14 years 6 months ago
Simple and Efficient Algorithm for Approximate Dictionary Matching
This paper presents a simple and efficient algorithm for approximate dictionary matching designed for similarity measures such as cosine, Dice, Jaccard, and overlap coefficients. ...
Naoaki Okazaki, Jun-ichi Tsujii
ECIR
2011
Springer
14 years 3 months ago
Learning Models for Ranking Aggregates
Aggregate ranking tasks are those where documents are not the final ranking outcome, but instead an intermediary component. For instance, in expert search, a ranking of candidate ...
Craig Macdonald, Iadh Ounis
WSDM
2012
ACM
309views Data Mining» more  WSDM 2012»
13 years 7 months ago
Mining contrastive opinions on political texts using cross-perspective topic model
This paper presents a novel opinion mining research problem, which is called Contrastive Opinion Modeling (COM). Given any query topic and a set of text collections from multiple ...
Yi Fang, Luo Si, Naveen Somasundaram, Zhengtao Yu
SIGMOD
2012
ACM
220views Database» more  SIGMOD 2012»
13 years 2 months ago
GUPT: privacy preserving data analysis made easy
It is often highly valuable for organizations to have their data analyzed by external agents. However, any program that computes on potentially sensitive data risks leaking inform...
Prashanth Mohan, Abhradeep Thakurta, Elaine Shi, D...
SIGIR
2012
ACM
13 years 2 months ago
An exploration of ranking heuristics in mobile local search
Users increasingly rely on their mobile devices to search local entities, typically businesses, while on the go. Even though recent work has recognized that the ranking signals in...
Yuanhua Lv, Dimitrios Lymberopoulos, Qiang Wu