Machine Learning, Volume 56, 2004

Volume 56, Number 1-3, July 2004

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