Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/23682
Title: An Instance-Frequency-Weighted Regularization Scheme for Non-Negative Latent Factor Analysis on High-Dimensional and Sparse Data
Authors: Luo, X
Wang, Z
Shang, M
Keywords: Non-negative Latent Factor Analysis;Regularization;Instance-frequency;High Dimensional and Sparse Data;Recommender System;Industrial Application
Issue Date: 2019
Publisher: IEEE
Citation: X. Luo, Z. Wang and M. Shang, "An Instance-Frequency-Weighted Regularization Scheme for Non-Negative Latent Factor Analysis on High-Dimensional and Sparse Data," in IEEE Transactions on Systems, Man, and Cybernetics: Systems, vol. 51, no. 6, pp. 3522-3532, June 2021, doi: 10.1109/TSMC.2019.2930525.
Abstract: High-dimensional and sparse (HiDS) data with non-negativity constraints are commonly seen in industrial applications, such as recommender systems. They can be modeled into an HiDS matrix, from which non-negative latent factor analysis (NLFA) is highly effective in extracting useful features. Preforming NLFA on an HiDS matrix is ill-posed, desiring an effective regularization scheme for avoiding overfitting. Current models mostly adopt a standard {L} {2} scheme, which does not consider the imbalanced distribution of known data in an HiDS matrix. From this point of view, this paper proposes an instance-frequency-weighted regularization (IR) scheme for NLFA on HiDS data. It specifies the regularization effects on each latent factors with its relevant instance count, i.e., instance-frequency, which clearly describes the known data distribution of an HiDS matrix. By doing so, it achieves finely grained modeling of regularization effects. The experimental results on HiDS matrices from industrial applications demonstrate that compared with an {L} {2} scheme, an IR scheme enables a resultant model to achieve higher accuracy in missing data estimation of an HiDS matrix.
URI: http://bura.brunel.ac.uk/handle/2438/23682
DOI: http://dx.doi.org/10.1109/TSMC.2019.2930525
ISSN: 2168-2216
2168-2232
Appears in Collections:Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
FullText.pdf3.26 MBAdobe PDFView/Open


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