George Runger

George Runger

Auto-generated profile, based on publicly available information

George Runger

Arizona State University

Research Focus & Metrics

Academic Career Length

31Years (1996-Present)

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

Representative Publications

View All Publications
1 January 2016 in Journal of Quality Technology
Verified
Journal Article
Closed access
BABahareh Azarnoush
Bahareh Azarnoush
KPKamran Paynabar
Kamran Paynabar
JBJennifer Bekki
Jennifer Bekki
GRGeorge Runger
George Runger
Network modeling and analysis has become a fundamental tool for studying various complex systems. This paper proposes an extension of statistical monitoring to network streams, which is crucial for effective decision-making in various applications. To this end, a model for the probability of edge existence as a function of vertex attributes is constructed and a likelihood method is developed to monitor the underlying network model. The method is flexible to detect any form of anomaly that arises from different network edge-formation mechanisms. Experiments on simulated and real network streams depict the properties and benefits of the method compared with existing methods in the literature.

7 December 2017 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
SLSangdi Lin
Sangdi Lin
GRGeorge C. Runger
George C. Runger
In this paper, we propose a new end-to-end deep neural network model for time-series classification (TSC) with emphasis on both the accuracy and the interpretation. The proposed model contains a convolutional network component to extract high-level features and a recurrent network component to enhance the modeling of the temporal characteristics of TS data. In addition, a feedforward fully connected network with the sparse group lasso (SGL) regularization is used to generate the final classification. The proposed architecture not only achieves satisfying classification accuracy, but also obtains good interpretability through the SGL regularization. All these networks are connected and jointly trained in an end-to-end framework, and it can be generally applied to TSC tasks across different domains without the efforts of feature engineering. Our experiments in various TS data sets show that the proposed model outperforms the traditional convolutional neural network model for the classification accuracy, and also demonstrate how the SGL contributes to a better model interpretation.

1 January 2012 in Journal of Quality Technology
Verified
Journal Article
Closed access
HDHoutao Deng
Houtao Deng
GRGeorge Runger
George Runger
ETEugene Tuv
Eugene Tuv
Monitoring real-time data steams is an important learning task in numerous disciplines. Traditional process-monitoring techniques are challenged by increasingly complex, high-dimensional data, mixed categorical and numerical variables, non-Gaussian distributions, nonlinear relationships, etc. A new monitoring method based on real-time contrasts (RTC) between the reference and real-time data is presented. RTC assigns one class label to the reference data, and another class label to a window of real-time data, and, thus, transforms the monitoring problem to a dynamic series of classification problems. This differs from previous work that trained a classifier one time at the start of monitoring. Furthermore, a number of monitoring statistics based on the generalized likelihood-ratio principle are discussed. These include error rates and class probability estimates from classifiers. Typically, the window size for the real-time data is much smaller than the size of the reference data and this class imbalance is also considered in the approach. Variable contributor diagnostics can be simultaneously obtained from the approach and are briefly discussed. Both mean and variance shifts are illustrated. Experiments are used to compare monitoring statistics and to illustrate performance advantages of RTC relative to alternative methods.

16 July 2019 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
MCManuel Ricardo Carlos
Manuel Ricardo Carlos
LGLuis Carlos González Gurrola
Luis Carlos González Gurrola
JWJohan Wahlström
Johan Wahlström
GRGraciela Ramirez
Graciela Ramirez
FMFernando Martinez
Fernando Martinez
GRGeorge Runger
George Runger
Aggressive driving behavior is one of the leading causes of road accidents worldwide. One way to ameliorate this situation is to collect and analyze driving patterns with the intention of promoting driving awareness, a task that has been called driving analytics (DA). DA employing the driver's smartphone has attracted attention from the community given its good capabilities to capture, via its integrated sensors, data that could be exploited to infer driving style. Most works in the related literature have represented this sensor information either as statistical scores or in raw format that are later fed into threshold-based heuristics or machine learning (ML) approaches. Based on the hypothesis that better data representations do exist, in this paper, we propose a second-order representation, based on the bag-of-words' strategy, to model accelerometer timestamps associated with aggressive driving maneuvers. We evaluate this representation in two scenarios and three data sets against the best reported work in each of them. In the first scenario, we classify accelerometer samples as either belonging to aggressive or safe driving style. In the second scenario, we approach a multi-class problem, where we are now interested in identifying the exact aggressive maneuver that the accelerometer sample represents. The results show that this novel representation outperforms both state-of-the-art works with 6% and 15% in F-measure for each scenario, respectively. To further investigate the strength of our representation, we make a comparison against similar second-order strategies that have also proved to be successful. Overall, this analysis suggests that this representation constitutes an attractive method for driving behavior classification, boosting discriminative performance of ML approaches.

