| Summary: | Change point detection is essential to understand the time-evolving structure of dynamic networks. Recent research shows that a latent semantic indexing (LSI)-based algorithm effectively detects the change points of a dynamic network. The LSI-based method involves a singular value decomposition (SVD) on the data matrix. In a dynamic scenario, recomputing the SVD of a large matrix each time new data arrives is prohibitively expensive and impractical. A more efficient approach is to incrementally update the decomposition. However, in the classical incremental SVD (incSVD) algorithm, the information of the newly added columns is not fully considered in updating the right singular space, resulting in an approximation error which cannot be ignored. This paper proposes an enhanced incSVD (EincSVD) algorithm, in which the right singular matrix is calculated in an alternative way. An adaptive EincSVD (AEincSVD) algorithm is also proposed to further reduce the computational complexity. Theoretical analysis proves that the approximation error of the EincSVD is smaller than that of the incSVD. Simulation results demonstrate that the EincSVD and the AEincSVD perform much better than the incSVD on change point detection, and the performance of the EincSVD is comparable to the batch SVD algorithm.
|
|---|
