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

Yuanwei Zhang

dblp:48/9532 · DBLP profile ↗
← Back
11ranked-venue papers
5as first author
5since 2021 · last 2025
0000-0002-2814-8061ORCID · conflict

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

Applied, interdisciplinary, general and emerging computing · 8 · 3 first-author · 2 since 2021Human-computer interaction and ubiquitous computing · 2 · 1 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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 · 100%
Interdisciplinary, comprehensive, and emerging computing
4 papers
Bioinformatics and computational biology · 100%
Human-computer interaction and pervasive computing
1 paper
Interaction techniques and input · 67% Health and well-being technologies · 33%

Topics — the 14 heaviest of 15, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Mathematical optimization › tensor optimization › tensor recovery › low-rank tensor recovery › tensor completion
low-rank tensor completion
0.912025
Preconditioned Riemannian Gradient Descent Algorithm for Low-Multilinear-Rank Tensor Completion · ICML 2025
Mathematical optimization › riemannian optimization
riemannian gradient descent
0.912025
Preconditioned Riemannian Gradient Descent Algorithm for Low-Multilinear-Rank Tensor Completion · ICML 2025
Mathematical optimization
riemannian optimization
0.912025
Preconditioned Riemannian Gradient Descent Algorithm for Low-Multilinear-Rank Tensor Completion · ICML 2025
Mathematical optimization › tensor optimization › tensor recovery › low-rank tensor recovery
tensor completion
0.912025
Preconditioned Riemannian Gradient Descent Algorithm for Low-Multilinear-Rank Tensor Completion · ICML 2025
Interaction techniques and input › text entry
mobile text entry
0.512021
Facilitating Text Entry on Smartphones with QWERTY Keyboard for Users with Parkinson's Disease · CHI 2021
Health and well-being technologies
parkinson's disease
0.512021
Facilitating Text Entry on Smartphones with QWERTY Keyboard for Users with Parkinson's Disease · CHI 2021
Bioinformatics and computational biology › transcriptomics › transcriptome sequencing
small RNA sequencing
0.422017
CPSS 2.0: a computational platform update for the analysis of small RNA sequencing data · Bioinform. 2017
CPSS: a computational platform for the analysis of small RNA deep sequencing data · Bioinform. 2012
Bioinformatics and computational biology › transcriptomics
non-coding RNA analysis
0.422017
CPSS 2.0: a computational platform update for the analysis of small RNA sequencing data · Bioinform. 2017
Prediction of novel pre-microRNAs with high accuracy through boosting and SVM · Bioinform. 2011
Bioinformatics and computational biology › sequence analysis › RNA sequence analysis
microRNA analysis
0.212016
IsomiR Bank: a research resource for tracking IsomiRs · Bioinform. 2016
Bioinformatics and computational biology › gene regulation › microRNA biology
microRNA functional analysis
0.112012
CPSS: a computational platform for the analysis of small RNA deep sequencing data · Bioinform. 2012
Bioinformatics and computational biology › RNA biology › RNA analysis › RNA bioinformatics
microRNA prediction
0.112011
Prediction of novel pre-microRNAs with high accuracy through boosting and SVM · Bioinform. 2011
Bioinformatics and computational biology › transcriptomics › non-coding RNA analysis
pre-miRNA prediction
0.112011
Prediction of novel pre-microRNAs with high accuracy through boosting and SVM · Bioinform. 2011
Bioinformatics and computational biology › gene expression analysis
differential expression analysis
0.112017
CPSS 2.0: a computational platform update for the analysis of small RNA sequencing data · Bioinform. 2017
Bioinformatics and computational biology › gene regulation › post-transcriptional regulation
post-transcriptional modification
0.112016
IsomiR Bank: a research resource for tracking IsomiRs · Bioinform. 2016

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

preconditioned riemannian metric · 0.9multilinear rank · 0.9user study · 0.5statistical decoding · 0.5elastic probabilistic model · 0.5sequence profiling · 0.3enrichment analysis · 0.2CPSS algorithm · 0.2pathway analysis · 0.1next-generation sequencing analysis · 0.1gene ontology enrichment · 0.1support vector machine · 0.1feature selection · 0.1boosting · 0.1
YearPublicationVenuePosition
2025 Preconditioned Riemannian Gradient Descent Algorithm for Low-Multilinear-Rank Tensor Completion
abstract
Tensors play a crucial role in numerous scientific and engineering fields. This paper addresses the low-multilinear-rank tensor completion problem, a fundamental task in tensor-related applications. By exploiting the manifold structure inherent to the fixed-multilinear-rank tensor set, we introduce a simple yet highly effective preconditioned Riemannian metric and propose the Preconditioned Riemannian Gradient Descent (PRGD) algorithm. Compared to the standard Riemannian Gradient Descent (RGD), PRGD achieves faster convergence while maintaining the same order of per-iteration computational complexity. Theoretically, we provide the recovery guarantee for PRGD under near-optimal sampling complexity. Numerical results highlight the efficiency of PRGD, outperforming state-of-the-art methods on both synthetic data and real-world video inpainting tasks.
Yuanwei Zhang, Fengmiao Bian, Xiaoqun Zhang, Jian-Feng Cai 0001
ICML1
2025 ProjectSVR: mapping single-cell RNA-seq data to reference atlases by supported vector regression
abstract
Mapping the query cells onto a well-constructed reference atlas, known as reference mapping, enables robust, reproducible interpretation of new single-cell RNA-seq data in the context of curated and annotated cell subtypes and states. However, existing methods often rely on complex integration frameworks or require re-access to raw data, limiting their applicability and reproducibility. To address this, we introduce ProjectSVR, a machine learning-based framework that formulates reference mapping as a multi-target regression task. By leveraging ensemble support vector regression (SVR) to learn the relationship between gene set activity scores and low-dimensional reference embeddings, ProjectSVR enables platform-agnostic and integration-independent mapping. Benchmarking across diverse biological contexts-including immune responses, developmental trajectories, and disease states-demonstrates that ProjectSVR achieves comparable accuracy and robustness to state-of-the-art methods, with reduced dependence on data-specific preprocessing. Our findings demonstrate that ProjectSVR is a valuable tool for reference mapping, considerably simplifying the analysis of scRNA-seq data when well-constructed reference atlases are available.
Jianing Gao, Jinman Fang, Qizhi Zhu, Guoshu Li, Ziran Bi, Yuanwei Zhang, Shipeng Guo
Briefings Bioinform.8
2022 EnergyHair: Sketch-Based Interactive Guide Hair Design Using Physics-Inspired Energy
Yuanwei Zhang, Shinichi Kinuwaki, Nobuyuki Umetani
Graphics Interface1
2021 Facilitating Text Entry on Smartphones with QWERTY Keyboard for Users with Parkinson's Disease
abstract
QWERTY is the primary smartphone text input keyboard configuration. However, insertion and substitution errors caused by hand tremors, often experienced by users with Parkinson’s disease, can severely affect typing efficiency and user experience. In this paper, we investigated Parkinson’s users’ typing behavior on smartphones. In particular, we identified and compared the typing characteristics generated by users with and without Parkinson’s symptoms. We then proposed an elastic probabilistic model for input prediction. By incorporating both spatial and temporal features, this model generalized the classical statistical decoding algorithm to correct insertion, substitution and omission errors, while maintaining direct physical interpretation. User study results confirmed that the proposed algorithm outperformed baseline techniques: users reached 22.8 WPM typing speed with a significantly lower error rate and higher user-perceived performance and preference. We concluded that our method could effectively improve the text entry experience on smartphones for users with Parkinson’s disease.
Yuntao Wang 0001, Ao Yu, Xin Yi 0001, Yuanwei Zhang, Ishan Chatterjee, Shwetak N. Patel, Yuanchun Shi
CHI4
2021 PedMiner: a tool for linkage analysis-based identification of disease-associated variants using family based whole-exome sequencing data
abstract
With the advances of next-generation sequencing technology, the field of disease research has been revolutionized. However, pinpointing the disease-causing variants from millions of revealed variants is still a tough task. Here, we have reviewed the existing linkage analysis tools and presented PedMiner, a web-based application designed to narrow down candidate variants from family based whole-exome sequencing (WES) data through linkage analysis. PedMiner integrates linkage analysis, variant annotation and prioritization in one automated pipeline. It provides graphical visualization of the linked regions along with comprehensive annotation of variants and genes within these linked regions. This efficient and comprehensive application will be helpful for the scientific community working on Mendelian inherited disorders using family based WES data.
Jianteng Zhou, Jianing Gao, Daren Zhao, Ao Li 0001, Furhan Iqbal, Qinghua Shi, Yuanwei Zhang
Briefings Bioinform.8
2020 SimuSCoP: reliably simulate Illumina sequencing data based on position and context dependent profiles
abstract
BACKGROUND: A number of simulators have been developed for emulating next-generation sequencing data by incorporating known errors such as base substitutions and indels. However, their practicality may be degraded by functional and runtime limitations. Particularly, the positional and genomic contextual information is not effectively utilized for reliably characterizing base substitution patterns, as well as the positional and contextual difference of Phred quality scores is not fully investigated. Thus, a more effective and efficient bioinformatics tool is sorely required. RESULTS: Here, we introduce a novel tool, SimuSCoP, to reliably emulate complex DNA sequencing data. The base substitution patterns and the statistical behavior of quality scores in Illumina sequencing data are fully explored and integrated into the simulation model for reliably emulating datasets for different applications. In addition, an integrated and easy-to-use pipeline is employed in SimuSCoP to facilitate end-to-end simulation of complex samples, and high runtime efficiency is achieved by implementing the tool to run in multithreading with low memory consumption. These features enable SimuSCoP to gets substantial improvements in reliability, functionality, practicality and runtime efficiency. The tool is comprehensively evaluated in multiple aspects including consistency of profiles, simulation of genomic variations and complex tumor samples, and the results demonstrate the advantages of SimuSCoP over existing tools. CONCLUSIONS: SimuSCoP, a new bioinformatics tool is developed to learn informative profiles from real sequencing data and reliably mimic complex data by introducing various genomic variations. We believe that the presented work will catalyse new development of downstream bioinformatics methods for analyzing sequencing data.
Zhenhua Yu 0002, Fang Du, Rongjun Ban, Yuanwei Zhang
BMC Bioinform.4
2017 CPSS 2.0: a computational platform update for the analysis of small RNA sequencing data
abstract
SUMMARY: Next-generation sequencing has been widely applied to understand the complexity of non-coding RNAs (ncRNAs) in the last decades. Here, we present CPSS 2.0, an updated version of CPSS 1.0 for small RNA sequencing data analysis, with the following improvements: (i) a substantial increase of supported species from 10 to 48; (ii) improved strategies applied to detect ncRNAs; (iii) more ncRNAs can be detected and profiled, such as lncRNA and circRNA; (iv) identification of differentially expressed ncRNAs among multiple samples; (v) enhanced visualization interface containing graphs and charts in detailed analysis results. The new version of CPSS is an efficient bioinformatics tool for users in non-coding RNA research. AVAILABILITY AND IMPLEMENTATION: CPSS 2.0 is implemented in PHP + Perl + R and can be freely accessed at http://114.214.166.79/cpss2.0/. CONTACT: [email protected] or [email protected]. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Changlin Wan, Jianing Gao, Xiaohua Jiang, Qiguang Zang, Rongjun Ban, Yuanwei Zhang, Qinghua Shi
Bioinform.7
2017 Anaconda: AN automated pipeline for somatic COpy Number variation Detection and Annotation from tumor exome sequencing data
abstract
BACKGROUND: Copy number variations (CNVs) are the main genetic structural variations in cancer genome. Detecting CNVs in genetic exome region is efficient and cost-effective in identifying cancer associated genes. Many tools had been developed accordingly and yet these tools lack of reliability because of high false negative rate, which is intrinsically caused by genome exonic bias. RESULTS: To provide an alternative option, here, we report Anaconda, a comprehensive pipeline that allows flexible integration of multiple CNV-calling methods and systematic annotation of CNVs in analyzing WES data. Just by one command, Anaconda can generate CNV detection result by up to four CNV detecting tools. Associated with comprehensive annotation analysis of genes involved in shared CNV regions, Anaconda is able to deliver a more reliable and useful report in assistance with CNV-associate cancer researches. CONCLUSION: Anaconda package and manual can be freely accessed at http://mcg.ustc.edu.cn/bsc/ANACONDA/ .
Jianing Gao, Changlin Wan, Ao Li 0001, Qiguang Zang, Rongjun Ban, Asim Ali, Zhenghua Yu, Qinghua Shi, Xiaohua Jiang, Yuanwei Zhang
BMC Bioinform.11
2016 IsomiR Bank: a research resource for tracking IsomiRs
abstract
UNLABELLED: : Next-Generation Sequencing (NGS) technology has revealed that microRNAs (miRNAs) are capable of exhibiting frequent differences from their corresponding mature reference sequences, generating multiple variants: the isoforms of miRNAs (isomiRs). These isomiRs mainly originate via the imprecise and alternative cleavage during the pre-miRNA processing and post-transcriptional modifications that influence miRNA stability, their sub-cellular localization and target selection. Although several tools for the identification of isomiR have been reported, no bioinformatics resource dedicated to gather isomiRs from public NGS data and to provide functional analysis of these isomiRs is available to date. Thus, a free online database, IsomiR Bank has been created to integrate isomiRs detected by our previously published algorithm CPSS. In total, 2727 samples (Small RNA NGS data downloaded from ArrayExpress) from eight species (Arabidopsis thaliana, Drosophila melanogaster, Danio rerio, Homo sapiens, Mus musculus, Oryza sativa, Solanum lycopersicum and Zea mays) are analyzed. At present, 308 919 isomiRs from 4706 mature miRNAs are collected into IsomiR Bank. In addition, IsomiR Bank provides target prediction and enrichment analysis to evaluate the effects of isomiRs on target selection. AVAILABILITY AND IMPLEMENTATION: IsomiR Bank is implemented in PHP/PERL + MySQL + R format and can be freely accessed at http://mcg.ustc.edu.cn/bsc/isomir/ CONTACTS: : [email protected] or [email protected] SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Yuanwei Zhang, Qiguang Zang, Rongjun Ban, Yifan Yang 0001, QiaoMei Hao, Furhan Iqbal, Ao Li 0001, Qinghua Shi
Bioinform.1
2012 CPSS: a computational platform for the analysis of small RNA deep sequencing data
abstract
UNLABELLED: Next generation sequencing (NGS) techniques have been widely used to document the small ribonucleic acids (RNAs) implicated in a variety of biological, physiological and pathological processes. An integrated computational tool is needed for handling and analysing the enormous datasets from small RNA deep sequencing approach. Herein, we present a novel web server, CPSS (a computational platform for the analysis of small RNA deep sequencing data), designed to completely annotate and functionally analyse microRNAs (miRNAs) from NGS data on one platform with a single data submission. Small RNA NGS data can be submitted to this server with analysis results being returned in two parts: (i) annotation analysis, which provides the most comprehensive analysis for small RNA transcriptome, including length distribution and genome mapping of sequencing reads, small RNA quantification, prediction of novel miRNAs, identification of differentially expressed miRNAs, piwi-interacting RNAs and other non-coding small RNAs between paired samples and detection of miRNA editing and modifications and (ii) functional analysis, including prediction of miRNA targeted genes by multiple tools, enrichment of gene ontology terms, signalling pathway involvement and protein-protein interaction analysis for the predicted genes. CPSS, a ready-to-use web server that integrates most functions of currently available bioinformatics tools, provides all the information wanted by the majority of users from small RNA deep sequencing datasets. AVAILABILITY: CPSS is implemented in PHP/PERL+MySQL+R and can be freely accessed at http://mcg.ustc.edu.cn/db/cpss/index.html or http://mcg.ustc.edu.cn/sdap1/cpss/index.html.
Yuanwei Zhang, Yifan Yang 0001, Rongjun Ban, Xiaohua Jiang, Howard J. Cooke, Yu Xue 0001, Qinghua Shi
Bioinform.1
2011 Prediction of novel pre-microRNAs with high accuracy through boosting and SVM
abstract
UNLABELLED: High-throughput deep-sequencing technology has generated an unprecedented number of expressed short sequence reads, presenting not only an opportunity but also a challenge for prediction of novel microRNAs. To verify the existence of candidate microRNAs, we have to show that these short sequences can be processed from candidate pre-microRNAs. However, it is laborious and time consuming to verify these using existing experimental techniques. Therefore, here, we describe a new method, miRD, which is constructed using two feature selection strategies based on support vector machines (SVMs) and boosting method. It is a high-efficiency tool for novel pre-microRNA prediction with accuracy up to 94.0% among different species. AVAILABILITY: miRD is implemented in PHP/PERL+MySQL+R and can be freely accessed at http://mcg.ustc.edu.cn/rpg/mird/mird.php.
Yuanwei Zhang, Yifan Yang 0001, Xiaohua Jiang, Yu Xue 0001, Yunxia Cao, Qian Zhai, Yong Zhai, Mingqing Xu, Howard J. Cooke, Qinghua Shi
Bioinform.1