DeepAI AI Chat
Log In Sign Up

Exploration of Proximity Heuristics in Length Normalization

by   Pranav Agrawal, et al.

Ranking functions used in information retrieval are primarily used in the search engines and they are often adopted for various language processing applications. However, features used in the construction of ranking functions should be analyzed before applying it on a data set. This paper gives guidelines on construction of generalized ranking functions with application-dependent features. The paper prescribes a specific case of a generalized function for recommendation system using feature engineering guidelines on the given data set. The behavior of both generalized and specific functions are studied and implemented on the unstructured textual data. The proximity feature based ranking function has outperformed by 52 BM25.


page 1

page 2

page 3

page 4


On the Dual of Generalized Bent Functions

In this paper, we study the dual of generalized bent functions f: V_n→ℤ_...

Mathematical Construction of Interpolation and Extrapolation Function by Taylor Polynomials

In this present paper, I propose a derivation of unified interpolation a...

Ranking Functions for Vector Addition Systems

Vector addition systems are an important model in theoretical computer s...

Alignment Analysis of Sequential Segmentation of Lexicons to Improve Automatic Cognate Detection

Ranking functions in information retrieval are often used in search engi...

Generalized Polylogarithms in Maple

This paper describes generalized polylogarithms, multiple polylogarithms...

Deep architectures for learning context-dependent ranking functions

Object ranking is an important problem in the realm of preference learni...

RankDCG: Rank-Ordering Evaluation Measure

Ranking is used for a wide array of problems, most notably information r...