Skip to main content

Questions tagged [euclidean]

Euclidean distance is the intuitive notion of a 'straight-line' distance between two points in a Euclidean space.

Filter by
Sorted by
Tagged with
1 vote
1 answer
34 views

Comparison of two test metrics

I'm trying to compare two test metrics (Metric A and Metric B) to determine which one better predicts a delta value, which represents a Euclidean difference. I am unsure how to determining which ...
agf1997's user avatar
  • 41
1 vote
1 answer
26 views

Are there strategies for measuring accuracy of Euclidean distance-based similarity without ground truthing?

I have subjects with about 200 features each. These feature vectors are stored in a vector database, where similarity searching with Euclidean distance is used to find subjects that are similar to a ...
T_d's user avatar
  • 13
2 votes
0 answers
55 views

Using one distance metric on another distance matrix

In general, is it correct to use one distance metric on another distance matrix? For example, is it valid to use Euclidean metric on Jaccard distance matrix as input data in algorithms? or any other ...
rkabuk's user avatar
  • 71
2 votes
1 answer
49 views

What is the standard threshold value that is best for accuracy when employing Euclidean distance as a metric for gauging textual similarity?

I'm using Euclidean distance as a metric to compare two sentences for similarity while clustering them using my custom incremental KMeans algorithm. The current threshold value I'm using is 0.7 which ...
sanjay M's user avatar
0 votes
0 answers
17 views

Distance metric for dummy and continous variables

I'm trying to apply the KNN regression model to the data I have at my disposal which contains one dummy variable and two continuous variables (which I have normalized). I was wondering if it is okay ...
soph's user avatar
  • 1
0 votes
0 answers
26 views

Panel data clustering - how to assess the distance between individuals when the data are multivariate and longitudinal?

