Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

A Dynamic Feature Selection Method for Document Ranking with Relevance Feedback Approach


Affiliations
1 Department of Computer Science and Engineering, Anna University of Technology, Tiruchirappalli, Tamil Nadu, India
2 Department of Information Technology, Thiagarajar College of Engineering, Madurai, Tamil Nadu, India
     

   Subscribe/Renew Journal


Ranking search results is essential for information retrieval and Web search. Search engines need to not only return highly relevant results, but also be fast to satisfy users. As a result, not all available features can be used for ranking, and in fact only a small percentage of these features can be used. Thus, it is crucial to have a feature selection mechanism that can find a subset of features that both meets latency requirements and achieves high relevance. In this paper we describe a 0/1 knapsack procedure for automatically selecting features to use within Generalization model for Document Ranking. We propose an approach for Relevance Feedback using Expectation Maximization method and evaluate the algorithm on the TREC Collection for describing classes of feedback textual information retrieval features. Experimental results, evaluated on standard TREC-9 part of the OHSUMED collections, show that our feature selection algorithm produces models that are either significantly more effective than, or equally effective as, models such as Markov Random Field model, Correlation Co-efficient and Count Difference method.

Keywords

Feature Selection, Expectation Maximization, Markov Random Field, Generalization, Document Ranking.
Subscription Login to verify subscription
User
Notifications
Font Size

Abstract Views: 341

PDF Views: 0




  • A Dynamic Feature Selection Method for Document Ranking with Relevance Feedback Approach

Abstract Views: 341  |  PDF Views: 0

Authors

K. Latha
Department of Computer Science and Engineering, Anna University of Technology, Tiruchirappalli, Tamil Nadu, India
B. Bhargavi
Department of Computer Science and Engineering, Anna University of Technology, Tiruchirappalli, Tamil Nadu, India
C. Dharani
Department of Computer Science and Engineering, Anna University of Technology, Tiruchirappalli, Tamil Nadu, India
R. Rajaram
Department of Information Technology, Thiagarajar College of Engineering, Madurai, Tamil Nadu, India

Abstract


Ranking search results is essential for information retrieval and Web search. Search engines need to not only return highly relevant results, but also be fast to satisfy users. As a result, not all available features can be used for ranking, and in fact only a small percentage of these features can be used. Thus, it is crucial to have a feature selection mechanism that can find a subset of features that both meets latency requirements and achieves high relevance. In this paper we describe a 0/1 knapsack procedure for automatically selecting features to use within Generalization model for Document Ranking. We propose an approach for Relevance Feedback using Expectation Maximization method and evaluate the algorithm on the TREC Collection for describing classes of feedback textual information retrieval features. Experimental results, evaluated on standard TREC-9 part of the OHSUMED collections, show that our feature selection algorithm produces models that are either significantly more effective than, or equally effective as, models such as Markov Random Field model, Correlation Co-efficient and Count Difference method.

Keywords


Feature Selection, Expectation Maximization, Markov Random Field, Generalization, Document Ranking.