default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJinshi Yu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j10]Jinshi Yu, Zhifu Li
, Ge Ma, Jingwen Wang, Tao Zou, Guoxu Zhou:
Low-rank sparse fully-connected tensor network for tensor completion. Pattern Recognit. 158: 111000 (2025)- 2023
- [j9]Jinshi Yu, Haonan Huang, Qi Duan, Yafei Wang, Tao Zou:
Incomplete Multiview Clustering via Low-Rank Tensor Ring Completion. Int. J. Intell. Syst. 2023: 1-15 (2023) - [j8]Jinshi Yu, Tao Zou, Guoxu Zhou:
Low tensor-ring rank completion: parallel matrix factorization with smoothness on latent space. Neural Comput. Appl. 35(9): 7003-7016 (2023) - [j7]Jinshi Yu, Guoxu Zhou, Weijun Sun, Shengli Xie:
Robust to Rank Selection: Low-Rank Sparse Tensor-Ring Completion. IEEE Trans. Neural Networks Learn. Syst. 34(5): 2451-2465 (2023) - 2022
- [j6]Jinshi Yu, Tao Zou, Guoxu Zhou:
Online subspace learning and imputation by Tensor-Ring decomposition. Neural Networks 153: 314-324 (2022) - [j5]Zhenhao Huang, Yuning Qiu, Jinshi Yu, Guoxu Zhou:
Multi-Aspect Streaming Tensor Ring Completion for Dynamic Incremental Data. IEEE Signal Process. Lett. 29: 2657-2661 (2022) - 2021
- [j4]Jinshi Yu, Guoxu Zhou, Chao Li, Qibin Zhao, Shengli Xie:
Low Tensor-Ring Rank Completion by Parallel Matrix Factorization. IEEE Trans. Neural Networks Learn. Syst. 32(7): 3020-3033 (2021) - 2020
- [j3]Jinshi Yu, Weijun Sun, Yuning Qiu, Yonghui Huang:
An Efficient Tensor Completion Method Via New Latent Nuclear Norm. IEEE Access 8: 126284-126296 (2020)
2010 – 2019
- 2019
- [c3]Chao Li, Zhun Sun, Jinshi Yu, Ming Hou, Qibin Zhao:
Low-rank Embedding of Kernels in Convolutional Neural Networks under Random Shuffling. ICASSP 2019: 3022-3026 - [c2]Jinshi Yu, Chao Li, Qibin Zhao, Guoxu Zhao:
Tensor-ring Nuclear Norm Minimization and Application for Visual : Data Completion. ICASSP 2019: 3142-3146 - [i4]Jinshi Yu, Chao Li, Qibin Zhao, Guoxu Zhou:
Tensor-Ring Nuclear Norm Minimization and Application for Visual Data Completion. CoRR abs/1903.08888 (2019) - [i3]Jinshi Yu, Weijun Sun, Yuning Qiu, Shengli Xie:
An Efficient Tensor Completion Method via New Latent Nuclear Norm. CoRR abs/1910.05986 (2019) - 2018
- [j2]Jinshi Yu, Guoxu Zhou, Andrzej Cichocki, Shengli Xie:
Learning the Hierarchical Parts of Objects by Deep Non-Smooth Nonnegative Matrix Factorization. IEEE Access 6: 58096-58105 (2018) - [c1]Jinshi Yu, Guoxu Zhou, Qibin Zhao, Kan Xie:
An Effective Tensor Completion Method Based on Multi-linear Tensor Ring Decomposition. APSIPA 2018: 1344-1349 - [i2]Jinshi Yu, Guoxu Zhou, Andrzej Cichocki, Shengli Xie:
Learning the Hierarchical Parts of Objects by Deep Non-Smooth Nonnegative Matrix Factorization. CoRR abs/1803.07226 (2018) - [i1]Chao Li, Zhun Sun, Jinshi Yu, Ming Hou, Qibin Zhao:
Low-Rank Embedding of Kernels in Convolutional Neural Networks under Random Shuffling. CoRR abs/1810.13098 (2018) - 2017
- [j1]Kan Xie, Jinshi Yu, Chuan Lu:
A new canonical polyadic decomposition algorithm with improved stability and its applications to biomedical signal processing. Clust. Comput. 20(2): 1449-1455 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
