All Questions
Tagged with clustering lg.learning
5 questions
4
votes
1
answer
195
views
Kleinberg-consistency of spectral clustering
Spectral clustering refers to a family of graph-based algorithms, which usually rely on a similarity function rather than a metric, though a metric $\rho(x,y)$ can always be converted to a similarity ...
- 10.6k
9
votes
2
answers
5k
views
Computational complexity of clustering algorithms
My wish is to describe the time complexity of several clustering approaches. For example, suppose we have $n$ data points in $m$ dimensional space.
Suppose further that the pairwise dissimilarity ...
- 251
2
votes
1
answer
567
views
K-NN or matrix factorization for discovering correlated features?
I am looking to cluster users together in a database, with each user represented by a number of features that are both discrete and continuous in nature. "Similar" users should be clustered together ...
DanB
11
votes
2
answers
357
views
Clustering formalizations other than K-means for separable data
Real world data sometimes has a natural number of clusters (trying to cluster it into a number of cluster lesser than some magic k will cause a dramatic increase the clustering cost). Today I attended ...
12
votes
5
answers
581
views
clustering algorithm for non-dimensional data
i have a dataset of thousands of points and a means of measuring the distance between any two points, but the data points have no dimensionality. i want an algorithm to find cluster centers in this ...
- 223