Regularity-based spectral clustering and mapping the Fiedler-carpet
Regularity-based spectral clustering and mapping the Fiedler-carpet
Abstract We discuss spectral clustering from a variety of perspectives that include extending techniques to rectangular arrays, considering the problem of discrepancy minimization, and applying the methods to directed graphs. Near-optimal clusters can be obtained by singular value decomposition together with the weighted <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mi>k</m:mi> </m:math> k -means algorithm. …