Name
Abstract | ||
|---|---|---|
For a given set of search engines, a search engine is redundant if its searchable contents can be found from other search engines in this set. In this paper, we propose a method to identify redundant search engines in a very large-scale metasearch engine context. The general problem is equivalent to an NP hard problem -- the set-covering problem. Due to the large number of search engines that need to be considered and the large sizes of these search engines, approximate solutions must be developed. In this paper, we propose a general methodology to tackle this problem and within the context of this methodology, we propose several new heuristic algorithms for solving the set-covering problem. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1145/1183550.1183562 | WIDM |
Keywords | Field | DocType |
set-covering problem,large scale metasearch engine,approximate solution,general problem,np hard problem,redundant search engine,large number,general methodology,large size,large-scale metasearch engine context,search engine,heuristic algorithm,set covering problem | Set cover problem,Data mining,Heuristic,Metasearch engine,Incremental heuristic search,Search engine,Information retrieval,Computer science,Beam search,Theoretical computer science,Best-first search | Conference |
ISBN | Citations | PageRank |
1-59593-525-8 | 3 | 0.69 |
References | Authors | |
11 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ronak Desai | 1 | 11 | 1.29 |
| Qi Yang | 2 | 3 | 0.69 |
| Zonghuan Wu | 3 | 492 | 27.08 |
| Weiyi Meng | 4 | 2722 | 514.77 |
| Clement Yu | 5 | 3 | 0.69 |