Gang Shen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Gang Shen has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Yi-Cheng Tu
University of South Florida
2 shared publications - Anand Kumar
University of South Florida
1 shared publication - Anand Kumar
Department of Computer Science and Engineering, University of South Florida, 4202 E. Fowler Ave., ENB118, Tampa, 33620, Florida, USA
1 shared publication Hui Xu
Department of Mathematics and Statistics, St. Cloud State University, St. Cloud, MN, USA
1 shared publicationJayanta K. Ghosh
Department of Statistics, Purdue University, United States
1 shared publication- Jin Huang
University of Texas at Arlington, Arlington, TX, US
1 shared publication
Latest Publications
- 29 April 2024
- Published by Taylor & Francis in Journal of Applied Statistics
- Vol. 51 (16) , 3292-3307
On efficiency of locally D -optimal designs under heteroscedasticity and non-Gaussianity
In the classical theory of locally optimal designs, which is developed within the framework of the center+error model, the most efficient design is the one based on MGLE, the maximum Gaussian likelihood estimator. However, practical scenarios often lack of complete information as to the governing probability model for the response measure and deviate from Gaussianity and homoscedasticity assumptions, in which, MqLE, the maximum quasi-likelihood estimator, has been advocated in the literature. In this work, we examine the locally optimal design based on the novel oracle-SLSE, the second-order least-square estimator, in the case where the underlying probability model is incompletely specified. We find that in a general setting, our oracle SLSE-based optimal design, incorporating skewness and kurtosis information, outperforms those based on MqLE or MGLE. Our numerical experiment supports this, with locally D-optimal designs based on MqLE approaching the efficiency of oracle-SLSE designs in some cases. This research guides the choice of estimators in practical scenarios departing from ideal assumptions.
- 29 April 2024
- Published by Taylor & Francis in Journal of Applied Statistics
- Vol. 51 (16) , 3292-3307
On efficiency of locally D -optimal designs under heteroscedasticity and non-Gaussianity
In the classical theory of locally optimal designs, which is developed within the framework of the center+error model, the most efficient design is the one based on MGLE, the maximum Gaussian likelihood estimator. However, practical scenarios often lack of complete information as to the governing probability model for the response measure and deviate from Gaussianity and homoscedasticity assumptions, in which, MqLE, the maximum quasi-likelihood estimator, has been advocated in the literature. In this work, we examine the locally optimal design based on the novel oracle-SLSE, the second-order least-square estimator, in the case where the underlying probability model is incompletely specified. We find that in a general setting, our oracle SLSE-based optimal design, incorporating skewness and kurtosis information, outperforms those based on MqLE or MGLE. Our numerical experiment supports this, with locally D-optimal designs based on MqLE approaching the efficiency of oracle-SLSE designs in some cases. This research guides the choice of estimators in practical scenarios departing from ideal assumptions.
- 9 January 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 26 (10) , 2410-2424
Computing Spatial Distance Histograms for Large Scientific Data Sets On-the-Fly
This paper focuses on an important query in scientific simulation data analysis: the Spatial Distance Histogram (SDH). The computation time of an SDH query using brute force method is quadratic. Often, such queries are executed continuously over certain time periods, increasing the computation time. We propose highly efficient approximate algorithm to compute SDH over consecutive time periods with provable error bounds. The key idea of our algorithm is to derive statistical distribution of distances from the spatial and temporal characteristics of particles. Upon organizing the data into a Quad-tree based structure, the spatiotemporal characteristics of particles in each node of the tree are acquired to determine the particles' spatial distribution as well as their temporal locality in consecutive time periods. We report our efforts in implementing and optimizing the above algorithm in graphics processing units (GPUs) as means to further improve the efficiency. The accuracy and efficiency of the proposed algorithm is backed by mathematical analysis and results of extensive experiments using data generated from real simulation studies.
- 9 January 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 26 (10) , 2410-2424
Computing Spatial Distance Histograms for Large Scientific Data Sets On-the-Fly
This paper focuses on an important query in scientific simulation data analysis: the Spatial Distance Histogram (SDH). The computation time of an SDH query using brute force method is quadratic. Often, such queries are executed continuously over certain time periods, increasing the computation time. We propose highly efficient approximate algorithm to compute SDH over consecutive time periods with provable error bounds. The key idea of our algorithm is to derive statistical distribution of distances from the spatial and temporal characteristics of particles. Upon organizing the data into a Quad-tree based structure, the spatiotemporal characteristics of particles in each node of the tree are acquired to determine the particles' spatial distribution as well as their temporal locality in consecutive time periods. We report our efforts in implementing and optimizing the above algorithm in graphics processing units (GPUs) as means to further improve the efficiency. The accuracy and efficiency of the proposed algorithm is backed by mathematical analysis and results of extensive experiments using data generated from real simulation studies.
- 23 August 2013
- Published by Taylor & Francis in Journal of Nonparametric Statistics
- Vol. 25 (4) , 923-937
On the isotonic change-point problem
This work provides a new nonparametric test with a flavour of the classical Mann–Whitney test for the isotonic change-point problem on correlated data with short-range dependence. The test statistic has a normal null limiting distribution and asymptotic test power 1 under the local alternative. Numerical study indicates that it has a similar or slightly better performance than the oracle form of the existing tests on independent data and works very well on moderate-sized correlated data where the existing tests usually fail. Its application to the global temperature data is presented.
- 23 August 2013
- Published by Taylor & Francis in Journal of Nonparametric Statistics
- Vol. 25 (4) , 923-937
On the isotonic change-point problem
This work provides a new nonparametric test with a flavour of the classical Mann–Whitney test for the isotonic change-point problem on correlated data with short-range dependence. The test statistic has a normal null limiting distribution and asymptotic test power 1 under the local alternative. Numerical study indicates that it has a similar or slightly better performance than the oracle form of the existing tests on independent data and works very well on moderate-sized correlated data where the existing tests usually fail. Its application to the global temperature data is presented.
- Open Access
- 27 March 2012
- Published by Association for Computing Machinery (ACM)
- p. 288-299
Distance histogram computation based on spatiotemporal uniformity in scientific data
Large data generated by scientific applications imposes challenges in storage and efficient query processing. Many queries against scientific data are analytical in nature and require super-linear computation time using straightforward methods. Spatial distance histogram (SDH) is one of the basic queries to analyze the molecular simulation (MS) data, and it takes quadratic time to compute using brute-force approach. Often, an SDH query is executed continuously to analyze the simulation system over a period of time. This adds to the total time required to compute SDH. In this paper, we propose an approximate algorithm to compute SDH efficiently over consecutive time periods. In our approach, data is organized into a Quad-tree based data structure. The spatial locality of the particles (at given time) in each node of the tree is acquired to determine the particle distribution. Similarly, the temporal locality of particles (between consecutive time periods) in each node is also acquired. The spatial distribution and temporal locality are utilized to compute the approximate SDH at every time instant. The performance is boosted by storing and updating the spatial distribution information over time. The efficiency and accuracy of the proposed algorithm is supported by mathematical analysis and results of extensive experiments using biological data generated from real MS studies.
- 27 March 2012
- Published by Association for Computing Machinery (ACM)
- p. 288-299
Open AccessDistance histogram computation based on spatiotemporal uniformity in scientific data
Large data generated by scientific applications imposes challenges in storage and efficient query processing. Many queries against scientific data are analytical in nature and require super-linear computation time using straightforward methods. Spatial distance histogram (SDH) is one of the basic queries to analyze the molecular simulation (MS) data, and it takes quadratic time to compute using brute-force approach. Often, an SDH query is executed continuously to analyze the simulation system over a period of time. This adds to the total time required to compute SDH. In this paper, we propose an approximate algorithm to compute SDH efficiently over consecutive time periods. In our approach, data is organized into a Quad-tree based data structure. The spatial locality of the particles (at given time) in each node of the tree is acquired to determine the particle distribution. Similarly, the temporal locality of particles (between consecutive time periods) in each node is also acquired. The spatial distribution and temporal locality are utilized to compute the approximate SDH at every time instant. The performance is boosted by storing and updating the spatial distribution information over time. The efficiency and accuracy of the proposed algorithm is supported by mathematical analysis and results of extensive experiments using biological data generated from real MS studies.
- 1 November 2011
- Published by Elsevier in Statistics & Probability Letters
- Vol. 81 (11) , 1627-1634
On periodically isotonic climate change
- 1 November 2011
- Published by Elsevier in Statistics & Probability Letters
- Vol. 81 (11) , 1627-1634
On periodically isotonic climate change
- 18 November 2010
- Published by Elsevier in Journal of Statistical Planning and Inference
- Vol. 141 (4) , 1436-1447
Developing a new BIC for detecting change-points
- 18 November 2010
- Published by Elsevier in Journal of Statistical Planning and Inference
- Vol. 141 (4) , 1436-1447
Developing a new BIC for detecting change-points