Direction search based Subspace Clustering

The data matrix D ∈ RM1×M2 can be represented as D = [D1... DN ]T, where T is an arbitrary permutation matrix.

Data and Resources

Cite this as

Mostafa Rahmani, George K. Atia (2025). Dataset: Direction search based Subspace Clustering. https://doi.org/10.57702/wspb8k0b

DOI retrieved: January 3, 2025

Additional Info

Field Value
Created January 3, 2025
Last update January 3, 2025
Defined In https://doi.org/10.1109/LSP.2017.2757901
Author Mostafa Rahmani
More Authors
George K. Atia