0

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 seems to work well in the data which I have. I'm just wondering if there is a standard threshold value which will work optimally in all the cases?

I want to know if there is a standard threshold value for Euclidean distance or there isn't one.

New contributor
sanjay M is a new contributor to this site. Take care in asking for clarification, commenting, and answering. Check out our Code of Conduct.
Related questions
5
What is the appropriate distance metric when clustering paragraph/doc2vec vectors?
0
Selecting an appropriate similarity metric of a k-means clustering model
2
Computation of Distance Matrices for Binary Data in python
Load 5 more related questions Show fewer related questions

0

Reset to default

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.