{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T07:42:10Z","timestamp":1723016530303},"publisher-location":"California","reference-count":0,"publisher":"International Joint Conferences on Artificial Intelligence Organization","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,8]]},"abstract":"<jats:p>We study the approximation of a target matrix in terms of several selected columns of another matrix, sometimes called \"a dictionary\".\n\nThis approximation problem arises in various domains, such as signal processing, computer vision, and machine learning.\n\nAn optimal column selection algorithm for the special case where the target matrix has only one column is known since the 1970's,\n\nbut most previously proposed column selection algorithms for the general case are greedy.\n\nWe propose the first nontrivial optimal algorithm for the general case, using a heuristic search setting similar to the classical A* algorithm.\n\nWe also propose practical sub-optimal algorithms in a setting similar to the classical Weighted A* algorithm.\n\nExperimental results show that our sub-optimal algorithms compare favorably with the current state-of-the-art greedy algorithms.\n\nThey also provide bounds on how close their solutions are to the optimal solution.<\/jats:p>","DOI":"10.24963\/ijcai.2021\/221","type":"proceedings-article","created":{"date-parts":[[2021,8,11]],"date-time":"2021-08-11T11:00:49Z","timestamp":1628679649000},"page":"1600-1606","source":"Crossref","is-referenced-by-count":1,"title":["Heuristic Search for Approximating One Matrix in Terms of Another Matrix"],"prefix":"10.24963","author":[{"given":"Guihong","family":"Wan","sequence":"first","affiliation":[{"name":"Department of Computer Science, The University of Texas at Dallas"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haim","family":"Schweitzer","sequence":"additional","affiliation":[{"name":"Department of Computer Science, The University of Texas at Dallas"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"10584","event":{"number":"30","sponsor":["International Joint Conferences on Artificial Intelligence Organization (IJCAI)"],"acronym":"IJCAI-2021","name":"Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}","start":{"date-parts":[[2021,8,19]]},"theme":"Artificial Intelligence","location":"Montreal, Canada","end":{"date-parts":[[2021,8,27]]}},"container-title":["Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence"],"original-title":[],"deposited":{"date-parts":[[2021,8,11]],"date-time":"2021-08-11T11:02:05Z","timestamp":1628679725000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ijcai.org\/proceedings\/2021\/221"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2021,8]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/ijcai.2021\/221","relation":{},"subject":[],"published":{"date-parts":[[2021,8]]}}}