Tuesday, July 16, 2013

Language Models for Keyword Search over Data Graphs. Yosi Mass, Yehoshua Sagiv. WSDM 2012
  • Problem
    • given a keyword query, find entities in a graph of entities
      • the graph is probably derived from a database; and it is presumed that the user will find SQL difficult to use.
      • examples of such databases include Wikipedia, IMDB, and Mondial.

Tuesday, July 9, 2013

Characterizing the Influence of Domain Expertise on Web Search Behavior. Ryen W. White, Susan T. Dumais, Jaime Teevan. WSDM 2009
  •  Look up
    • maximum-margin averaged perceptron (Collins, M. Discriminative training methods for hidden markov models: Theory and experiments with perceptron algorithms. EMNLP 2002) 
Disorder Inequality: A Combinatorial Approach to Nearest Neighbor Search. Navin Goyal, Yury Lifshits, Hinrich Schütze. WSDM 2008
  • Ideas
    • "combinatorial" setting: only comparisons between similarity scores allowed.
    • two randomized algorithms for nearest-neighbor search, requiring O(n^2) and O(nlogn) space for preprocessed data