The k-outlier Fréchet distance

02/25/2022
by   Maike Buchin, et al.
0

The Fréchet distance is a popular metric for curves; however, its bottleneck character is a disadvantage in many applications. Here we introduce two variants of the Fréchet distance to cope with this problem and expand the work on shortcut Fréchet distances. We present an efficient algorithm for computing the new distance measure.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/09/2022

On Flipping the Fréchet distance

The classical and extensively-studied Fréchet distance between two curve...
research
04/30/2018

A Data-Dependent Distance for Regression

We develop a new data-dependent distance for regression problems to comp...
research
06/19/2019

Rock Climber Distance: Frogs versus Dogs

The classical measure of similarity between two polygonal chains in Eucl...
research
11/25/2019

A Tutorial on Computing t-Closeness

This paper presents a tutorial of the computation of t-closeness. An est...
research
12/05/2013

ABC-SG: A New Artificial Bee Colony Algorithm-Based Distance of Sequential Data Using Sigma Grams

The problem of similarity search is one of the main problems in computer...
research
05/01/2022

Understanding Distance Measures Among Elections

Motivated by putting empirical work based on (synthetic) election data o...
research
01/06/2019

Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance

The Fréchet distance provides a natural and intuitive measure for the po...

Please sign up or login with your details

Forgot password? Click here to reset