A tree search approach to sparse coding

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

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    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.

    Original languageEnglish
    Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Pages472-477
    Number of pages6
    Volume7219 LNCS
    DOIs
    Publication statusPublished - 2012
    Event6th International Conference on Learning and Intelligent Optimization, LION 6 - Paris
    Duration: 2012 Jan 162012 Jan 20

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume7219 LNCS
    ISSN (Print)03029743
    ISSN (Electronic)16113349

    Other

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

    Fingerprint

    Sparse Coding
    Search Trees
    Experiments
    Tree Algorithms
    Pursuit
    Computational Experiments
    Search Algorithm
    Queue
    Optimization Problem
    Vertex of a graph

    Keywords

    • Sparse Coding
    • Tree Search

    ASJC Scopus subject areas

    • Computer Science(all)
    • Theoretical Computer Science

    Cite this

    Rei, R., Pedroso, J. P., Hino, H., & Murata, N. (2012). A tree search approach to sparse coding. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7219 LNCS, pp. 472-477). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7219 LNCS). https://doi.org/10.1007/978-3-642-34413-8_47

    A tree search approach to sparse coding. / Rei, Rui; Pedroso, João P.; Hino, Hideitsu; Murata, Noboru.

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7219 LNCS 2012. p. 472-477 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7219 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Rei, R, Pedroso, JP, Hino, H & Murata, N 2012, A tree search approach to sparse coding. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 7219 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7219 LNCS, pp. 472-477, 6th International Conference on Learning and Intelligent Optimization, LION 6, Paris, 12/1/16. https://doi.org/10.1007/978-3-642-34413-8_47
    Rei R, Pedroso JP, Hino H, Murata N. A tree search approach to sparse coding. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7219 LNCS. 2012. p. 472-477. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-34413-8_47
    Rei, Rui ; Pedroso, João P. ; Hino, Hideitsu ; Murata, Noboru. / A tree search approach to sparse coding. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7219 LNCS 2012. pp. 472-477 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{9f4fe9cc25aa4ff4af78a44245166ab3,
    title = "A tree search approach to sparse coding",
    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.",
    keywords = "Sparse Coding, Tree Search",
    author = "Rui Rei and Pedroso, {Jo{\~a}o P.} and Hideitsu Hino and Noboru Murata",
    year = "2012",
    doi = "10.1007/978-3-642-34413-8_47",
    language = "English",
    isbn = "9783642344121",
    volume = "7219 LNCS",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    pages = "472--477",
    booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

    }

    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

    SN - 9783642344121

    VL - 7219 LNCS

    T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    SP - 472

    EP - 477

    BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    ER -