Finding relevant search engine results

a minimax linear programming approach

G.R. Amin, A. Emrouznejad

Research output: Contribution to journalArticle

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.
Original languageEnglish
Pages (from-to)1144-1150
Number of pages7
JournalJournal of the Operational Research Society
Volume61
Issue number7
Early online date20 May 2009
DOIs
Publication statusPublished - Jul 2010

Fingerprint

Search engines
Linear programming
Agglomeration
Search engine
Minimax

Keywords

  • linear programming
  • search engine
  • metasearch
  • relevancy index

Cite this

@article{dbb3793b38064e0abb1c9179a095b1af,
title = "Finding relevant search engine results: a minimax linear programming approach",
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.",
keywords = "linear programming, search engine, metasearch, relevancy index",
author = "G.R. Amin and A. Emrouznejad",
year = "2010",
month = "7",
doi = "10.1057/jors.2009.53",
language = "English",
volume = "61",
pages = "1144--1150",
journal = "Journal of the Operational Research Society",
issn = "0160-5682",
publisher = "Palgrave Macmillan Ltd.",
number = "7",

}

Finding relevant search engine results : a minimax linear programming approach. / Amin, G.R.; Emrouznejad, A.

In: Journal of the Operational Research Society, Vol. 61, No. 7, 07.2010, p. 1144-1150.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Finding relevant search engine results

T2 - a minimax linear programming approach

AU - Amin, G.R.

AU - Emrouznejad, A.

PY - 2010/7

Y1 - 2010/7

N2 - 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.

AB - 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.

KW - linear programming

KW - search engine

KW - metasearch

KW - relevancy index

UR - http://www.scopus.com/inward/record.url?scp=77953654166&partnerID=8YFLogxK

UR - http://www.palgrave-journals.com/jors/journal/v61/n7/abs/jors200953a.html

U2 - 10.1057/jors.2009.53

DO - 10.1057/jors.2009.53

M3 - Article

VL - 61

SP - 1144

EP - 1150

JO - Journal of the Operational Research Society

JF - Journal of the Operational Research Society

SN - 0160-5682

IS - 7

ER -