DC Field | Value | Language |
---|---|---|
dc.contributor.author | Dongha, Lee | - |
dc.contributor.author | Jinoh, Oh | - |
dc.contributor.author | Hwanjo, Yu | - |
dc.date.accessioned | 2019-12-06T06:50:03Z | - |
dc.date.available | 2019-12-06T06:50:03Z | - |
dc.date.created | 2019-12-04 | - |
dc.date.issued | 2020-04 | - |
dc.identifier.issn | 0020-0255 | - |
dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/100442 | - |
dc.description.abstract | Recently, there are increasing reports that most datasets can be actually stored in disks of a single off-the-shelf workstation, and utilizing out-of-core methods is much cheaper and even faster than using a distributed system. For these reasons, out-of-core methods have been actively developed for machine learning and graph processing. The goal of this paper is to develop an efficient out-of-core matrix completion method based on coordinate descent approach. Coordinate descent-based matrix completion (CD-MC) has two strong benefits over other approaches: 1) it does not involve heavy computation such as matrix inversion and 2) it does not have step-size hyper-parameters, which reduces the effort for hyper-parameter tuning. Existing solutions for CD-MC have been developed and analyzed for in-memory setting and they do not take disk-I/O into account. Thus, we propose OCAM, a novel out-of-core coordinate descent algorithm for matrix completion. Our evaluation results and cost analyses provide sound evidences supporting the following benefits of OCAM: (1) Scalability - OCAM is a truly scalable out-of-core method and thus decomposes a matrix larger than the size of memory, (2) Efficiency - OCAM is super fast. OCAM is up to 10x faster than the state-of-the-art out-of-core method, and up to 4.1x faster than a competing distributed method when using eight machines. The source code of OCAM will be available for reproducibility. (C) 2019 Published by Elsevier Inc. | - |
dc.language | English | - |
dc.publisher | ELSEVIER SCIENCE INC | - |
dc.relation.isPartOf | INFORMATION SCIENCES | - |
dc.title | OCAM: Out-of-core coordinate descent algorithm for matrix completion | - |
dc.type | Article | - |
dc.identifier.doi | 10.1016/j.ins.2019.09.077 | - |
dc.type.rims | ART | - |
dc.identifier.bibliographicCitation | INFORMATION SCIENCES, v.514, pp.587 - 604 | - |
dc.identifier.wosid | 000513296600035 | - |
dc.citation.endPage | 604 | - |
dc.citation.startPage | 587 | - |
dc.citation.title | INFORMATION SCIENCES | - |
dc.citation.volume | 514 | - |
dc.contributor.affiliatedAuthor | Dongha, Lee | - |
dc.contributor.affiliatedAuthor | Hwanjo, Yu | - |
dc.identifier.scopusid | 2-s2.0-85075538204 | - |
dc.description.journalClass | 1 | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.type.docType | Article | - |
dc.subject.keywordAuthor | Matrix completion | - |
dc.subject.keywordAuthor | Out-of-core method | - |
dc.subject.keywordAuthor | Coordinate descent | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
library@postech.ac.kr Tel: 054-279-2548
Copyrights © by 2017 Pohang University of Science ad Technology All right reserved.