SemRank: ranking refinement strategy by using the semantic intensity

The ubiquity of the multimedia has raised a need for the system that can store, manage, structured the multimedia data in such a way that it can be retrieved intelligently. One of the current issues in media management or data mining research is ranking of retrieved documents. Ranking is one of the provocative problems for information retrieval systems. Given a user query comes up with the millions of relevant results but if the ranking function cannot rank it according to the relevancy than all results are just obsolete. However, the current ranking techniques are in the level of keyword matching. The ranking among the results is usually done by using the term frequency. This paper is concerned with ranking the document relying merely on the rich semantic inside the document instead of the contents. Our proposed ranking refinement strategy known as SemRank, rank the document based on the semantic intensity. Our approach has been applied on the open benchmark LabelMe dataset and compared against one of the well known ranking model i.e. Vector Space Model (VSM). The experimental results depicts that our approach has achieved significant improvement in retrieval performance over the state of the art ranking methods.

[1]  Tie-Yan Liu,et al.  Learning to rank: from pairwise approach to listwise approach , 2007, ICML '07.

[2]  Guido Zuccon,et al.  Using the Quantum Probability Ranking Principle to Rank Interdependent Documents , 2010, ECIR.

[3]  Tie-Yan Liu,et al.  Adapting ranking SVM to document retrieval , 2006, SIGIR.

[4]  Christian Viard-Gaudin,et al.  Ranking Fusion Methods Applied to On-Line Handwriting Information Retrieval , 2010, ECIR.

[5]  Craig MacDonald,et al.  Learning to Select a Ranking Function , 2010, ECIR.

[6]  Koby Crammer,et al.  Pranking with Ranking , 2001, NIPS.

[7]  Hang Li,et al.  AdaRank: a boosting algorithm for information retrieval , 2007, SIGIR.

[8]  Michael Collins,et al.  Maximum Margin Ranking Algorithms for Information Retrieval , 2010, ECIR.

[9]  Cynthia Rudin,et al.  Margin-based Ranking and an Equivalence between AdaBoost and RankBoost , 2009, J. Mach. Learn. Res..

[10]  Gerard Salton,et al.  A vector space model for automatic indexing , 1975, CACM.

[11]  Qiang Yang,et al.  Exploiting the hierarchical structure for link analysis , 2005, SIGIR '05.

[12]  Shumeet Baluja,et al.  Pagerank for product image search , 2008, WWW.

[13]  Tao Qin,et al.  FRank: a ranking method with fidelity loss , 2007, SIGIR.

[14]  Gregory N. Hullender,et al.  Learning to rank using gradient descent , 2005, ICML.

[15]  Yoram Singer,et al.  An Efficient Boosting Algorithm for Combining Preferences by , 2013 .

[16]  Brian D. Davison,et al.  Topical link analysis for web search , 2006, SIGIR.

[17]  Furu Wei,et al.  iRANK: an interactive ranking framework and its application in query-focused summarization , 2009, CIKM.