1 code implementation • 7 Jun 2021 • Hankui Peng, Angelica I. Aviles-Rivero, Carola-Bibiane Schönlieb
Using the learned affinities from the first stage, HERS builds a hierarchical tree structure that can produce any number of highly adaptive superpixels instantaneously.
1 code implementation • 8 Jun 2021 • Hankui Peng, Nicos G. Pavlidis
Spectral-based subspace clustering methods have proved successful in many challenging applications such as gene sequencing, image recognition, and motion segmentation.
no code implementations • 25 Jan 2019 • Hankui Peng, Nicos Pavlidis, Idris Eckley, Ioannis Tsalamanis
In this paper we consider the problem of clustering collections of very short texts using subspace clustering.
no code implementations • 8 Nov 2019 • Hankui Peng, Nicos G. Pavlidis
In this paper, we propose an active learning framework for subspace clustering that sequentially queries informative points and updates the subspace model.
no code implementations • 8 Oct 2021 • Euan Thomas McGonigle, Hankui Peng
Multivariate time series can often have a large number of dimensions, whether it is due to the vast amount of collected features or due to how the data sources are processed.