Greedy Algorithms for Approximating the Diameter of Machine Learning Datasets in Multidimensional Euclidean Space

08/10/2018
by   Ahmad B. Hassanat, et al.
0

Finding the diameter of a dataset in multidimensional Euclidean space is a well-established problem, with well-known algorithms. However, most of the algorithms found in the literature do not scale well with large values of data dimension, so the time complexity grows exponentially in most cases, which makes these algorithms impractical. Therefore, we implemented 4 simple greedy algorithms to be used for approximating the diameter of a multidimensional dataset; these are based on minimum/maximum l2 norms, hill climbing search, Tabu search and Beam search approaches, respectively. The time complexity of the implemented algorithms is near-linear, as they scale near-linearly with data size and its dimensions. The results of the experiments (conducted on different machine learning data sets) prove the efficiency of the implemented algorithms and can therefore be recommended for finding the diameter to be used by different machine learning applications when needed.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/07/2021

4 vs 7 sparse undirected unweighted Diameter is SETH-hard at time n^4/3

We show, assuming the Strong Exponential Time Hypothesis, that for every...
research
07/16/2023

Better Diameter Algorithms for Bounded VC-dimension Graphs and Geometric Intersection Graphs

We develop a framework for algorithms finding diameter in graphs of boun...
research
08/26/2020

Inapproximability of Diameter in super-linear time: Beyond the 5/3 ratio

We show, assuming the Strong Exponential Time Hypothesis, that for every...
research
12/03/2020

A Novel index-based multidimensional data organization model that enhances the predictability of the machine learning algorithms

Learning from the multidimensional data has been an interesting concept ...
research
01/06/2021

Scalable Feature Matching Across Large Data Collections

This paper is concerned with matching feature vectors in a one-to-one fa...
research
05/15/2023

Fast and Efficient Matching Algorithm with Deadline Instances

Online weighted matching problem is a fundamental problem in machine lea...
research
01/17/2018

The Complexity of Subdivision for Diameter-Distance Tests

We present a general framework for analyzing the complexity of subdivisi...

Please sign up or login with your details

Forgot password? Click here to reset