LSTM-Assisted Evolutionary Self-Expressive Subspace Clustering

  title={LSTM-Assisted Evolutionary Self-Expressive Subspace Clustering},
  author={Di Xu and Tianhang Long and Junbin Gao},
  journal={Int. J. Mach. Learn. Cybern.},
Massive volumes of high-dimensional data that evolves over time is continuously collected by contemporary information processing systems, which brings up the problem of organizing this data into clusters, i.e. achieve the purpose of dimensional deduction, and meanwhile learning its temporal evolution patterns. In this paper, a framework for evolutionary subspace clustering, referred to as LSTM-ESCM, is introduced, which aims at clustering a set of evolving high-dimensional data points that lie… 

Neural Ordinary Differential Equation Model for Evolutionary Subspace Clustering and Its Applications

This paper proposes a neural ODE model for evolutionary subspace clustering to overcome this limitation and a new objective function with subspace self-expressiveness constraint is introduced and it is demonstrated that this method can not only interpolate data at any time step for the evolutionary sub space clustering task, but also achieve higher accuracy.



Evolutionary Self-Expressive Models for Subspace Clustering

This work introduces evolutionary subspace clustering, a method whose objective is to cluster a collection of evolving data points that lie on a union of low-dimensional evolving subspaces, and proposes a non-convex optimization framework that exploits the self-expressiveness property of the evolving data while taking into account representation from the preceding time step.

Symbiotic evolutionary subspace clustering

Synthetic data sets with different characteristics are generated as the ground truth to evaluate the resulting algorithm for Evolutionary Subspace Clustering (ESC) as well as benchmark against alternative subspace and full-space clustering algorithms.

On evolutionary subspace clustering with symbiosis

The proposed symbiotic evolutionary subspace clustering (S-ESC) borrows from ‘symbiosis’ in the sense that each clustering solution is defined in terms of a host and a number of coevolved cluster centroids (or symbionts in an independent symbiont population).

Bottom-up evolutionary subspace clustering

A generic evolutionary approach to bottom-up subspace clustering is proposed consisting of three steps, with important properties that a standard clustering algorithm is deployed in step one to build the initial lattice of attribute-wise clusters.

Structured Sparse Subspace Clustering: A Joint Affinity Learning and Subspace Clustering Framework

The proposed S3C framework is based on expressing each data point as a structured sparse linear combination of all other data points, where the structure is induced by a norm that depends on the unknown segmentation and it is shown that both the structured sparse representation and the segmentation can be found via a combination of an alternating direction method of multipliers with spectral clustering.

Evolutionary spectral clustering by incorporating temporal smoothness

This paper proposes two frameworks that incorporate temporal smoothness in evolutionary spectral clustering and demonstrates that their methods provide the optimal solutions to the relaxed versions of the corresponding evolutionary k-means clustering problems.

Temporal Subspace Clustering for Human Motion Segmentation

  • Sheng LiKang LiY. Fu
  • Computer Science
    2015 IEEE International Conference on Computer Vision (ICCV)
  • 2015
A temporal Laplacian regularization is designed, which encodes the sequential relationships in time series data and improves the clustering accuracy, compared to the state-of-the-art subspace clustering methods.

High-Rank Matrix Completion and Clustering under Self-Expressive Models

This work proposes efficient algorithms for simultaneous clustering and completion of incomplete high-dimensional data that lie in a union of low-dimensional subspaces and shows that when the data matrix is low-rank, the algorithm performs on par with or better than low-Rank matrix completion methods, while for high-rank data matrices, the method significantly outperforms existing algorithms.

Adaptive evolutionary clustering

This paper presents an evolutionary clustering framework that adaptively estimates the optimal smoothing parameter using shrinkage estimation, a statistical approach that improves a naïve estimate using additional information.

Subspace Clustering via New Low-Rank Model with Discrete Group Structure Constraint

The proposed model directly learns the different subspaces' indicator so that low-rank based different groups are obtained clearly and tactically avoids the integer programming problem imposed by group indicator constraint to let the algorithm more efficient and scalable.