Eigensolver Methods for Progressive Multidimensional Scaling of Large Data

摘要

We present a novel sampling-based approximation technique for classical multidimensional scaling that yields an extremely fast layout algorithm suitable even for very large graphs. It produces layouts that compare favorably with other methods for drawing large graphs, and it is among the fastest methods available. In addition, our approach allows for progressive computation, I.e. a rough approximation of the layout can be produced even faster, and then be refined until satisfaction.