2011Unpublished venueRequires access

An approach to use query-related web context on document ranking

Donjung Choi, Taeyeon Kim, Moohong Min, Jee-Hyong Lee

Open publisher page 2 citations

Abstract

With the development of Web search engines, it is considered as an important task to provide retrieved documents in a proper manner. Many search engines have used various document ranking algorithms to provide their retrieved documents in a more efficient way for users. However, even though a good algorithm is used, there are some limitations if they do not consider the characteristic of queries which is diverse depending on user intention or interest. Even if a user searches documents with the same query, he/she may want a different result depending on when he/she queries into a search engine. How can a search engine judge what way is more efficient to provide retrieved results? We suggest a simple and novel way which employs query-related Web context to answer this question. With the distribution of query-related tweets and news articles, we classify whether a query would be considered as a hot query or a cold query. And then, we extract major topic terms from the hot time slice if a query is classified as a hot query, or extract refined contents if a query is classified as a cold query. Finally, all retrieved results are re-ranked by reflecting these topic terms or refined contents according to the characteristic of the query. To show the meaningfulness of our approach, we compare our re-ranked results with original retrieved results from the commercial search engine.

About this research paper

What this paper is about

With the development of Web search engines, it is considered as an important task to provide retrieved documents in a proper manner. Many search engines have used various document ranking algorithms to provide their retrieved documents in a more efficient way for users. However, even though a good algorithm is used, there are some limitations if they do not consider the characteristic of queries which is diverse depending on user intention or interest. Even if a user searches documents with the same query, he/she may want a different result depending on when he/she queries into a search engine. How can a search engine judge what way is more efficient to provide retrieved results? We suggest a simple and novel way which employs query-related Web context to answer this question. With the distribution of query-related tweets and news articles, we classify whether a query would be considered as a hot query or a cold query. And then, we extract major topic terms from the hot time slice if a query is classified as a hot query, or extract refined contents if a query is classified as a cold query. Finally, all retrieved results are re-ranked by reflecting these topic terms or refined contents according to the characteristic of the query. To show the meaningfulness of our approach, we compare our re-ranked results with original retrieved results from the commercial search engine.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

With the development of Web search engines, it is considered as an important task to provide retrieved documents in a proper manner. Many search engines have used various document ranking algorithms to provide their retrieved documents in a more efficient way for users. However, even though a good algorithm is used, there are some limitations if they do not consider the characteristic of queries which is diverse depending on user intention or interest. Even if a user searches documents with the same query, he/she may want a different result depending on when he/she queries into a search engine. How can a search engine judge what way is more efficient to provide retrieved results? We suggest a simple and novel way which employs query-related Web context to answer this question. With the distribution of query-related tweets and news articles, we classify whether a query would be considered as a hot query or a cold query. And then, we extract major topic terms from the hot time slice if a query is classified as a hot query, or extract refined contents if a query is classified as a cold query. Finally, all retrieved results are re-ranked by reflecting these topic terms or refined contents according to the characteristic of the query. To show the meaningfulness of our approach, we compare our re-ranked results with original retrieved results from the commercial search engine.

Key concepts: Web query classification, Computer science, Web search query, Information retrieval, Query expansion, Ranking (information retrieval), Query optimization, Sargable

Related papers

Back to paper searchBrowse research topicsOriginal source
An approach to use query-related web context on document ranking — Research Paper | ScholarLens