Sciweavers

IPPS
1999
IEEE
13 years 12 months ago
A Graph Based Method for Generating the Fiedler Vector of Irregular Problems
In this paper we present new algorithms for spectral graph partitioning. Previously, the best partitioning methods were based on a combination of Combinatorial algorithms and appli...
Michael Holzrichter, Suely Oliveira
GFKL
2005
Springer
95views Data Mining» more  GFKL 2005»
14 years 1 months ago
An Indicator for the Number of Clusters: Using a Linear Map to Simplex Structure
Abstract. The problem of clustering data can be formulated as a graph partitioning problem. In this setting, spectral methods for obtaining optimal solutions have received a lot of...
Marcus Weber, Wasinee Rungsarityotin, Alexander Sc...