SINCO - An Efficient Greedy Method for Learning Sparse INverse COvariance Matrix thumbnail
Pause
Mute
Subtitles not available
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

SINCO - An Efficient Greedy Method for Learning Sparse INverse COvariance Matrix

Published on Jan 19, 20104609 Views

Herein, we propose a simple greedy algorithm (SINCO) for solving this optimization problem. SINCO solves the primal problem (unlike its predecessors such as COVSEL [10] and glasso [4]), using coordi

Related categories