Efficient Processing of Alternating Least Squares on a Single Machine
- Authors
- Jo, Yong Yeon; Jang, Myung Hwan; Kim, Sang Wook
- Issue Date
- Oct-2017
- Publisher
- Springer Verlag
- Keywords
- Alternating least squares; Graph engine; Performance
- Citation
- Lecture Notes in Electrical Engineering, v.461, pp.58 - 67
- Indexed
- SCOPUS
- Journal Title
- Lecture Notes in Electrical Engineering
- Volume
- 461
- Start Page
- 58
- End Page
- 67
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/151563
- DOI
- 10.1007/978-981-10-6520-0_7
- ISSN
- 1876-1100
- Abstract
- Alternating least squares (ALS) is one of the algorithms widely used in recommendation systems. In this paper, we propose a method to perform ALS on a graph engine on a single machine. We employ our graph engine, RealGraph, to handle big graphs and develop ALS efficiently performed on top of it. Real-world graphs in performing ALS follow the power-law degree distribution, specifying that a few nodes have a lot of edges while a lot of nodes do only a few edges. Prior graph engines do not consider this important characteristic, which slows down their performance. According to our extensive performance evaluation, our ALS running on RealGraph significantly outperforms those on other engines up to 2.5 times.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 컴퓨터소프트웨어학부 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/151563)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.