Incremental Eigenpair Computation for Graph Laplacian Matrices: Theory and Applications
Incremental Eigenpair Computation for Graph Laplacian Matrices: Theory and Applications
About this item
Full title
Author / Creator
Publisher
Ithaca: Cornell University Library, arXiv.org
Journal title
Language
English
Formats
Publication information
Publisher
Ithaca: Cornell University Library, arXiv.org
Subjects
More information
Scope and Contents
Contents
The smallest eigenvalues and the associated eigenvectors (i.e., eigenpairs) of a graph Laplacian matrix have been widely used in 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 c...
Alternative Titles
Full title
Incremental Eigenpair Computation for Graph Laplacian Matrices: Theory and Applications
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_2071279120
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2071279120
Other Identifiers
E-ISSN
2331-8422
