nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A k-Median Algorithm with Running Time Independent of Data Size
|
Adam Meyerson |
|
2004 |
56 |
1 |
p. 61-87 27 p. |
artikel |
2 |
A New Conceptual Clustering Framework
|
Nina Mishra |
|
2004 |
56 |
1 |
p. 115-151 37 p. |
artikel |
3 |
Central Clustering of Attributed Graphs
|
Brijnesh J. Jain |
|
2004 |
56 |
1 |
p. 169-207 39 p. |
artikel |
4 |
Clustering Large Graphs via the Singular Value Decomposition
|
P. Drineas |
|
2004 |
56 |
1 |
p. 9-33 25 p. |
artikel |
5 |
Correlation Clustering
|
Nikhil Bansal |
|
2004 |
56 |
1 |
p. 89-113 25 p. |
artikel |
6 |
Introduction Special Issue on Theoretical Advances in Data Clustering
|
Nina Mishra |
|
2004 |
56 |
1 |
p. 5-7 3 p. |
artikel |
7 |
Optimal Time Bounds for Approximate Clustering
|
Ramgopal R. Mettu |
|
2004 |
56 |
1 |
p. 35-60 26 p. |
artikel |
8 |
Semi-Supervised Learning on Riemannian Manifolds
|
Mikhail Belkin |
|
2004 |
56 |
1 |
p. 209-239 31 p. |
artikel |
9 |
Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces
|
Allan Borodin |
|
2004 |
56 |
1 |
p. 153-167 15 p. |
artikel |