Skip to main content
SpringerLink
Log in

Finding relevant search engines results: a minimax linear programming approach

  • Theoretical Paper
  • Published:
Journal of the Operational Research Society

Abstract

For a submitted query to multiple search engines finding relevant results is an important task. This paper formulates the problem of aggregation and ranking of multiple search engines results in the form of a minimax linear programming model. Besides the novel application, this study detects the most relevant information among a return set of ranked lists of documents retrieved by distinct search engines. Furthermore, two numerical examples aree used to illustrate the usefulness of the proposed approach.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Amin GR and Emrouznejad A ( 2006 ). An extended minimax disparity to determine the OWA operator weights . Comput Ind Eng 50 : 312 – 316 .

    Article  Google Scholar 

  • Bazaraa M, Jarvis JJ and Sherali H ( 2005 ). Linear Programming and Network Flows, 3rd ed . John Wiley & Sons: USA .

    Google Scholar 

  • Candes EJ and Tao T ( 2005 ). Decoding by linear programming . IEEE T Inform Theory 51 : 4203 – 4215 .

    Article  Google Scholar 

  • Chignell MH, Gwizdka J and Bodner RC ( 1999 ). Discriminating metasearch: A framework for evaluation . Inform Process Manag 35 : 337 – 362 .

    Article  Google Scholar 

  • Diaz ED, De A and Raghavan V ( 2005 ). A comprehensive OWA-based framework for result merging in metasearch . Lect Notes Comput Sc 3642 : 193 – 201 .

    Article  Google Scholar 

  • Dreilinger D and Howe AE ( 1997 ). Experiences with selecting search engines using metasearch . ACM T Inform Syst 15 : 195 – 222 .

    Article  Google Scholar 

  • Emrouznejad A ( 2008 ). MP-OWA: The most preferred OWA operator . Knowl-Based Syst 21 : 847 – 851 .

    Article  Google Scholar 

  • Gordon M and Pathak P ( 1999 ). Finding information on the World Wide Web: The retrieval effectiveness of search engines . Inform Process Manag 35 : 141 – 180 .

    Article  Google Scholar 

  • Hawking D and Thistlewaite P ( 1999 ). Methods for information server selection . ACM T Inform Syst 17 : 40 – 76 .

    Article  Google Scholar 

  • Herrera-Viedma E, López Gijón J, Alonso S, Vílchez J, García C, Villén L and López-Herrera G ( 2008 ). Applying aggregation operators for information access systems: An application in digital libraries . Int J Intell Syst 23 : 1235 – 1250 .

    Article  Google Scholar 

  • Keyhanipour AH, Moshiri B, Kazemian M, Piroozmand M and Lucas C ( 2007 ). Aggregation of web search engines based on users' preferences in WebFusion . Knowl-Based Syst 20 : 321 – 328 .

    Article  Google Scholar 

  • Kuo CF, Yang TW and Kuo TW ( 2006 ). Dynamic load balancing for multiple processors . IEEE International Conference on Embedded and Real-Time Computing Systems and Applications . IEEE: Washington DC, pp 395–401 .

  • Meng W, Yu C and Liu KL ( 2002 ). Building efficient and effective metasearch engines . ACM Comput Surv 34 : 48 – 89 .

    Article  Google Scholar 

  • Rau NS ( 2003 ). Optimization Principles: Practical Applications to the Operation and Markets of the Electric Power Industry . John Wiley and IEEE Press: USA .

    Book  Google Scholar 

  • Selberg E and Etzioni O ( 1997 ). The MetaCrawler architecture for resource aggregation on the web . IEEE Expert 12 : 8 – 14 .

    Article  Google Scholar 

  • Sugiura A and Etzioni O ( 2000 ). Query routing for web search engines: Architecture and experiments . In: Proceedings of the Ninth World Wide Web Conference . Computer Networks 33 : 417–429 .

  • Tsuda K and Rätsch G ( 2005 ). Image reconstruction by linear programming . IEEE T Image Process 14 : 737 – 744 .

    Article  Google Scholar 

  • Wu Z, Meng W, Yu C and Li Z ( 2001 ). Towards a highly-scalable and effective metasearch engine . In : Shen VY, Saito N, Lyu MR and Zurko ME ( eds ). Proceedings of the Tenth World Wide Web Conference . ACM: New York, pp 386–395 .

Download references

Acknowledgements

The authors are extremely grateful to three anonymous referees and the editor of JORS for their constructive comments and suggestions that have been very useful in improving the presented paper.

Author information

Authors and Affiliations

  1. Islamic Azad University of South Tehran Branch, Tehran, Iran

    G R Amin

  2. Aston University, Birmingham, UK

    A Emrouznejad

Authors
  1. G R Amin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A Emrouznejad
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Amin, G., Emrouznejad, A. Finding relevant search engines results: a minimax linear programming approach. J Oper Res Soc 61, 1144–1150 (2010). https://doi.org/10.1057/jors.2009.53

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/jors.2009.53

Keywords

Search

Navigation