A Simple and Provable Algorithm for Sparse Diagonal CCA.
Megasthenis AsterisAnastasios KyrillidisOluwasanmi KoyejoRussell A. PoldrackPublished in: ICML (2016)
Keyphrases
- dynamic programming
- detection algorithm
- objective function
- np hard
- high accuracy
- times faster
- cost function
- worst case
- learning algorithm
- preprocessing
- theoretical analysis
- similarity measure
- recognition algorithm
- tree structure
- simulated annealing
- experimental evaluation
- high dimensional
- input data
- expectation maximization
- k means
- computational complexity
- data structure
- greedy algorithm
- optimal solution
- minimum length