Browsing by Subject "incremental eigenpair computation"

Now showing 1 - 1 of 1
  • Thumbnail Image
    Item
    Incremental eigenpair computation for graph Laplacian matrices: theory and applications
    (Springer, 2018-12) Chen, Pin-Yu; Zhang, Baichuan; Al Hasan, Mohammad; Computer and Information Science, School of Science
    The smallest eigenvalues and the associated eigenvectors (i.e., eigenpairs) of a graph Laplacian matrix have been widely used for spectral clustering and community detection. However, in real-life applications, the number of clusters or communities (say, K) is generally unknown a priori. Consequently, the majority of the existing methods either choose K heuristically or they repeat the clustering method with different choices of K and accept the best clustering result. The first option, more often, yields suboptimal result, while the second option is computationally expensive. In this work, we propose an incremental method for constructing the eigenspectrum of the graph Laplacian matrix. This method leverages the eigenstructure of graph Laplacian matrix to obtain the Kth smallest eigenpair of the Laplacian matrix given a collection of all previously computed