Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/105734
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Computing | - |
dc.creator | Luo, X | - |
dc.creator | Zhou, M | - |
dc.creator | Shang, M | - |
dc.creator | Li, S | - |
dc.creator | Xia, Y | - |
dc.date.accessioned | 2024-04-15T07:36:18Z | - |
dc.date.available | 2024-04-15T07:36:18Z | - |
dc.identifier.uri | http://hdl.handle.net/10397/105734 | - |
dc.language.iso | en | en_US |
dc.publisher | Institute of Electrical and Electronics Engineers | en_US |
dc.rights | © 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. | en_US |
dc.rights | Posted with permission of the publisher. | en_US |
dc.rights | The following publication X. Luo, M. Zhou, M. Shang, S. Li and Y. Xia, "A Novel Approach to Extracting Non-Negative Latent Factors From Non-Negative Big Sparse Matrices," in IEEE Access, vol. 4, pp. 2649-2655, 2016 is available at https://doi.org/10.1109/ACCESS.2016.2556680. | en_US |
dc.subject | Big Data | en_US |
dc.subject | Inherently Non-negative | en_US |
dc.subject | Latent Factors | en_US |
dc.subject | Non-negative Big Sparse Matrices | en_US |
dc.subject | Non-negativity | en_US |
dc.title | A novel approach to extracting non-negative latent factors from non-negative big sparse matrices | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.spage | 2649 | - |
dc.identifier.epage | 2655 | - |
dc.identifier.volume | 4 | - |
dc.identifier.doi | 10.1109/ACCESS.2016.2556680 | - |
dcterms.abstract | An inherently non-negative latent factor model is proposed to extract non-negative latent factors from non-negative big sparse matrices efficiently and effectively. A single-element-dependent sigmoid function connects output latent factors with decision variables, such that non-negativity constraints on the output latent factors are always fulfilled and thus successfully separated from the training process with respect to the decision variables. Consequently, the proposed model can be easily and fast built with excellent prediction accuracy. Experimental results on an industrial size sparse matrix are given to verify its outstanding performance and suitability for industrial applications. | - |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | IEEE access, 2016, v. 4, p. 2649-2655 | - |
dcterms.isPartOf | IEEE access | - |
dcterms.issued | 2016 | - |
dc.identifier.scopus | 2-s2.0-84979844540 | - |
dc.identifier.eissn | 2169-3536 | - |
dc.description.validate | 202402 bcch | - |
dc.description.oa | Version of Record | en_US |
dc.identifier.FolderNumber | COMP-1660 | en_US |
dc.description.fundingSource | Others | en_US |
dc.description.fundingText | Fundo para o Desenvolvimento das Ciências e da Tecnologia; National Natural Science Foundation of China; Young Scientist Foundation of Chongqing; Chongqing Research Program of Basic Research and Frontier Technology; Post-Doctoral Science Funded Project of Chongqing; Fundamental Research Funds for the Central Universities; Specialized Research Fund for the Doctoral Program of Higher Education | en_US |
dc.description.pubStatus | Published | en_US |
dc.identifier.OPUS | 6664429 | en_US |
dc.description.oaCategory | Publisher permission | en_US |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Luo_Novel_Approach_Extracting.pdf | 9.39 MB | Adobe PDF | View/Open |
Page views
15
Citations as of Jun 30, 2024
Downloads
4
Citations as of Jun 30, 2024
SCOPUSTM
Citations
70
Citations as of Jul 4, 2024
WEB OF SCIENCETM
Citations
64
Citations as of Jul 4, 2024
![](/image/google_scholar.jpg)
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.