TY - GEN
T1 - A tree search approach to sparse coding
AU - Rei, Rui
AU - Pedroso, João P.
AU - Hino, Hideitsu
AU - Murata, Noboru
PY - 2012
Y1 - 2012
N2 - Sparse coding is an important optimization problem with numerous applications. In this paper, we describe the problem and the commonly used pursuit methods, and propose a best-first tree search algorithm employing multiple queues for unexplored tree nodes. We assess the effectiveness of our method in an extensive computational experiment, showing its superiority over other methods even for modest computational time.
AB - Sparse coding is an important optimization problem with numerous applications. In this paper, we describe the problem and the commonly used pursuit methods, and propose a best-first tree search algorithm employing multiple queues for unexplored tree nodes. We assess the effectiveness of our method in an extensive computational experiment, showing its superiority over other methods even for modest computational time.
KW - Sparse Coding
KW - Tree Search
UR - http://www.scopus.com/inward/record.url?scp=84867877046&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84867877046&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-34413-8_47
DO - 10.1007/978-3-642-34413-8_47
M3 - Conference contribution
AN - SCOPUS:84867877046
SN - 9783642344121
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 472
EP - 477
BT - Learning and Intelligent Optimization - 6th International Conference, LION 6, Revised Selected Papers
T2 - 6th International Conference on Learning and Intelligent Optimization, LION 6
Y2 - 16 January 2012 through 20 January 2012
ER -