This paper describes our participation in the NIST 2008 MetricsMATR Challenge, using our recently proposed automatic machine translation evaluation metric MAXSIM. The metric calculates a similarity score between a pair of English system-reference sentences by comparing information items such as ngrams across the sentence pair. Unlike most metrics, MAXSIM computes a similarity score between item...

Kernel function k1 ▸ fix two objects xa and xb for which we want to compute similarity score ▸ assume we have answers to all comparisons d(xa, xj) ? < d(xa, xk) and d(xb, xj) ? < d(xb, xk), xj, xk ∈ D ▸ can rank objects in D with respect to their dissimilarity to xa and also with respect to their dissimilarity to xb ▸ computing Kendall’s τ between the two rankings as similarity score between xa...

This paper describes our submissions to the MIREX 2011 audio music similarity and retrieval task. The proposed method is based on a machine learning technique – sparse coding (SC). The music similarity is not directly obtained from computed distance measures on audio contents, instead, we predict a higher level similarity scores to match the listener’s subjective perceptions based on these dist...

multiple people detection and tracking is a challenging task in real-world crowded scenes. in this paper, we have presented an online multiple people tracking-by-detection approach with a single camera. we have detected objects with deformable part models and a visual background extractor. in the tracking phase we have used a combination of support vector machine (svm) person-specific classifie...

The article presents experiments on mining Wikipedia for extracting SMT useful sentence pairs in three language pairs. Each extracted sentence pair is associated with a cross-lingual lexical similarity score based on which, several evaluations have been conducted to estimate the similarity thresholds which allow the extraction of the most useful data for training three-language pairs SMT system...

Abstract Some real-world problems revolve to solve the optimization problem maxx∈X f (x) where f (.) is a black-box function and X might be the set of non-vectorial objects (e.g., distributions) where we can only define a symmetric and non-negative similarity score on it. This setting requires a novel view for the standard framework of Bayesian Optimization that generalizes the core insightful ...

MOTIVATION Accurate comparisons of different protein structures play important roles in structural biology, structure prediction and functional annotation. The root-mean-square-deviation (RMSD) after optimal superposition is the predominant measure of similarity due to the ease and speed of computation. However, global RMSD is dependent on the length of the protein and can be dominated by diver...

We propose a generalization of SimRank similarity measure for heterogeneous information networks. Given the information network, the intraclass similarity score s(a, b) is high if the set of objects that are related with a and the set of objects that are related with b are pair-wise similar according to all imposed relations.

In this paper we propose a new biometric-based Iris feature extraction system. The system automatically acquires the biometric data in numerical format (Iris Images) by using a set of properly located sensors. We are considering camera as a high quality sensor. Iris Images are typically color images that are processed to gray scale images. Then the Feature extraction algorithm is used to detect...