11 October 2007 in International Journal of Production Research
Verified
Journal Article
Closed access
DJD. Jearkpaporn
D. Jearkpaporn
CBC. M. Borror
C. M. Borror
GRG. C. Runger
G. C. Runger
DMD. C. Montgomery
D. C. Montgomery
A monitoring scheme for detecting a mean shift in a multistage manufacturing process for a gamma distributed response and/or a mixture of normally and non-normally distributed variables (and gamma distributed responses) is presented. The procedure is based on a deviance residual obtained from a generalized linear model (GLM). The deviance residual is shown to be a likelihood ratio statistic for detecting a mean shift in many cases for distributions in the exponential family. The advantages over the use of a control chart based on individual observations and the T 2 chart based on U statistics are demonstrated by a simulation study. The possibility of modelling the process variation for multistage processes based on a GLM is also discussed.

15 May 2009 in Bioinformatics
Verified
Journal Article
Closed access
PDF file
WTWandaliz Torres-García
Wandaliz Torres-García
Weiwen ZhangWeiwen Zhang
Weiwen Zhang
GRGeorge C. Runger
George C. Runger
RJRoger H. Johnson
Roger H. Johnson
DMDeirdre R. Meldrum
Deirdre R. Meldrum
Motivation: Gene expression profiling technologies can generally produce mRNA abundance data for all genes in a genome. A dearth of proteomic data persists because identification range and sensitivity of proteomic measurements lag behind those of transcriptomic measurements. Using partial proteomic data, it is likely that integrative transcriptomic and proteomic analysis may introduce significant bias. Developing methodologies to accurately estimate missing proteomic data will allow better integration of transcriptomic and proteomic datasets and provide deeper insight into metabolic mechanisms underlying complex biological systems. Results: In this study, we present a non-linear data-driven model to predict abundance for undetected proteins using two independent datasets of cognate transcriptomic and proteomic data collected from Desulfovibrio vulgaris. We use stochastic gradient boosted trees (GBT) to uncover possible non-linear relationships between transcriptomic and proteomic data, and to predict protein abundance for the proteins not experimentally detected based on relevant predictors such as mRNA abundance, cellular role, molecular weight, sequence length, protein length, guanine-cytosine (GC) content and triple codon counts. Initially, we constructed a GBT model using all possible variables to assess their relative importance and characterize the behavior of the predictive model. A strong plateau effect in the regions of high mRNA values and sparse data occurred in this model. Hence, we removed genes in those areas based on thresholds estimated from the partial dependency plots where this behavior was captured. At this stage, only the strongest predictors of protein abundance were retained to reduce the complexity of the GBT model. After removing genes in the plateau region, mRNA abundance, main cellular functional categories and few triple codon counts emerged as the top-ranked predictors of protein abundance. We then created a new tuned GBT model using the five most significant predictors. The construction of our non-linear model consists of a set of serial regression trees models with implicit strength in variable selection. The model provides variable relative importance measures using as a criterion mean square error. The results showed that coefficients of determination for our nonlinear models ranged from 0.393 to 0.582 in both datasets, providing better results than linear regression used in the past. We evaluated the validity of this non-linear model using biological information of operons, regulons and pathways, and the results demonstrated that the coefficients of variation of estimated protein abundance values within operons, regulons or pathways are indeed smaller than those for random groups of proteins. Contact: weiwen.zhang@asu.edu; george.runger@asu.edu Supplementary Information: Supplementary data are available at Bioinformatics online.