Sparse-reduced computation for large-scale spectral clustering

Baumann, Philipp (December 2016). Sparse-reduced computation for large-scale spectral clustering (Unpublished). In: IEEE International Conference on Industrial Engineering and Engineering Management. Bali. 4.12.-7.12.2016.

Clustering is a fundamental task in machine learning and data analysis. A large number of clustering algorithms has been developed over the past decades. Among these algorithms, the recently developed spectral clustering methods have consistently outperformed traditional clustering algorithms. Spectral clustering algorithms, however, have limited applicability to large-scale problems due to their high computational complexity. We propose a new approach for scaling spectral clustering methods that is based on the idea of replacing the entire data set with a small set of representative data points and performing the spectral clustering on the representatives. The main contribution is a new approach for efficiently identifying the representative data points. First results indicate that the proposed scaling approach achieves high-quality clusterings and is substantially faster than existing scaling approaches.

Item Type:

Conference or Workshop Item (Speech)


03 Faculty of Business, Economics and Social Sciences > Department of Business Management > Institute of Financial Management > Professorship for Quantitative Methods in Business Administration

UniBE Contributor:

Baumann, Philipp


600 Technology > 650 Management & public relations




Juliana Kathrin Moser-Zurbrügg

Date Deposited:

07 Jul 2017 16:06

Last Modified:

28 Jan 2020 13:49


Actions (login required)

Edit item Edit item
Provide Feedback