A simple and provable algorithm for sparse diagonal CCA.
Megasthenis AsterisAnastasios KyrillidisOluwasanmi KoyejoRussell A. PoldrackPublished in: CoRR (2016)
Keyphrases
- computational cost
- computational complexity
- experimental evaluation
- times faster
- detection algorithm
- high accuracy
- objective function
- search space
- cost function
- dynamic programming
- learning algorithm
- optimization algorithm
- probabilistic model
- np hard
- significant improvement
- k means
- search algorithm
- particle swarm optimization
- optimal solution
- similarity measure
- matching algorithm
- data sets
- improved algorithm
- minimum length