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