A tree search approach to sparse coding

• Type: Article in International Conference Proceedings Book
• Date: 2012

Authors

Rei, R (Author) Other; Pedroso, JP (Author) FCUP; Hino, H (Author) Other; Murata, N (Author) Other

Conference proceedings International

Title: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Pages: 472-477

6th International Conference on Learning and Intelligent Optimization, LION 6

Paris, 16 January 2012 through 20 January 2012

Indexing

ISI Web of Knowledge

Scopus - 0 Citations

Other information

Authenticus ID: P-008-6XF

DOI: 10.1007/978-3-642-34413-8_47

Abstract (EN): 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. © 2012 Springer-Verlag.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 6