Scalable Semi-Supervised Classification via Neumann Series

Publication Type:
Journal Article
Neural Processing Letters, 2015, 42 (1), pp. 187 - 197
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnailart%3A10.1007%2Fs11063-014-9351-z.pdfPublished Version416.18 kB
Adobe PDF
© 2014, Springer Science+Business Media New York. Traditional graph-based semi-supervised learning (GBSSL) algorithms usually scale badly due to the expensive computational burden. The main bottleneck is that they need to compute the inversion of a huge matrix. In order to alleviate this problem, this paper proposes Neumann series approximation (NSA) to explicitly approximate the inversion process required by conventional GBSSL methodologies, which makes them computationally tractable for relatively large datasets. It is proved that the deviation between the approximation and direct inversion is bounded. Using real-world datasets related to handwritten digit recognition, speech recognition and text classification, the experimental results reveal that NSA accelerates the speed significantly without decreasing too much precision. We also empirically show that NSA outperforms other scalable approaches such as Nyström method, Takahashi equation, Lanczos process based SVD and AnchorGraph regularization, in terms of both efficiency and accuracy.
Please use this identifier to cite or link to this item: