Optimizing search engines results using linear programming

When a query is passed to multiple search engines, each search engine returns a ranked list of documents. Researchers have demonstrated that combining results, in the form of a ''metasearch engine'', produces a significant improvement in coverage and search effectiveness. This paper proposes a linear programming mathematical model for optimizing the ranked list result of a given group of Web search engines for an issued query. An application with a numerical illustration shows the advantages of the proposed method.

[1]  Ali Emrouznejad,et al.  Improving minimax disparity model to determine the OWA operator weights , 2010, Inf. Sci..

[2]  Caro Lucas,et al.  Aggregation of web search engines based on users' preferences in WebFusion , 2007, Knowl. Based Syst..

[3]  Zheng Bao,et al.  Large Margin Feature Weighting Method via Linear Programming , 2009, IEEE Transactions on Knowledge and Data Engineering.

[4]  Vijay V. Raghavan,et al.  A Comprehensive OWA-Based Framework for Result Merging in Metasearch , 2005, RSFDGrC.

[5]  Shlomo Moran,et al.  Optimizing result prefetching in web search engines with segmented indices , 2002, TOIT.

[6]  Hanif D. Sherali,et al.  Linear Programming and Network Flows , 1977 .

[7]  Nuno C. Martins,et al.  A Linear Programming Approach to Parameter Fitting for the Master Equation , 2009, IEEE Transactions on Automatic Control.

[8]  King-Lup Liu,et al.  Building efficient and effective metasearch engines , 2002, CSUR.

[9]  Judit Bar-Ilan,et al.  Methods for comparing rankings of search engine results , 2005, Comput. Networks.

[10]  Gunnar Rätsch,et al.  Image reconstruction by linear programming , 2003, IEEE Transactions on Image Processing.

[11]  Anselm Spoerri,et al.  Examining the Authority and Ranking Effects as the result list depth used in data fusion is varied , 2007, Inf. Process. Manag..

[12]  Robert J. Vanderbei,et al.  Linear Programming: Foundations and Extensions , 1998, Kluwer international series in operations research and management service.

[13]  Abbe Mowshowitz,et al.  Measuring search engine bias , 2005, Inf. Process. Manag..

[14]  David Burshtein.  Iterative approximate linear programming decoding of LDPC codes with linear complexity , 2009, IEEE Trans. Inf. Theory.

[15]  Vijay V. Raghavan,et al.  A Fuzzy Search Engine Weighted Approach to Result Merging for Metasearch , 2007, RSFDGrC.

[16]  Amanda Spink,et al.  How are we searching the World Wide Web? A comparison of nine search engine transaction logs , 2006, Inf. Process. Manag..

[17]  Dirk Lewandowski,et al.  What Users See - Structures in Search Engine Results Pages , 2009, Inf. Sci..

[18]  Liwen Vaughan,et al.  New measurements for search engine evaluation proposed and tested , 2004, Inf. Process. Manag..

[19]  Amanda Spink,et al.  A study of results overlap and uniqueness among major Web search engines , 2006, Inf. Process. Manag..

[20]  Ali Emrouznejad,et al.  MP-OWA: The most preferred OWA operator , 2008, Knowl. Based Syst..