Automatic partitioning
US-12164512-B2 · Dec 10, 2024 · US
US2015248454A1 · US · A1
| Field | Value |
|---|---|
| Publication number | US-2015248454-A1 |
| Application number | US-201314430292-A |
| Country | US |
| Kind code | A1 |
| Filing date | Sep 12, 2013 |
| Priority date | Sep 28, 2012 |
| Publication date | Sep 3, 2015 |
| Grant date | — |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
[Problem] Since similarity of queries is determined on the basis of similarity of documents that are not related to a search intention, queries whose search intention is similar to each other cannot be determined. [Solution Means] A search result ranking means and a query similarity-degree calculating means are provided. The search result ranking means determines a first weight degree of each of a plurality of documents on the basis of respective evaluation results of the plurality of documents that have been retrieved by a first query, and determines a second weight degree of each of a plurality of documents on the basis of respective evaluation results of the plurality of documents that have been retrieved by a second query. The query similarity-degree calculating means calculates a similarity degree of two search results to which importance have been given, such that the similarity degree becomes larger as the documents of higher importance are similar to each other. Thereby, a similarity degree of documents in a case of the same search intention is calculated so that the problem can be solved.
Opening claim text (preview).
What is claimed is: 1 . A query similarity-degree evaluation system comprising: a search result ranking unit that determines a first weight degree of each of a plurality of documents on the basis of respective evaluation results of the plurality of documents that have been retrieved by a first query, and determining a second weight degree of each of a plurality of documents on the basis of respective evaluation results of the plurality of documents that have been retrieved by a second query; and a query similarity-degree calculation unit that calculates a similarity-degree of the queries on the basis of the first and second importance of the respective documents of the document sets. 2 . The query similarity-degree evaluation system according to claim 1 , wherein when evaluating a similarity degree of a plurality of queries including at least the first query and the second query, the search result ranking unit calculates importance of each document included in the document set concerned by comparing a current document set with an evaluation result of a past document set of the query, for each of the document sets of results obtained by the respective queries. 3 . The query similarity-degree evaluation system according to claim 1 , wherein the search result ranking unit specifies respective characteristic words for the high-evaluated document and the low-evaluated document, and the query similarity-degree calculation unit calculates a high weight degree for the document in which an appearance frequency of the characteristic word of the high-evaluated document is high, and calculates a low weight degree for the document in which an appearance frequency of the characteristic word of the low-evaluated document is high. 4 . The query similarity-degree evaluation system according to claim 1 , wherein The search result ranking unit refers to metadata given to the high-evaluated document and the low-evaluated document respectively, calculates a higher weight degree for the document having a value of metadata that is closer to a value of the metadata of the high-evaluated document, and calculates a lower weight degree for the document having the metadata that is closer to a value of metadata of the low-evaluated document. 5 . The query similarity-degree evaluation system according to claim 1 , wherein when a search result set 1 is S 1 , a search result set 2 is S 2 , importance (normalized such that the sum for documents in the search result set 1 becomes 1) of document d in the search result set 1 is w 1 (d), importance of the document d in the search result set 2 is w 2 (d), and a similarity degree between the document d 1 and the document d 2 is sim(d 1 , d 2 ), the query similarity-degree calculation unit uses algorithm: ∑ d 1 ∈ S 1 ∑ d 2 ∈ S 2 w 1 ( d 1 ) w 2 ( d 2 ) sim ( d 1 , d 2 ) , [ Equation 1 ] to calculate a query similarity degree. 6 . A query similarity-degree evaluation method comprising: ranking a search result by determining importance of each of a plurality of documents on the basis of respective evaluation results of the plurality of documents that have been retrieved by a first query, and by determining importance of each of a plurality of documents on the basis of respective evaluation results of the plurality of documents that have been retrieved by a second query; and calculating a query similarity degree by calculating a similarity-degree of the queries on the basis of first and second importance of the respective documents of the document sets. 7 . The query similarity-degree evaluation method according to claim 6 , wherein during the search result ranking, when evaluating a similarity degree of a plurality of queries including at least the first query and the second query, calculating importance of each document included in the document set concerned by comparing the current document set with an evaluation result of a past document set of the query, for each of the document sets of results obtained by the respective queries. 8 . The query similarity-degree evaluation method according to claim 6 , wherein during the search result ranking, specifying respective characteristic words for high-evaluated document and low-evaluated document, and calculating a high weight degree for the document in which an appearance frequency of the characteristic word of the high-evaluated document is high, and calculating a low weight degree for the document in which an appearance frequency of the characteristic word of the low-evaluated document is high. 9 . The query similarity-degree evaluation
Iterative querying; Query formulation based on the results of a preceding query · CPC title
Indexing; Web crawling techniques · CPC title
using ranking · CPC title
Physics · mapped topic
Physics · mapped topic
Related publications grouped by family.
Answers are generated from the same data shown on this page.