Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Engineering
Subspace Clustering Using Ensembles Of K-Subspaces, John Lipor, David Hong, Yan Shuo Tan, Laura Balzano
Subspace Clustering Using Ensembles Of K-Subspaces, John Lipor, David Hong, Yan Shuo Tan, Laura Balzano
Electrical and Computer Engineering Faculty Publications and Presentations
Subspace clustering is the unsupervised grouping of points lying near a union of low-dimensional linear subspaces. Algorithms based directly on geometric properties of such data tend to either provide poor empirical performance, lack theoretical guarantees, or depend heavily on their initialization. We present a novel geometric approach to the subspace clustering problem that leverages ensembles of the K-subspaces (KSS) algorithm via the evidence accumulation clustering framework. Our algorithm, referred to as ensemble K-subspaces (EKSS), forms a co-association matrix whose (i,j)th entry is the number of times points i and j are clustered together by several runs of KSS with random …