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

Yulan Liang

dblp:68/4435 · DBLP profile ↗
← Back
10ranked-venue papers
6as first author
0since 2021 · last 2018
0000-0001-6792-488XORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 5 · 4 first-authorArtificial intelligence and machine learning · 3 · 1 first-authorDatabases, data management, data science and information retrieval · 2 · 2 first-authorHuman-computer interaction and ubiquitous computing · 1

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.

Interdisciplinary, comprehensive, and emerging computing
2 papers
Bioinformatics and computational biology · 100%
Artificial intelligence
1 paper
Deep learning architectures and training · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › gene expression analysis
differential expression analysis
0.112005
Differential and trajectory methods for time course gene expression data · Bioinform. 2005
Bioinformatics and computational biology › gene expression analysis
time course gene expression analysis
0.112005
Differential and trajectory methods for time course gene expression data · Bioinform. 2005
Bioinformatics and computational biology › single-cell analysis
trajectory clustering
0.112005
Differential and trajectory methods for time course gene expression data · Bioinform. 2005
Bioinformatics and computational biology
gene expression analysis
0.012002
Mining heterogeneous gene expression data with time lagged recurrent neural networks · KDD 2002
Bioinformatics and computational biology › gene expression analysis
gene expression classification
0.012002
Mining heterogeneous gene expression data with time lagged recurrent neural networks · KDD 2002
Machine learning › Deep learning architectures and training
recurrent neural network
0.012002
Mining heterogeneous gene expression data with time lagged recurrent neural networks · KDD 2002

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

