-
1
-
-
85054087139
-
Measures of clustering quality: A working set of axioms for clustering
-
M. Ackerman and S. Ben-David. Measures of clustering quality: A working set of axioms for clustering. In NIPS, 2008.
-
(2008)
NIPS
-
-
Ackerman, M.1
Ben-David, S.2
-
2
-
-
57049163657
-
A discriminative framework for clustering via similarity functions
-
ACM New York, NY, USA
-
M.F. Balcan, A. Blum, and S. Vempala. A discriminative framework for clustering via similarity functions. In Proceedings of the 40th annual ACM symposium on Theory of Computing, pages 671-680. ACM New York, NY, USA, 2008.
-
(2008)
Proceedings of the 40th Annual ACM Symposium on Theory of Computing
, pp. 671-680
-
-
Balcan, M.F.1
Blum, A.2
Vempala, S.3
-
3
-
-
70349129917
-
Approximate clustering without the approximation
-
Society for Industrial and Applied Mathematics Philadelphia, PA, USA
-
M.F. Balcan, A. Blum, and A. Gupta. Approximate clustering without the approximation. In Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1068-1077. Society for Industrial and Applied Mathematics Philadelphia, PA, USA, 2009.
-
(2009)
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms
, pp. 1068-1077
-
-
Balcan, M.F.1
Blum, A.2
Gupta, A.3
-
4
-
-
0036477260
-
The computational complexity of densest region detection
-
S. Ben-David, N. Eiron, and H.U. Simon. The computational complexity of densest region detection. Journal of Computer and System Sciences, 64(1): 22-47, 2002.
-
(2002)
Journal of Computer and System Sciences
, vol.64
, Issue.1
, pp. 22-47
-
-
Ben-David, S.1
Eiron, N.2
Simon, H.U.3
-
5
-
-
3142750484
-
Clustering large graphs via the singular value decomposition
-
P. Drineas, A. Frieze, R. Kannan, S. Vempala, and V. Vinay. Clustering large graphs via the singular value decomposition. Machine Learning, 56(1):9-33, 2004.
-
(2004)
Machine Learning
, vol.56
, Issue.1
, pp. 9-33
-
-
Drineas, P.1
Frieze, A.2
Kannan, R.3
Vempala, S.4
Vinay, V.5
-
7
-
-
0032108275
-
Property testing and its connection to learning and approximation
-
O. Goldreich, S. Goldwasser, and D. Ron. Property testing and its connection to learning and approximation. Journal of the ACM (JACM), 45(4):653-750, 1998.
-
(1998)
Journal of the ACM (JACM)
, vol.45
, Issue.4
, pp. 653-750
-
-
Goldreich, O.1
Goldwasser, S.2
Ron, D.3
-
8
-
-
35348899361
-
The effectiveness of lloyd-type methods for the k-means problem
-
IEEE Computer Society Washington, DC, USA
-
R. Ostrovsky, Y. Rabani, L.J. Schulman, and C. Swamy. The effectiveness of lloyd-type methods for the k-means problem. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, pages 165-176. IEEE Computer Society Washington, DC, USA, 2006.
-
(2006)
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
, pp. 165-176
-
-
Ostrovsky, R.1
Rabani, Y.2
Schulman, L.J.3
Swamy, C.4
|