Volume 56, Issue 1-3

July 2004

Theoretical Advances in Data Clustering

Issue Editors:

9 articles in this issue

Introduction: Special Issue on Theoretical Advances in Data Clustering
Nina Mishra
Rajeev Motwani
Introduction Pages: 5 - 7
Clustering Large Graphs via the Singular Value Decomposition
P. Drineas
A. Frieze
V. Vinay
OriginalPaper Pages: 9 - 33
Optimal Time Bounds for Approximate Clustering
Ramgopal R. Mettu
C. Greg Plaxton
OriginalPaper Pages: 35 - 60
A k-Median Algorithm with Running Time Independent of Data Size
Adam Meyerson
Liadan O'Callaghan
Serge Plotkin
OriginalPaper Pages: 61 - 87
Correlation Clustering
Nikhil Bansal
Avrim Blum
Shuchi Chawla
OriginalPaper Pages: 89 - 113
A New Conceptual Clustering Framework
Nina Mishra
Dana Ron
Ram Swaminathan
OriginalPaper Pages: 115 - 151
Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces
Allan Borodin
Rafail Ostrovsky
Yuval Rabani
OriginalPaper Pages: 153 - 167
Central Clustering of Attributed Graphs
Brijnesh J. Jain
Fritz Wysotzki
OriginalPaper Pages: 169 - 207
Semi-Supervised Learning on Riemannian Manifolds
Mikhail Belkin
Partha Niyogi
OriginalPaper Pages: 209 - 239

Search