Search result diversification ordering method based on hierarchical structure subtopic
A sorting method and technology of search results, applied in the direction of network data retrieval, network data indexing, and other database retrieval, etc., can solve the problems of difficult sub-topics and difficult matching of user intentions
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0047] The present application will be further described below in conjunction with the accompanying drawings and specific embodiments.
[0048] Define the expressions and related concepts of hierarchical subtopics:
[0049] For a given query q, we use R = {d 1 , d 2 ,...,d m} represents the initial set of documents that have not yet been diversified, with T q ={t 1 ,t 2 ,...,t n} represents the set of n subtopics related to the query. Given P(d|q) represents the probability that document d is related to query q, P(d|t) represents the probability that document d is related to subtopic t, and P(t|q) represents the importance of subtopic t in query q degree. At present, most of the diversification algorithms based on subtopics use T q , P(d|q), P(d|t), P(t|q) reorder the initial document R, and obtain a diversified result document, denoted as D. In the hierarchical diversification model, due to the introduction of multi-layer subtopics, the present invention needs to rede...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 