Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

B. Uygar Oztekin

dblp:02/5187 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2002
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval › distributed information retrieval
metasearch
0.012002
Expert agreement and content based reranking in a meta search environment using Mearf · WWW 2002
Information retrieval › distributed information retrieval
result merging
0.012002
Expert agreement and content based reranking in a meta search environment using Mearf · WWW 2002
Information retrieval › interactive information retrieval
search result examination
0.012002
Expert agreement and content based reranking in a meta search environment using Mearf · WWW 2002

Methods — techniques the papers use, named apart from their topics

snippet content analysis · 0.0
YearPublicationVenuePosition
2002 Expert agreement and content based reranking in a meta search environment using Mearf
abstract
Recent increase in the number of search engines on the Web and the availability of meta search engines that can query multiple search engines makes it important to find effective methods for combining results coming from different sources. In this paper we introduce novel methods for reranking in a meta search environment based on expert agreement and contents of the snippets. We also introduce an objective way of evaluating different methods for ranking search results that is based upon implicit user judgements. We incorporated our methods and two variations of commonly used merging methods in our meta search engine, Mearf, and carried out an experimental study using logs accumulated over a period of twelve months. Our experiments show that the choice of the method used for merging the output produced by different search engines plays a significant role in the overall quality of the search results. In almost all cases examined, results produced by some of the new methods introduced were consistently better than the ones produced by traditional methods commonly used in various meta search engines. These observations suggest that the proposed methods can offer a relatively inexpensive way of improving the meta search experience over existing methods.
B. Uygar Oztekin, George Karypis, Vipin Kumar 0001
WWW1