A Reranking Method Using Query Expansion and PageRank Check


The KIPS Transactions:PartB , Vol. 18, No. 4, pp. 231-240, Aug. 2011
10.3745/KIPSTB.2011.18.4.231,   PDF Download:

Abstract

Many search algorithms have been implemented by many researchers on the world wide web. One of the best algorithms is Google using PageRank technology. PageRank approach computes the number of inlink of each documents then ranks documents in the order of inlink members. But it is difficult to find the results that user needs, because this method find documents not valueable for a person but valueable for the public. To solve this problem, We use the WordNet for analysis of the user`s query history. This paper proposes a personalized search engine using the user`s query history and PageRank Check. We compared the performance of the proposed approaches with google search results in the top 30. As a result, the average of the r-precision for the proposed approaches is about 60% and it is better as about 14%.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
T. H. Kim, H. C. Jeon, J. M. Choi, "A Reranking Method Using Query Expansion and PageRank Check," The KIPS Transactions:PartB , vol. 18, no. 4, pp. 231-240, 2011. DOI: 10.3745/KIPSTB.2011.18.4.231.

[ACM Style]
Tae Hwan Kim, Ho Chul Jeon, and Joong Min Choi. 2011. A Reranking Method Using Query Expansion and PageRank Check. The KIPS Transactions:PartB , 18, 4, (2011), 231-240. DOI: 10.3745/KIPSTB.2011.18.4.231.