I have an (unbalanced) panel dataset with 20 countries, 57 years, and 8 variables, and I would like to cluster the countries according to their dynamic trend in these variables (whether using kmeans ...
last_resource's user avatar
2 votes
1 answer
281 views

Normalizing Euclidean distance by the length of the vectors [closed]

Suppose I have 4 vectors, the first 2 vectors are of length 4 and the last 2 vectors are of length 400. all values in the vectors range from 0.5 to 0.6. The Euclidean distance between the last 2 ...
user17420392's user avatar
2 votes
2 answers
561 views

Correlation vs Euclidean distance as measures of similarity or closeness between data points with an outlier

I am interested in the comparison of Pearson correlation and Euclidean distance as measures of similarity between data points. Suppose I have 4 data points, w, x, y, z, in a multidimensional space, ...
taellipsis's user avatar
0 votes
0 answers
61 views

Is "ward.D" a good agglomeration method in R?

I need to do clustering on a large scale file (~12M rows, 18 features + id index). As a first step, i tried different algorythms in Python with a test sample (40k rows) which gave results (clearly ...
MATHIS MANDINE's user avatar
0 votes
1 answer
329 views

Word embedding and Euclidean distance

Does a transformation exist that allows to use of the Euclidean distance with the word embeddings? The Cosine distance could be a problem in my case. For example, what if I translate the vector to a ...
ozw1z5rd's user avatar
  • 171
0 votes
1 answer
210 views

Best way for measuring dispersion in two dimensional, continuous data

I have a list of coordinates for where different people live over an eight-year period. They are repeat cross-sections of populations served by several county agencies for free workforce training for ...
dcoy's user avatar
  • 362
2 votes
1 answer
516 views

How to choose the Normalization method for a co-occurence matrix?

I have a co-occurrence matrix about hashtags usage (The value in the cell means the number of times two hashtags appear together in a single tweet), it is transformed from a 2-mode matrix. Now I want ...
Xinmeng Lien's user avatar
2 votes
0 answers
177 views

normalizing euclidean distance

I asked a question in SO but was told it is more appropriate here. I'm trying to compute the euclidean distance with vectors of different lengths. ...
HappyPy's user avatar
  • 143
1 vote
0 answers
294 views

What are the downsides of using euclidean distance for hierarchical clustering of a correlation matrix?

Apologies if this has been answered elsewhere, but I couldn't find any answers discussing this specific question. I am lacking some notion on clustering using euclidean vs correlation distance, when ...
tomsgoms's user avatar
0 votes
0 answers
102 views

Euclidean distance between points in high dimensions

On Wikipedia there's a statement: When a measure such as a Euclidean distance is defined using many coordinates, there is little difference in the distances between different pairs of samples. Is ...
Yandle's user avatar
  • 1,189
0 votes
0 answers
151 views

Is cosine similarity enough to measure word embedding similarity?

Is cosine similarity a good metric to measure word embedding similarity? Suppose that we have two vectors of word embedding in same direction but with different length( first one with len=1 and second ...
Mahdi Amrollahi's user avatar
0 votes
1 answer
115 views

In R perform k means clustering with k=3 and euclidean distance a 100 different times [closed]

I would like to perform k mean clustering with k=3 and the Euclidean distance a 100 different time. But it only gives me 2 iterations, how do i do a loop so it give me 100. Thanks
SuzieT's user avatar
  • 3
2 votes
1 answer
2k views

Euclidean distance between points in PCA space along different principal component dimensions

I've picked up this project half way through, and I'm working through the last guy's code, so please bear with me. So the original data consists of 500+ points in 150 dimensions, and I want to ...
T.Murray's user avatar
1 vote
1 answer
5k views

Intuitive explanation of Ward's method

I got this explanation of the Ward's method of hierarchical clustering from Malhotra et. al (2017), and I don't really get what it means: Ward’s procedure is a variance method which attempts to ...
Academic005's user avatar
1 vote
0 answers
67 views

Similarity between datasets A and B where B is a subset of A

I have two datasets A and B, and for each entry in both datasets I have a mixture of ordered and unordered categorical variables such as gender, age (integral value) and date. It is believed that ...
David Young's user avatar
1 vote
0 answers
187 views

What are the moments of the Beckmann distribution?

Let $U=(u_1, u_2)$ and $V=(v_1, v_2)$ be two randomly distributed points on the Euclidean plane assuming bivariate normal distributions $U \sim N(\mu_u, \Sigma_u)$ and $V \sim N(\mu_v, \Sigma_v)$ with ...
pazkaw's user avatar
  • 11
2 votes
0 answers
189 views

About the calculation of covariance matrix in mahalanobis distance: How $W^TW$ is equal to the covariance matrix? [closed]

I was reading about deep metric learning (from here) and came across the mahalanobis distance. I understood why we can not use euclidean distance if the distribution is not isotropic (the covariance ...
Mas A's user avatar
  • 203
2 votes
1 answer
2k views

Cosine similarity seems to perform better with higher dimensions than Euclidean distance? Should this be the case?

I've generated 100 random vectors (data points) in n∈[1,...,50] dimensions. I then compared distances between each pair of vectors and calculated the mean value. I've done this for all dimensions ...
Jamess11's user avatar
2 votes
2 answers
764 views

How to define distance for vector of angles?

I have a vector of angles and I am looking for a method to compute the distance of my vector with any other vector of angles? I am looking for something similar to Euclidean distance but I know that ...
Aep's user avatar
  • 171
1 vote
0 answers
150 views

Euclidean Norm normalized Normal Distribution

Let $X$ be a multivariate normal $\mathcal{N}(\mu, \Sigma^2)$ and let $X$ be anistropic, that is I am considering $\Sigma$ to be a diagonal matrix but the elements on the diagonal might be different. ...
rostader's user avatar
  • 183
2 votes
1 answer
664 views

Applying Dynamic Time Warping (DTW) instead of Euclidean Distance for Clustering Synchronized Time series data

I am trying to cluster members based on hourly login data. As this is mostly synchronized, I first applied Euclidean and it failed to cluster them into groups with sensible patterns. I tried DTW ...
Sunny's user avatar
  • 21
0 votes
0 answers
130 views

Significance test for comparing two mean Euclidean distances?

First time poster here, so please let me know if more details are needed! In short, I'm analyzing a dataset that has scores from 98 siblings from 64 families. So some families contributed only one ...
Katie's user avatar
  • 1
1 vote
0 answers
185 views

What is the effect of the limitations of Euclidean distances in high dimensions to multiple regression?

This is eye-opening, and the effect on KNN, for example, is easy to predict, but should the limitations of Euclidean distance in high dimension be a reason for concern in the very common application ...
Antoni Parellada's user avatar
1 vote
1 answer
203 views

Is Euclidean distance the same as distance-from-correlation as $d(x, y) = \sqrt{2m[1 - r(x, y)]}$

I found in a couple of documents (e.g. this) that the Euclidean distance $d(x, y) = \sqrt{\sum_{i = 1}^{n}{(x_i - y_i)^2}}$ can be obtained from correlation coeffcient if $x$ and $y$ are standardised ...
dariober's user avatar
  • 4,659
0 votes
1 answer
28 views

How can I cluster plant biomass and grain weight for different plant varieties using Ward's method based clustering?

I have plant biomass and grain weight data for different plant varieties which I now need to cluster. Do I need to define the number of clusters if using Ward's method and Squared Euclidean distance ...
Debarati Chakraborty's user avatar
1 vote
0 answers
158 views

How to find the average distance between randomly distributed points in a rectangle?

Assume there are n points randomly distributed in a rectangle (x being the height y being the width) shown below in the figure. I would like to calculate the average distance between 2 random red ...
Yun Hyunsoo's user avatar
2 votes
1 answer
159 views

Non-Euclidean analogue to MSE loss

The most basic machine learning model called OLS uses the RSS (squared loss) or its average, mean squared error (MSE), for its loss function, which is aligned with Euclidean geometry. What is the ...
develarist's user avatar
  • 3,997
2 votes
1 answer
169 views

Probability of one point being closer to fixed $x \in \mathbf{R}^2$ than another

Let $x, x^{(0)}, x^{(1)} \in \mathbb{R}^2$, $r_1, r_2 \sim U[-1, 1]$. Point $x$ is fixed, $x = (0.32, 0)$, and $x^{(0)} = (0, r_1)$, $x^{(1)} = (1,r_2)$. What is the probability that the fixed point $...
Inter Veridium's user avatar
1 vote
1 answer
176 views

Generate Uniform Random Variates with Constant Norm [duplicate]

How can one generate $k$ uniform random variates centered at zero, $X_1, X_2, ..., X_k$, given a constant Euclidean norm, $c =\sqrt{X_1^2+X_2^2+...X_k^2}$?
Joby D's user avatar
  • 43
2 votes
1 answer
746 views

Cosine similarity for Categorical datasets?

Can I use Cosine similarity measure for estimating similarity/relationship between D1 and D2 (two categorical datasets)
Msilvy's user avatar
  • 51
0 votes
0 answers
744 views

PCoA/MDS on sqrt transformed Bray-Curtis dissmilarity using cmdscale

I would like to use PCoA to visualize beta diversity of a large community. I chose Bray-Curtis as distance measure to calculate the dissimilarity matrix and would like to apply a square root ...
mucl's user avatar
  • 121
0 votes
0 answers
301 views

Euclidean distance from zero

I am trying to create my own weights for relative work task importance, or weight. For every task, I have a value of importance, ...
Marc's user avatar
  • 31
7 votes
2 answers
509 views

Variance and asymptotic normality of $\frac{1}{n-1}\sum_{i=1}^{n-1}(x_{i+1}-x_i)^2$, where $X \sim \mathcal{N}(0,1)$

Consider a length $n$ vector $\mathbf{x}$ containing $n$ i.i.d. observations $\{x_i\}_{i=1}^n$ of a standard normal random variable $X$. Let $\mathbf{z}$ be a length $n-1$ vector whose entries are $...
eyeExWhy's user avatar
  • 556
3 votes
1 answer
1k views

Should we apply PCA before calculating similarities in high-dimensional space if my observations have length 1?

I have high-dimensional space (around 20 features) and I want to calculate similarity based on the angle of observation, not the magnitude. I have a nice function that can compute euclidean distance ...
jakes's user avatar
  • 215
2 votes
1 answer
631 views

Does DTW return smaller distance measure than Euclidean Distance?

QUESTION 1: When computing the distance between two time series, shouldn't the DTW distance measure return a smaller distance than the Euclidean distance (assuming DTW internally uses the Euclidean ...
Tom Crasset's user avatar
0 votes
0 answers
84 views

Plotting Vector Embeddings

I am currently working on a project that requires some form of data on the paper. Even though I was able to get some coding done and communicate results, I need some graphs. What I want to do is ...
Jerome Ariola's user avatar
0 votes
0 answers
53 views

Manhattan vs Euclidian Distance Measure [duplicate]

In which case we should pickup Manhattan distance and when we should use euclidian distance measure. To my understanding both are used for continues numeric data(not like cosine or others who works ...
SKB's user avatar
  • 163
1 vote
1 answer
240 views

How to find the list of nearest vectors if ony a vector is given?

I know there are many ways to compute similarity of two different non-zero vectors but is it possible to get a list of nearest vectors whose values are continous given a single continous vector. Lets ...
Eka's user avatar
  • 2,271
1 vote
2 answers
548 views

How Rapidminer handle same distance for KNN Algorithm

Actually I already asked in rapidminer forum, but no one has given an answer yet.. https://community.rapidminer.com/discussion/55963/how-k-nn-algorithms-work-with-same-distance-in-rapidminer#latest ...
AdeMuchlis's user avatar
1 vote
0 answers
101 views

the accuracy of covariance between two high-dimensional vectors

Question Is the covariance between high-dimensional vectors less accruate than covariance between two vectors in low-dimensional vecotrs? I am asking this questio to check if there is a need for '...
Eiffelbear's user avatar
1 vote
0 answers
956 views

Difference between standardizing variables and using Mahalanobis distance

I am wondering how and/or why the Mahalanobis distance is different from using the Euclidean distance on standardized variables?
Ben's user avatar
  • 3,473
14 votes
1 answer
6k views

Why is Kullback-Leilbler divergence a better metric for measuring distance between two probability distributions than squared error? [duplicate]

I know that KL-divergence is a metric that is more suitable when we want to measure the distance between numbers which a probability form. However, I am still confused what is the benefit of using KL-...
Kadaj13's user avatar
  • 395
0 votes
2 answers
290 views

Clustering high dimensional data

I was going through this wiki page on clustering in high dimensions and I don't understand the following statement there. Can someone explain to me what this means? The concept of distance becomes ...
bandit_king28's user avatar
4 votes
1 answer
3k views

Difference between Euclidean, Pearson, Geodesic and Mahalanobis distance metrics

Given a set of samples $X$. We are tasked to find an appropriate distance metric for $X$ from the given options which are Euclidean Pearson Geodesic and Mahalanobis distance metrics. To solve this, ...
Statistical_Research's user avatar
0 votes
1 answer
76 views

What is the specific normalization chi2 in seqdist?

In the documentation for the seqdist() function it is noted that there is "...a specific normalization for"CHI2" and "EUCLID". See the Details section." (p.60). But in the details section there is no ...
Aaron Conway's user avatar