Query expansion and query-document matching using path-constrained random walks
US9286396B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Jul 26, 2013 |
| Grant date | Mar 15, 2016 |
| Priority date | — |
| Expiry date | Oct 11, 2033 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/9538
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Various technologies described herein pertain to use of path-constrained random walks for query expansion and/or query document matching. Clickthrough data from search logs is represented as a labeled and directed graph. Path-constrained random walks are executed over the graph based upon an input query. The graph includes a first set of nodes that represent queries included in the clickthrough data from search logs, a second set of nodes that represent documents included in the clickthrough data from the search logs, a third set of nodes that represent words from the queries and the documents, and edges between nodes that represent relationships between queries, documents, and words. The path-constrained random walks include traversals over edges of the graph between nodes. Further, a score for a relationship between a target node and a source node representative of the input query is computed based at least in part upon the path-constrained random walks.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.