Related papers: Distances Between Partial Preference Orderings
The Hausdorff distance is a relatively new measure of similarity of graphs. The notion of the Hausdorff distance considers a special kind of a common subgraph of the compared graphs and depends on the structural properties outside of the…
We introduce the Binary Matrix Guessing Problem and provide two algorithms to solve this problem. The first algorithm we introduce is Elementwise Probing Algorithm (EPA) which is very fast under a score which utilizes Frobenius Distance.…
This paper maps out the relation between different approaches for handling preferences in argumentation with strict rules and defeasible assumptions by offering translations between them. The systems we compare are: non-prioritized defeats…
Reduced ordering based vector filters have proved successful in removing long-tailed noise from color images while preserving edges and fine image details. These filters commonly utilize variants of the Minkowski distance to order the color…
Given two binary trees on $N$ labeled leaves, the quartet distance between the trees is the number of disagreeing quartets. By permuting the leaves at random, the expected quartets distance between the two trees is…
Explicit numerical methods based on Lax-Friedrichs and Leap-Frog finite difference approximations are constructed to find the numerical solution of the first-order hyperbolic partial differential equation with point-wise delay or advance,…
We consider a geometric rough path associated with a fractional Brownian motion with Hurst parameter $H\in]{1/4}, {1/2}[$. We give an approximation result in a modulus type distance, up to the second order, by means of a sequence of rough…
The statistical shape analysis called Procrustes analysis minimizes the distance between matrices by similarity transformations. The method returns a set of optimal orthogonal matrices, which project each matrix into a common space. This…
Factorization machines (FMs) are a powerful tool for regression and classification in the context of sparse observations, that has been successfully applied to collaborative filtering, especially when side information over users or items is…
Embedding data into vector spaces is a very popular strategy of pattern recognition methods. When distances between embeddings are quantized, performance metrics become ambiguous. In this paper, we present an analysis of the ambiguity…
In several multiobjective decision problems Pairwise Comparison Matrices (PCM) are applied to evaluate the decision variants. The problem that arises very often is the inconsistency of a given PCM. In such a situation it is important to…
Some fractional Newton methods have been proposed in order to find roots of nonlinear equations using fractional derivatives. In this paper we introduce a fractional Newton method with order $\alpha+1$ and compare with another fractional…
Proportional apportionment is the problem of assigning seats to parties according to their relative share of votes. Divisor methods are the de-facto standard solution, used in many countries. In recent literature, there are two algorithms…
Reasoning about distance is indispensable for establishing or avoiding contact in manipulation tasks. To this end, we present an online approach for learning implicit representations of signed distance using piecewise polynomial basis…
The Adomian decomposition method is a semi-analytical method for solving ordinary and partial nonlinear differential equations. The aim of this paper is to apply Adomian decomposition method to obtain approximate solutions of nonlinear…
We discuss two versions of the Fr\'echet distance problem in weighted planar subdivisions. In the first one, the distance between two points is the weighted length of the line segment joining the points. In the second one, the distance…
We present an algorithm to extract the distance list from atomic pair distribution functions (PDFs) in a highly automated way. The algorithm is constructed via curve fitting based on a Debye scattering equation model. Due to the non-convex…
We construct a monadic second-order sentence that characterizes the ternary relations that are the betweenness relations of finite or infinite partial orders. We prove that no first-order sentence can do that. We characterize the partial…
The issue of distinguishing between the same-source and different-source hypotheses based on various types of traces is a generic problem in forensic science. This problem is often tackled with Bayesian approaches, which are able to provide…
Approximations of fractional Brownian motion using Poisson processes whose parameter sets have the same dimensions as the approximated processes have been studied in the literature. In this paper, a special approximation to the…