👋 This package provides research code and work is ongoing. If you are interested in using it in your own research or in contributing to it, I'd love to hear from you and collaborate! Feel free to write: hong@udel.edu
Data points in many modern datasets lie not along a single low-dimensional subspace, but rather cluster around multiple low-dimensional subspaces (as illustrated above). This is sometimes called "union-of-subspace" structure since the data points lie near the union of these low-dimensional subspaces.
Subspace clustering algorithms seek to cluster the data points by their corresponding subspace - without knowing the subspaces a priori!
Ready to start? Check out the quick start guide!