scispace - formally typeset
Search or ask a question
Topic

Ranking (information retrieval)

About: Ranking (information retrieval) is a research topic. Over the lifetime, 21109 publications have been published within this topic receiving 435130 citations.


Papers
More filters
Proceedings ArticleDOI
26 Oct 2008
TL;DR: This paper proposes a more general framework for handling time-sensitive queries and automatically identifies the important time intervals that are likely to be of interest for a query and builds scoring techniques that seamlessly integrate the temporal aspect into the overall ranking mechanism.
Abstract: Time is an important dimension of relevance for a large number of searches, such as over blogs and news archives. So far, research on searching over such collections has largely focused on locating topically similar documents for a query. Unfortunately, topic similarity alone is not always sufficient for document ranking. In this paper, we observe that, for an important class of queries that we call time-sensitive queries, the publication time of the documents in a news archive is important and should be considered in conjunction with the topic similarity to derive the final document ranking. Earlier work has focused on improving retrieval for "recency" queries that target recent documents. We propose a more general framework for handling time-sensitive queries and we automatically identify the important time intervals that are likely to be of interest for a query. Then, we build scoring techniques that seamlessly integrate the temporal aspect into the overall ranking mechanism. We extensively evaluated our techniques using a variety of news article data sets, including TREC data as well as real web data analyzed using the Amazon Mechanical Turk. We examined several alternatives for detecting the important time intervals for a query over a news archive and for incorporating this information in the retrieval process. Our techniques are robust and significantly improve result quality for time-sensitive queries compared to state-of-the-art retrieval techniques.

99 citations

Patent
Feng Jing1, Lei Zhang1, Wei-Ying Ma1
25 Jan 2006
TL;DR: In this paper, a method and system for ranking content and providing a user interface for viewing the content is provided, which ranks content in a search result based on a combination of relevance of the content to a query and quality of the contents.
Abstract: A method and system for ranking content and providing a user interface for viewing the content is provided. The content system ranks content in a search result based on a combination of relevance of the content to a query and quality of the content. The content system may derive the quality of content by analyzing ratings provided by various content forums. The content system may use metadata provided by a content forum when searching for content that matches a query. The content system generates a rank score that combines the relevance and quality of the content and ranks the content according to the rank scores.

99 citations

Patent
29 Jul 2011
TL;DR: In this article, a machine learning model is used for ranking news feed stories presented to users of a social networking system, where the social network system divides its users into different sets based on demographic characteristics of the users and generates one model for each set of users.
Abstract: Machine learning models are used for ranking news feed stories presented to users of a social networking system. The social networking system divides its users into different sets, for example, based on demographic characteristics of the users and generates one model for each set of users. The models are periodically retrained. The news feed ranking model may rank news feeds for a user based on information describing other users connected to the user in the social networking system. Information describing other users connected to the user includes interactions of the other users with objects associated with news feed stories. These interactions include commenting on a news feed story, liking a news feed story, or retrieving information, for example, images, videos associated with a news feed story.

99 citations

Journal ArticleDOI
TL;DR: This work presents an analysis of different methods for classifying Web services for possible composition and supply a context-based semantic matching method for ranking these possibilities and indicates that context analysis is more useful than TF/IDF.
Abstract: In this work, we propose a two-step, context-based semantic approach to the problem of matching and ranking Web services for possible service composition. We present an analysis of different methods for classifying Web services for possible composition and supply a context-based semantic matching method for ranking these possibilities. Semantic understanding of Web services may provide added value by identifying new possibilities for compositions of services. The semantic matching ranking approach is unique since it provides the Web service designer with an explicit numeric estimation of the extent to which a possible composition ldquomakes sense.rdquo First, we analyze two common methods for text processing, TF/IDF and context analysis; and two types of service description, free text and WSDL. Second, we present a method for evaluating the proximity of services for possible compositions. Each Web service WSDL context descriptor is evaluated according to its proximity to other services' free text context descriptors. The methods were tested on a large repository of real-world Web services. The experimental results indicate that context analysis is more useful than TF/IDF. Furthermore, the method evaluating the proximity of the WSDL description to the textual description of other services provides high recall and precision results.

99 citations

Proceedings ArticleDOI
07 Dec 2015
TL;DR: This paper introduces an unsupervised ranking optimization approach based on discriminant context information analysis that refines a given initial ranking by removing the visual ambiguities common to first ranks.
Abstract: Person re-identification is an open and challenging problem in computer vision. Existing re-identification approaches focus on optimal methods for features matching (e.g., metric learning approaches) or study the inter-camera transformations of such features. These methods hardly ever pay attention to the problem of visual ambiguities shared between the first ranks. In this paper, we focus on such a problem and introduce an unsupervised ranking optimization approach based on discriminant context information analysis. The proposed approach refines a given initial ranking by removing the visual ambiguities common to first ranks. This is achieved by analyzing their content and context information. Extensive experiments on three publicly available benchmark datasets and different baseline methods have been conducted. Results demonstrate a remarkable improvement in the first positions of the ranking. Regardless of the selected dataset, state-of-the-art methods are strongly outperformed by our method.

99 citations


Network Information
Related Topics (5)
Web page
50.3K papers, 975.1K citations
83% related
Ontology (information science)
57K papers, 869.1K citations
82% related
Graph (abstract data type)
69.9K papers, 1.2M citations
82% related
Feature learning
15.5K papers, 684.7K citations
81% related
Supervised learning
20.8K papers, 710.5K citations
81% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20241
20233,112
20226,541
20211,105
20201,082
20191,168