A tree search approach to sparse coding

Rui Rei, João P. Pedroso, Hideitsu Hino, Noboru Murata

研究成果: Conference contribution

抄録

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.

本文言語English
ホスト出版物のタイトルLearning and Intelligent Optimization - 6th International Conference, LION 6, Revised Selected Papers
ページ472-477
ページ数6
DOI
出版ステータスPublished - 2012 10 30
イベント6th International Conference on Learning and Intelligent Optimization, LION 6 - Paris, France
継続期間: 2012 1 162012 1 20

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
7219 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Conference

Conference6th International Conference on Learning and Intelligent Optimization, LION 6
CountryFrance
CityParis
Period12/1/1612/1/20

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「A tree search approach to sparse coding」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル