Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Xiaowei Zhong

dblp:54/1330 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
1since 2021 · last 2022
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Mathematical optimization · 91% Algorithms and data structures · 9%
Artificial intelligence
1 paper
Representation and self-supervised learning · 100%

Topics — the 5 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › word representation
word embedding
0.212015
Word Embedding Revisited: A New Representation Learning and Explicit Matrix Factorization Perspective · IJCAI 2015
Machine learning › Representation and self-supervised learning
word representation
0.212015
Word Embedding Revisited: A New Representation Learning and Explicit Matrix Factorization Perspective · IJCAI 2015
Mathematical optimization
nonconvex optimization
0.212015
A Nonconvex Relaxation Approach for Rank Minimization Problems · AAAI 2015
Mathematical optimization › nonconvex optimization
nonconvex relaxation
0.212015
A Nonconvex Relaxation Approach for Rank Minimization Problems · AAAI 2015
Mathematical optimization › continuous optimization › matrix optimization
rank minimization
0.212015
A Nonconvex Relaxation Approach for Rank Minimization Problems · AAAI 2015

Methods — techniques the papers use, named apart from their topics

reweighted nuclear norm · 0.2matrix factorization · 0.2iterative shrinkage/thresholding · 0.2
YearPublicationVenuePosition
2022 Application research of "5G + Chinese medicine service" in the prevention and control of COVID-19 epidemic
abstract
During the regularized COVID-19 epidemic control, the regional TCM intelligent cloud system is extended to the isolated medical observation sites through 5G technology. Combined with the advantages of local Chinese medicine hospitals, TCM services such as TCM preparations and TCM remote diagnosis and treatment were provided to personnel at isolated medical observation sites. These services not only reduce the risk of COVID-19 infection, but also relieve the anxiety of those under isolation and medical observation. “5G + TCM services” gives full play to the important role of TCM in the prevention and control of epidemics and provides epidemic prevention and control solutions suitable for China.
Xiaowei Zhong, Hanqing Ma
BIBM1
2015 A Nonconvex Relaxation Approach for Rank Minimization Problems
abstract
Recently, solving rank minimization problems by leveraging nonconvex relaxations has received significant attention. Some theoretical analyses demonstrate that it can provide a better approximation of original problems than convex relaxations. However, designing an effective algorithm to solve nonconvex optimization problems remains a big challenge. In this paper, we propose an Iterative Shrinkage-Thresholding and Reweighted Algorithm (ISTRA) to solve rank minimization problems using the nonconvex weighted nuclear norm as a low rank regularizer. We prove theoretically that under certain assumptions our method achieves a high-quality local optimal solution efficiently. Experimental results on synthetic and real data show that the proposed ISTRA algorithm outperforms state-of-the-art methods in both accuracy and efficiency.
Xiaowei Zhong, Linli Xu 0002, Yitan Li, Enhong Chen
AAAI1
2015 Word Embedding Revisited: A New Representation Learning and Explicit Matrix Factorization Perspective
Yitan Li, Linli Xu 0002, Xiaowei Zhong, Enhong Chen
IJCAI5