Linked Questions

6 votes
2 answers

Need more intuition for the curse of dimensionality [duplicate]

People despise using Eucliean distance in higher dimensional spaces because it is not a viable metric. People argue that the distance between two vectors becomes very large as the number of dimensions ...
user avatar
1 vote
0 answers

KNN Distance measures [duplicate]

Why in KNN Euclidean distance is preferred over Manhattan for low dimension dataset whereas for high dimension, manhattan is preferred?
Diksha Bhutani's user avatar
1 vote
0 answers

Why do we need exponentially more data for an accurate prediction when working in a higher dimensional space? [duplicate]

I am a bit confused by the phenomenon of the curse of dimensionality. Most lecturers motivate this with the KNN classifier and I understand why higher dimensions should be avoided with this classifier ...
Josh.K's user avatar
  • 61
107 votes
12 answers

Explain "Curse of dimensionality" to a child

I heard many times about curse of dimensionality, but somehow I'm still unable to grasp the idea, it's all foggy. Can anyone explain this in the most intuitive way, as you would explain it to a child,...
Kobe-Wan Kenobi's user avatar
92 votes
7 answers

Euclidean distance is usually not good for sparse data (and more general case)?

I have seen somewhere that classical distances (like Euclidean distance) become weakly discriminant when we have multidimensional and sparse data. Why? Do you have an example of two sparse data ...
shn's user avatar
  • 2,579
23 votes
2 answers

How do I know my k-means clustering algorithm is suffering from the curse of dimensionality?

I believe that the title of this question says it all.
mathieu's user avatar
  • 333
15 votes
1 answer

Why is dimensionality reduction always done before clustering? [duplicate]

I learned that it's common to do dimensionality reduction before clustering. But, is there any situation that it is better to do clustering first, and then do dimensionality reduction?
user145177's user avatar
8 votes
1 answer

Where are most points in a uniformly distributed high-dimensional ball?

Should they be close to the middle (origin) or close its surface?
JOX's user avatar
  • 385
1 vote
3 answers

Is K-means performance a bottleneck everywhere?

I've read a paper about a sped-up version of k-means: Ding et al. (2015). Yinyang K-Means: A Drop-In Replacement of the Classic K-Means with Consistent Speedup. Now I wonder, is k-means' ...
CrabMan's user avatar
  • 152
10 votes
1 answer

A valid distance metric for high dimensional data

I asked a question about forming a valid distance metric yesterday (Link1) and got some very good answer; however, I have got some more questions about forming a proper distance metric for high ...
Samo Jerom's user avatar
  • 1,709
6 votes
1 answer

Why is the curse of dimensionality also called the empty space phenomenon?

The curse of dimensionality refers to the fact that the huge number of correlated features tends to increase the complexity of the treatment that has to be applied to the data set. This is also called ...
Joseph Stone's user avatar
4 votes
1 answer

What is high dimensional data in data mining?

Currently I am studying effect of high dimensions of data on clustering , for experiment purpose I want to use kdd dataset from UCI which contains 42 features. Is kdd a high dimensional data or what ...
swapnil7's user avatar
  • 193
2 votes
3 answers

Standardizing some features in K-Means

I have 21 features in my dataset, some features are more important than others. As a fact I know, if I don't standardize (mean=0, SD=1) any features, then features with low variance will have slightly ...
ishaan arora's user avatar
2 votes
3 answers

Distance measure methods of R function dist() evaluation

I want to compute the distance matrix for the columns on a 1000 x 230 matrix using the dist() function in R. Though, I am uncertain about which method to use. I ...
Kwnwps's user avatar
  • 133
1 vote
1 answer

How to choose an internal clustering evaluation metric?

I am trying to cluster textual data using fastText vectors with different clustering algorithms, mainly K-Means and DBSCAN. I would like to know which internal evaluation metric works best with K-...
ryuzakinho's user avatar

15 30 50 per page