query: Cosine Distance as Similarity Measure in KMeans
positive_passages.docid: 28305
positive_passages.text: Why does k-means clustering algorithm use only Euclidean distance metric?
negative_passages.docid: 30360
negative_passages.text: What is a good method for short text clustering?
negative_passages.docid: 13825
negative_passages.text: How do I determine k when using k-means clustering?
negative_passages.docid: 144011
negative_passages.text: Representative point of a cluster with L1 distance
negative_passages.docid: 126944
negative_passages.text: Metric spaces problem
negative_passages.docid: 14249
negative_passages.text: Algorithm for finding similar images
negative_passages.docid: 130574
negative_passages.text: Distance metric for (infinite) lines in 3D
negative_passages.docid: 103860
negative_passages.text: Initializing K-means centers by the means of random subsamples of the dataset?
negative_passages.docid: 36022
negative_passages.text: K-Means clustering for mixed numeric and categorical data
negative_passages.docid: 134485
negative_passages.text: Motivation for Kolmogorov distance between distributions
negative_passages.docid: 112758
negative_passages.text: Combining Bhattacharya Distance (or A Measure of Similarity) --- across Different Variables (Properties)
negative_passages.docid: 129819
negative_passages.text: Using canonical correlation analysis (CCA) to find matches
negative_passages.docid: 60564
negative_passages.text: Proof of convergence of k-means
negative_passages.docid: 74524
negative_passages.text: How to test accuracy of an unsupervised clustering model output?
negative_passages.docid: 59786
negative_passages.text: within cluster sum of squared distances
negative_passages.docid: 104995
negative_passages.text: Evaluation measures of goodness or validity of clustering (without having truth labels)
negative_passages.docid: 15083
negative_passages.text: Mahalanobis Distance on Singular Data