Lianping Yang

Dr. Lianping Yang


Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
7 October 2020
Verified
Book Chapter
Closed access
PDF file
BNBen Niu
Ben Niu
WWWeilei Wen
Weilei Wen
WRWenqi Ren
Wenqi Ren
XZXiangde Zhang
Xiangde Zhang
LYLianping Yang
Lianping Yang
HSHaifeng Shen
Haifeng Shen

14 March 2017 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
MZMengge Zhang
Mengge Zhang
LYLianping Yang
Lianping Yang
JRJie Ren
Jie Ren
NANathan Ahlgren
Nathan Ahlgren
JFJed A. Fuhrman
Jed A. Fuhrman
FSFengzhu Sun
Fengzhu Sun
The study of virus-host infectious association is important for understanding the functions and dynamics of microbial communities. Both cellular and fractionated viral metagenomic data generate a large number of viral contigs with missing host information. Although relative simple methods based on the similarity between the word frequency vectors of viruses and bacterial hosts have been developed to study virus-host associations, the problem is significantly understudied. We hypothesize that machine learning methods based on word frequencies can be efficiently used to study virus-host infectious associations. We investigate four different representations of word frequencies of viral sequences including the relative word frequency and three normalized word frequencies by subtracting the number of expected from the observed word counts. We also study five machine learning methods including logistic regression, support vector machine, random forest, Gaussian naive Bayes and Bernoulli naive Bayes for separating infectious from non-infectious viruses for nine bacterial host genera with at least 45 infecting viruses. Area under the receiver operating characteristic curve (AUC) is used to compare the performance of different machine learning method and feature combinations. We then evaluate the performance of the best method for the identification of the hosts of contigs in metagenomic studies. We also develop a maximum likelihood method to estimate the fraction of true infectious viruses for a given host in viral tagging experiments. Based on nine bacterial host genera with at least 45 infectious viruses, we show that random forest together with the relative word frequency vector performs the best in identifying viruses infecting particular hosts. For all the nine host genera, the AUC is over 0.85 and for five of them, the AUC is higher than 0.98 when the word size is 6 indicating the high accuracy of using machine learning approaches for identifying viruses infecting particular hosts. We also show that our method can predict the hosts of viral contigs of length at least 1kbps in metagenomic studies with high accuracy. The random forest together with word frequency vector outperforms current available methods based on Manhattan and d 2 ∗ $d_{2}^{*}$ dissimilarity measures. Based on word frequencies, we estimate that about 95% of the identified T4-like viruses in viral tagging experiment infect Synechococcus, while only about 29% of the identified non-T4-like viruses and 30% of the contigs in the study potentially infect Synechococcus. The random forest machine learning method together with the relative word frequencies as features of viruses can be used to predict viruses and viral contigs for specific bacterial hosts. The maximum likelihood approach can be used to estimate the fraction of true infectious associated viruses in viral tagging experiments.

1 September 2009 in Journal of Molecular Structure: THEOCHEM
Verified
Journal Article
Closed access
SZShengli Zhang
Shengli Zhang
LYLianping Yang
Lianping Yang
Tianming WangTianming Wang
Tianming Wang

21 January 2022 in IEEE Transactions on Instrumentation and Measurement
Verified
Journal Article
Closed access
HZHegui Zhu
Hegui Zhu
RXRuoyang Xiao
Ruoyang Xiao
JZJiapeng Zhang
Jiapeng Zhang
JLJinhai Liu
Jinhai Liu
CLChengqing Li
Chengqing Li
LYLianping Yang
Lianping Yang
Driving risk classification is usually used for evaluating and reducing traffic accidents. It is of great significance to improve urban traffic problems, such as traffic jams and road accidents. Most related works use different representation methods with the data from the advanced driving assistance system and then use statistical approaches or machine learning to analyze the driving risk. However, because of the unbalance of positive and negative samples, the performance is usually not satisfactory. In this article, we propose a driving risk classification method via unbalanced time series samples. It first employs MeanShift with automatic bandwidth to cluster samples and expand its volume according to similarity. Then, it adopts a regional division module to simulate the outside environment and extracts state transition features by the Markov feature module to get more detailed information. By combining the stacking classification module with three convolutional neural networks, the performance is further improved. Finally, a city transfer module is designed with the drivers’ inherent attributes and sample weights to enhance the generalization of the model. The experimental results verify the effectiveness and generality of the classification model on driving risk. It can also be transferred to time series analysis in other fields.

8 December 2020
Verified
Book Chapter
Closed access
PDF file
BNBen Niu
Ben Niu
WWWeilei Wen
Weilei Wen
WRWenqi Ren
Wenqi Ren
XZXiangde Zhang
Xiangde Zhang
LYLianping Yang
Lianping Yang
HSHaifeng Shen
Haifeng Shen

1 April 2016 in Journal of Theoretical Biology
Verified
Journal Article
Closed access
LYLianping Yang
Lianping Yang
XZXiangde Zhang
Xiangde Zhang
HFHaoyue Fu
Haoyue Fu
CYChenhui Yang
Chenhui Yang