Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-34413-8_47 | LION |
Keywords | Field | DocType |
important optimization problem,pursuit method,multiple queue,modest computational time,sparse coding,numerous application,tree search approach,unexplored tree node,best-first tree search algorithm,extensive computational experiment | Mathematical optimization,Tree traversal,Neural coding,Computer science,Queue,Sparse approximation,Theoretical computer science,Artificial intelligence,Optimization problem,Machine learning | Conference |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rui Jorge Rei | 1 | 19 | 1.74 |
| João P. Pedroso | 2 | 0 | 0.34 |
| Hideitsu Hino | 3 | 99 | 25.73 |
| Noboru Murata | 4 | 855 | 170.36 |