A Simple Approach to Automated Spectral Clustering Appendices Jicong Fan 1, 2, Yiheng T u

K, when n is large (e.g. The time complexity is O ( kτn). We have the following result. It shows that when two data points in X, e.g. Hence KLSR with Gaussian kernel utilizes local information to enhance C . The algorithm of AutoSC-GD with only LSR and KLSR is shown in Algorithm 1.