Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/76828
Title: Incorporation of efficient second-order solvers into latent factor models for accurate prediction of missing QoS data
Authors: Luo, X
Zhou, M
Li, S 
Xia, Y
You, ZH
Zhu, Q
Issue Date: 2017
Publisher: Institute of Electrical and Electronics Engineers
Source: IEEE transactions on cybernetics, 2017 (article in press) How to cite?
Journal: IEEE transactions on cybernetics 
Abstract: Generating highly accurate predictions for missing quality-of-service (QoS) data is an important issue. Latent factor (LF)-based QoS-predictors have proven to be effective in dealing with it. However, they are based on first-order solvers that cannot well address their target problem that is inherently bilinear and nonconvex, thereby leaving a significant opportunity for accuracy improvement. This paper proposes to incorporate an efficient second-order solver into them to raise their accuracy. To do so, we adopt the principle of Hessian-free optimization and successfully avoid the direct manipulation of a Hessian matrix, by employing the efficiently obtainable product between its Gauss-Newton approximation and an arbitrary vector. Thus, the second-order information is innovatively integrated into them. Experimental results on two industrial QoS datasets indicate that compared with the state-of-the-art predictors, the newly proposed one achieves significantly higher prediction accuracy at the expense of affordable computational burden. Hence, it is especially suitable for industrial applications requiring high prediction accuracy of unknown QoS data.
URI: http://hdl.handle.net/10397/76828
ISSN: 2168-2267
EISSN: 2168-2275
DOI: 10.1109/TCYB.2017.2685521
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

5
Citations as of Jun 14, 2018

WEB OF SCIENCETM
Citations

5
Citations as of Jun 22, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.