Search

Eldar Sadikov Phones & Addresses

  • Menlo Park, CA
  • Stanford, CA
  • Roxbury Crossing, MA
  • San Jose, CA
  • San Mateo, CA
  • Sunnyvale, CA

Publications

Us Patents

Generating Domain-Based Training Data For Tail Queries

View page
US Patent:
20120271806, Oct 25, 2012
Filed:
Apr 21, 2011
Appl. No.:
13/091145
Inventors:
Samuel Ieong - Mountain View CA, US
Nina Mishra - Pleasanton CA, US
Eldar Sadikov - Menlo Park CA, US
Li Zhang - Sunnyvale CA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 17/30
US Classification:
707706, 707E17108
Abstract:
Training data is provided for tail queries based on a phenomena in search engine user behavior—referred to herein as “domain trust”—as an indication of user preferences for individual URLs in search results returned by a search engine for tail queries. Also disclosed are methods for generating training data in a search engine by forming a collection of query+URL pairs, identifying domains in the collection, and labeling each domain. Other implementations are directed ranking search results generated by a search engine by measuring domain trust for each domain corresponding to each URL from among a plurality of URLs and then ranking each URL by its measured domain trust.

Clustering Query Refinements By Inferred User Intent

View page
US Patent:
8423538, Apr 16, 2013
Filed:
Nov 2, 2010
Appl. No.:
12/938205
Inventors:
Eldar Sadikov - Menlo Park CA, US
Jayant Madhavan - San Francisco CA, US
Alon Halevy - Los Altos CA, US
Assignee:
Google Inc. - Mountain View CA
International Classification:
G06F 7/00
G06F 17/00
US Classification:
707722, 707706, 707713
Abstract:
Methods, systems, and apparatus, including computer programs encoded on computer storage media, for clustering query refinements. One method includes building a representation of a graph for a first query, wherein the graph has a node for the first query, a node for each of a plurality of refinements for the first query, and a node for each document in the document sets of the refinements, and wherein the graph has edges from the first query node to each of the refinement nodes, edges from the first query to each document in the respective document set of the first query, edges from each refinement to each document in the respective document set of the refinement, and edges from each refinement to each co-occurring query of the refinement. The method further includes clustering the refinements into refinement clusters by partitioning the refinement nodes in the graph into proper subsets.
Eldar A Sadikov from Menlo Park, CA, age ~64 Get Report