MetaSearch for Entry Page Finding Task


The KIPS Transactions:PartB , Vol. 12, No. 2, pp. 215-222, Apr. 2005
10.3745/KIPSTB.2005.12.2.215,   PDF Download:

Abstract

In this paper, a MetaSearch algorithm for navigational queries is presented. Previous MetaSearch algorithm focused on informational queries. They gave a high score to an overlapped document. However, the overemphasis of overlapped documents may degrade the performance of a MetaSearch algorithm for a navigational query. However, if a lot of result document are from a certain domain or a directory, then we can assume the importance of the domain or directory. Various experiments are conducted to show the effectiveness of overlap of a domain and directory names. System results from TREC and commercial search engines are used for experiments. From the results of experiments, the overlap of documents showed the better performance for informational queries. However, the overlap of domain names and directory names showed the 10% higher performance for navigational queries.


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]
I. H. Kang, "MetaSearch for Entry Page Finding Task," The KIPS Transactions:PartB , vol. 12, no. 2, pp. 215-222, 2005. DOI: 10.3745/KIPSTB.2005.12.2.215.

[ACM Style]
In Ho Kang. 2005. MetaSearch for Entry Page Finding Task. The KIPS Transactions:PartB , 12, 2, (2005), 215-222. DOI: 10.3745/KIPSTB.2005.12.2.215.