trajectory learning · 0.1time lagged recurrent neural network · 0.1backpropagation through time · 0.1permutation test · 0.1mixed effects model · 0.1bootstrapping · 0.1bayesian model · 0.1
YearPublicationVenuePosition
2018 Dynamic modeling and network approaches for omics time course data: overview of computational approaches and applications
abstract
Inferring networks and dynamics of genes, proteins, cells and other biological entities from high-throughput biological omics data is a central and challenging issue in computational and systems biology. This is essential for understanding the complexity of human health, disease susceptibility and pathogenesis for Predictive, Preventive, Personalized and Participatory (P4) system and precision medicine. The delineation of the possible interactions of all genes/proteins in a genome/proteome is a task for which conventional experimental techniques are ill suited. Urgently needed are rapid and inexpensive computational and statistical methods that can identify interacting candidate disease genes or drug targets out of thousands that can be further investigated or validated by experimentations. Moreover, identifying biological dynamic systems, and simultaneously estimating the important kinetic structural and functional parameters, which may not be experimentally accessible could be important directions for drug-disease-gene network studies. In this article, we present an overview and comparison of recent developments of dynamic modeling and network approaches for time-course omics data, and their applications to various biological systems, health conditions and disease statuses. Moreover, various data reduction and analytical schemes ranging from mathematical to computational to statistical methods are compared including their merits, drawbacks and limitations. The most recent software, associated web resources and other potentials for the compared methods are also presented and discussed in detail.
Yulan Liang, Arpad Kelemen
Briefings Bioinform.1
2012 Effect of performance feedback (or lack thereof) on driver calibration
abstract
Many drivers are miscalibrated, i.e. they think they are better or worse than they actually are at multitasking situations. Recent studies focused on calibration while driving show that drivers are miscalibrated, either over confident or under confident, and that this effect changes under different conditions. Previous work has demonstrated behavioral and performance benefits of feedback, yet these studies have not explicitly examined the issue of calibration. Therefore, the main goal of this study was to examine effect of feedback on calibration using an instrumented van and test track, employing a well-defined method to assess calibration. Twenty-four drivers completed a series of driving tasks on a test track. Half of the participants received performance feedback while the other half received no feedback. Calibration was assessed through comparison of drivers' subjective ratings of performance and confidence to objective performance measures. Results indicated that participants' calibration improved over time, but there was no consistent effect of feedback. In some cases, the Feedback group performed worse than those who did not receive feedback.
Shannon C. Roberts, William J. Horrey, Yulan Liang
AutomotiveUI3
2009 Computational Intelligence in Bioinformatics: SNP/Haplotype Data in Genetic Association Study for Common Diseases
abstract
Comprehensive evaluation of common genetic variations through association of single-nucleotide polymorphism (SNP) structure with common complex disease in the genome-wide scale is currently a hot area in human genome research due to the recent development of the Human Genome Project and HapMap Project. Computational science, which includes computational intelligence (CI), has recently become the third method of scientific enquiry besides theory and experimentation. There have been fast growing interests in developing and applying CI in disease mapping using SNP and haplotype data. Some of the recent studies have demonstrated the promise and importance of CI for common complex diseases in genomic association study using SNP/haplotype data, especially for tackling challenges, such as gene-gene and gene-environment interactions, and the notorious "curse of dimensionality" problem. This review provides coverage of recent developments of CI approaches for complex diseases in genetic association study with SNP/haplotype data.
Arpad Kelemen, Athanasios V. Vasilakos, Yulan Liang
IEEE Trans. Inf. Technol. Biomed.3
2008 Bayesian models and meta analysis for multiple tissue gene expression data following corticosteroid administration
abstract
BACKGROUND: This paper addresses key biological problems and statistical issues in the analysis of large gene expression data sets that describe systemic temporal response cascades to therapeutic doses in multiple tissues such as liver, skeletal muscle, and kidney from the same animals. Affymetrix time course gene expression data U34A are obtained from three different tissues including kidney, liver and muscle. Our goal is not only to find the concordance of gene in different tissues, identify the common differentially expressed genes over time and also examine the reproducibility of the findings by integrating the results through meta analysis from multiple tissues in order to gain a significant increase in the power of detecting differentially expressed genes over time and to find the differential differences of three tissues responding to the drug. RESULTS AND CONCLUSION: Bayesian categorical model for estimating the proportion of the 'call' are used for pre-screening genes. Hierarchical Bayesian Mixture Model is further developed for the identifications of differentially expressed genes across time and dynamic clusters. Deviance information criterion is applied to determine the number of components for model comparisons and selections. Bayesian mixture model produces the gene-specific posterior probability of differential/non-differential expression and the 95% credible interval, which is the basis for our further Bayesian meta-inference. Meta-analysis is performed in order to identify commonly expressed genes from multiple tissues that may serve as ideal targets for novel treatment strategies and to integrate the results across separate studies. We have found the common expressed genes in the three tissues. However, the up/down/no regulations of these common genes are different at different time points. Moreover, the most differentially expressed genes were found in the liver, then in kidney, and then in muscle.
Yulan Liang, Arpad Kelemen
BMC Bioinform.1
2007 Real-Time Detection of Driver Cognitive Distraction Using Support Vector Machines
abstract
As use of in-vehicle information systems (IVISs) such as cell phones, navigation systems, and satellite radios has increased, driver distraction has become an important and growing safety concern. A promising way to overcome this problem is to detect driver distraction and adapt in-vehicle systems accordingly to mitigate such distractions. To realize this strategy, this paper applied support vector machines (SVMs), which is a data mining method, to develop a real-time approach for detecting cognitive distraction using drivers' eye movements and driving performance data. Data were collected in a simulator experiment in which ten participants interacted with an IVIS while driving. The data were used to train and test both SVM and logistic regression models, and three different model characteristics were investigated: how distraction was defined, which data were input to the model, and how the input data were summarized. The results show that the SVM models were able to detect driver distraction with an average accuracy of 81.1%, outperforming more traditional logistic regression models. The best performing model (96.1% accuracy) resulted when distraction was defined using experimental conditions (i.e., IVIS drive or baseline drive), the input data were comprised of eye movement and driving measures, and these data were summarized over a 40-s window with 95% overlap of windows. These results demonstrate that eye movements and simple measures of driving performance can be used to detect driver distraction in real time. Potential applications of this paper include the design of adaptive in-vehicle systems and the evaluation of driver distraction
Yulan Liang, Michelle L. Reyes, John D. Lee
IEEE Trans. Intell. Transp. Syst.1
2005 Differential and trajectory methods for time course gene expression data
abstract
MOTIVATION: The issue of high dimensionality in microarray data has been, and remains, a hot topic in statistical and computational analysis. Efficient gene filtering and differentiation approaches can reduce the dimensions of data, help to remove redundant genes and noises, and highlight the most relevant genes that are major players in the development of certain diseases or the effect of drug treatment. The purpose of this study is to investigate the efficiency of parametric (including Bayesian and non-Bayesian, linear and non-linear), non-parametric and semi-parametric gene filtering methods through the application of time course microarray data from multiple sclerosis patients being treated with interferon-beta-1a. The analysis of variance with bootstrapping (parametric), class dispersion (semi-parametric) and Pareto (non-parametric) with permutation methods are presented and compared for filtering and finding differentially expressed genes. The Bayesian linear correlated model, the Bayesian non-linear model the and non-Bayesian mixed effects model with bootstrap were also developed to characterize the differential expression patterns. Furthermore, trajectory-clustering approaches were developed in order to investigate the dynamic patterns and inter-dependency of drug treatment effects on gene expression. RESULTS: Results show that the presented methods performed significant differently but all were adequate in capturing a small number of the potentially relevant genes to the disease. The parametric method, such as the mixed model and two Bayesian approaches proved to be more conservative. This may because these methods are based on overall variation in expression across all time points. The semi-parametric (class dispersion) and non-parametric (Pareto) methods were appropriate in capturing variation in expression from time point to time point, thereby making them more suitable for investigating significant monotonic changes and trajectories of changes in gene expressions in time course microarray data. Also, the non-linear Bayesian model proved to be less conservative than linear Bayesian correlated growth models to filter out the redundant genes, although the linear model showed better fit than non-linear model (smaller DIC). We also report the trajectories of significant genes-since we have been able to isolate trajectories of genes whose regulations appear to be inter-dependent.
Yulan Liang, Bamidele Tayo, Xueya Cai, Arpad Kelemen
Bioinform.1
2003 Bayesian regularized neural network for multiple gene expression pattern classification
abstract
We developed Bayesian regularized neural network (BRNN) to characterize multiple gene expression temporal patterns from microarray experiments. One of its attractive property is that it takes into account both the high level noisy feature from microarray data and the uncertainties of the multiple models uniformly in order to avoid overfitting and to improve the generalization performance. Results are encouraging and comparison study with other popular methods is provided.
Arpad Kelemen, Yulan Liang
IJCNN2
2003 Naive Bayesian classifier for microarray data
abstract
Comparing with more sophisticated classifiers, the naive Bayesian classifier greatly simplifies learning by assuming that the attribute values are conditionally independent given the class. Although independence is a strong assumption, in practice naive Bayesian classifier often competes with other complex classifiers and naive Bayesian algorithm works well for classifying text documents. In this paper, we present our invented technique, called "attribute grouping" for data preprocessing. The naive Bayesian algorithm is implemented for classifying multiple gene expression patterns from microarray experiments. Results show that attribute grouping is very effective and that the naive Bayesian classifier becomes a suitable classification method for microarray data when the attribute grouping is used.
Arpad Kelemen, Pamela Lawhead, Yulan Liang
IJCNN4
2002 Mining heterogeneous gene expression data with time lagged recurrent neural networks
abstract
Heterogeneous types of gene expressions may provide a better insight into the biological role of gene interaction with the environment, disease development and drug effect at the molecular level. In this paper for both exploring and prediction purposes a Time Lagged Recurrent Neural Network with trajectory learning is proposed for identifying and classifying the gene functional patterns from the heterogeneous nonlinear time series microarray experiments. The proposed procedures identify gene functional patterns from the dynamics of a state-trajectory learned in the heterogeneous time series and the gradient information over time. Also, the trajectory learning with Backpropagation through time algorithm can recognize gene expression patterns vary over time. This may reveal much more information about the regulatory network underlying gene expressions. The analyzed data were extracted from spotted DNA microarrays in the budding yeast expression measurements, produced by Eisen et al. The gene matrix contained 79 experiments over a variety of heterogeneous experiment conditions. The number of recognized gene patterns in our study ranged from two to ten and were divided into three cases. Optimal network architectures with different memory structures were selected based on Akaike and Bayesian information statistical criteria using two-way factorial design. The optimal model performance was compared to other popular gene classification algorithms such as Nearest Neighbor, Support Vector Machine, and Self-Organized Map. The reliability of the performance was verified with multiple iterated runs.
Yulan Liang, Arpad Kelemen
KDD1
2002 Adaptive Generalized Estimation Equation with Bayes Classifier for the Job Assignment Problem
Yulan Liang, King-Ip Lin, Arpad Kelemen
PAKDD1