2 search results - page 1 / 1 » Finding Planted Partitions in Nearly Linear Time using Arres... |
ICML
2010
IEEE
14 years 10 months ago
2010
IEEE
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
Correlation clustering is a type of clustering that uses a basic form of input data: For every pair of data items, the input specifies whether they are similar (belonging to the s...