Active clustering
24Feb11
Just a note — the paper “Active Clustering: Robust and Efficient Hierarchical Clustering using Adaptively Selected Similarities,” by Eriksson, Dasarathy, Singh, and Nowak, describing the algorithm which I (but not they) refer to as “compressed clustering,” is now on the arXiv.
Advertisement
Filed under: math | Leave a Comment
Tags: clustering, compressed sensing, computer science, data
Blogroll
-
Recent Comments
Jeff on America has spoken: Wisconsin … Nathan Dunfield on America has spoken: Wisconsin … Frank on America has spoken: Wisconsin … ARaybold on Reader survey: do you know you… ARaybold on Why aren’t there people …
No Responses Yet to “Active clustering”