Graph-based keyword expansion
US8290975B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Mar 12, 2008 |
| Grant date | Oct 16, 2012 |
| Priority date | — |
| Expiry date | Dec 14, 2029 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/3322
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A keyword may be expanded into related words, such as for use in information retrieval. The terms comprising words and/or phrases of a large number of documents (e.g., web pages) are processed into a graph data structure, in which the terms are represented as nodes and edges represent the relationships between the nodes, with weights for each edge representing the relevance of the relationship. The graph may be built by selecting each term of a document and considering the terms within a certain number of words to be associated with the selected term; for each such association the weight indicative of the relevance is increased. When the graph is accessed with a keyword, the edges from that keyword's node and their respective weights indicate which other nodes are most relevant to the keyword, thereby providing the corresponding expanded terms.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.