The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
An Inherently Nonnegative Latent Factor Model for High-Dimensional and Sparse Matrices from Industrial Applications
Abstract
High-dimensional and sparse (HiDS) matrices are commonly encountered in many big-data-related and industrial applications like recommender systems. When acquiring useful patterns from them, nonnegative matrix factorization (NMF) models have proven to be highly effective owing to their fine representativeness of the nonnegative data. However, current NMF techniques suffer from: 1) inefficiency in addressing HiDS matrices; and 2) constraints in their training schemes. To address these issues, this paper proposes to extract nonnegative latent factors (NLFs) from HiDS matrices via a novel inherently NLF (INLF) model. It bridges the output factors and decision variables via a single-element-dependent mapping function, thereby making the parameter training unconstrained and compatible with general training schemes on the premise of maintaining the nonnegativity constraints. Experimental results on six HiDS matrices arising from industrial applications indicate that INLF is able to acquire NLFs from them more efficiently than any existing method does.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Evaluating collaborative filtering recommender systems
Herlocker, J. L., Konstan, J. A., Terveen, L. G., & Riedl, J. T. (2004) · ACM Transactions on Information Systems · doi:10.1145/963770.963772 · Cited by 5,798
Probabilistic machine learning and artificial intelligence
Ghahramani, Z. (2015) · Nature · doi:10.1038/nature14541 · Cited by 1,995
Hogwild: A Lock-Free Approach to Parallelizing Stochastic Gradient Descent
Niu, F., Recht, B., Re, C., & Wright, S. J. (2011) · arXiv · doi:10.48550/arxiv.1106.5730 · Cited by 1,211 · cited 1×
“For instance, the parallel SGD [54], [55] can be adopted as the optimizer for INLF to extract NLFs from a huge Λ, and this process can be deployed on cloud facilities like the Apache Spark [47] for reducing the time cost.”
Method
Cited by
Position-Transitional Particle Swarm Optimization-Incorporated Latent Factor Analysis
Luo, X., Yuan, Y., Chen, S., Zeng, N., & Wang, Z. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2020.3033324 · Cited by 264
Self-citationAn overview of data-driven battery health estimation technology for battery management system
Chen, M., Ma, G., Liu, W., Zeng, N., & Luo, X. (2023) · Neurocomputing · doi:10.1016/j.neucom.2023.02.031 · Cited by 172
Self-citationMulti-Modal Stacked Denoising Autoencoder for Handling Missing Data in Healthcare Big Data
Kim, J.-C., & Chung, K. (2020) · IEEE Access · doi:10.1109/access.2020.2997255 · Cited by 56
Metadata
- Authors
- Luo, X., Zhou, M., Li, S., & Shang, M.
- Venue
- IEEE Transactions on Industrial Informatics
- Published
- 2018-05
- Volume
- 14
- Issue
- 5
- Pages
- 2011-2022
- ISSN
- 1551-3203 (ISSN-L)
- 1941-0050
- OpenAlex
- W2765820394
- Cited by
- 200
- References
- 3
- FWCI
- 11.23
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.