I'm looking for a fast (better than O[N^2]) clustering algorithm given a large sparse non-metric similarity matrix. Any ideas?
-
-
@avibryant The similarity matrix is built via an LSH variant -
@jakevdp given the (tunably) sparse candidate pairs from LSH, wouldn't a simple hierarchical clustering be << N^2? -
@avibryant Could be... I'll look into it. Thanks for the suggestion!
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.