Model-based clustering of multivariate skew data with circular components and missing values

Motivated by classification issues that arise in marine studies, we propose a latent-class mixture model for the unsupervised classification of incomplete quadrivariate data with two linear and two circular components. The model integrates bivariate circular densities and bivariate skew normal densities to capture the association between toroidal clusters of bivariate circular observations and planar clusters of bivariate linear observations. Maximum-likelihood estimation of the model is facilitated by an expectation maximization (EM) algorithm that treats unknown class membership and missing values as different sources of incomplete information. The model is exploited on hourly observations of wind speed and direction and wave height and direction to identify a number of sea regimes, which represent specific distributional shapes that the data take under environmental latent conditions.     

Bayesian inference under progressive type-I interval censoring

Bayesian estimation for population parameter under progressive type-I interval censoring is studied via Markov Chain Monte Carlo (MCMC) simulation. Two competitive statistical models, generalized exponential and Weibull distributions for modeling a real data set containing 112 patients with plasma cell myeloma, are studied for illustration. In model selection, a novel Bayesian procedure which involves a mixture model is proposed. Then the mix proportion is estimated through MCMC and used as the model selection criterion.     

Optimal determination of the parameters of some biased estimators using genetic algorithm

In this paper, some new algorithms for estimating the biasing parameters of the ridge, Liu and two-parameter estimators are introduced with the help of genetic algorithm (GA). The proposed algorithms are based on minimizing some statistical measures such as mean square error (MSE), mean absolute error (MAE) and mean absolute prediction error (MAPE). At the same time, the new algorithms allow one to keep the condition number and variance inflation factors to be less than or equal to ten by means of the GA. A numerical example is presented to show the utility of the new algorithms. In addition, an extensive Monte Carlo experiment is conducted. The numerical findings prove that the proposed algorithms enable to eliminate the problem of multicollinearity and minimize the MSE, MAE and MAPE.     

A robust and efficient estimation method for nonparametric models with jump points

Nonparametric models with jump points have been considered by many researchers. However, most existing methods based on least squares or likelihood are sensitive when there are outliers or the error distribution is heavy tailed. In this article, a local piecewise-modal method is proposed to estimate the regression function with jump points in nonparametric models, and a piecewise-modal EM algorithm is introduced to estimate the proposed estimator. Under some regular conditions, the large-sample theory is established for the proposed estimators. Several simulations are presented to evaluate the performances of the proposed method, which shows that the proposed estimator is more efficient than the local piecewise-polynomial regression estimator in the presence of outliers or heavy tail error distribution. What is more, the proposed procedure is asymptotically equivalent to the local piecewise-polynomial regression estimator under the assumption that the error distribution is a Gaussian distribution. The proposed method is further illustrated via the sea-level pressures.     

Time series models based on the unrestricted skew-normal process

The standard location and scale unrestricted (or unified) skew-normal (SUN) family studied by Arellano-Valle and Genton [On fundamental skew distributions. J Multivar Anal. 2005;96:93–116] and Arellano-Valle and Azzalini [On the unification of families of skew-normal distributions. Scand J Stat. 2006;33:561–574], allows the modelling of data which is symmetrically or asymmetrically distributed. The family has a number of advantages suitable for the analysis of stochastic processes such as Auto-Regressive Moving-Average (ARMA) models, including being closed under linear combinations, being able to satisfy the consistency condition of Kolmogorov’s theorem and providing the guarantee of the existence of such a SUN stochastic process. The family is able to be represented in a hierarchical form which can be used for the ease of simulation. In addition, it facilitates an EM-type algorithm to estimate the model parameters. The performances and suitability of the proposed model are demonstrated on simulations and using two real data sets in applications.     

Global employment and decent jobs, 2010–2030: The forces of demography and automation

Globally, an estimated 734 million jobs will be required between 2010 and 2030 to accommodate recent and ongoing demographic shifts, account for plausible changes in labour force participation rates, and achieve target unemployment rates of at or below 4 per cent for adults and at or below 8 per cent for youth. The facts that most new jobs will be required in countries where “decent” jobs are less prevalent and workers in many occupations are increasingly subject to risks of automation further compound the challenge of job creation, which is already quite sizable in historical perspective. Failure to create the jobs that are needed through 2030 would put currently operative social security systems under pressure and undermine efforts to guarantee the national social protection floors enshrined in the Sustainable Development Goals (SDGs).     

党政机构微博在突发事件中传播效果的影响因素及策略

在分析铁路货运量预测方法的基础上，针对标准BP神经网络的不足，提出改进的BP神经网络预测模型。首先,利用动态陡度因子来改变激励函数的陡峭程度，以此来得到更好的激励函数响应特征以及更好的非线性表达能力；其次，利用附加动量因子，通过对以前经验的积累，既降低了神经网络对误差曲面的局部细节敏感特性，又较好的遏制了神经网络易于限于局部最小的缺陷；最后，采取改变学习率的方法，给定一个较大的学习率初始值，在学习的过程中学习率不断减小，网络最终趋于稳定。改进BP算法既可以得到更优的解，还能够缩短训练时间。利用全国铁路货运     

Marginal zero-inflated regression models for count data

Data sets with excess zeroes are frequently analyzed in many disciplines. A common framework used to analyze such data is the zero-inflated (ZI) regression model. It mixes a degenerate distribution with point mass at zero with a non-degenerate distribution. The estimates from ZI models quantify the effects of covariates on the means of latent random variables, which are often not the quantities of primary interest. Recently, marginal zero-inflated Poisson (MZIP; Long et al. [A marginalized zero-inflated Poisson regression model with overall exposure effects. Stat. Med. 33 (2014), pp. 5151–5165]) and negative binomial (MZINB; Preisser et al., 2016) models have been introduced that model the mean response directly. These models yield covariate effects that have simple interpretations that are, for many applications, more appealing than those available from ZI regression. This paper outlines a general framework for marginal zero-inflated models where the latent distribution is a member of the exponential dispersion family, focusing on common distributions for count data. In particular, our discussion includes the marginal zero-inflated binomial (MZIB) model, which has not been discussed previously. The details of maximum likelihood estimation via the EM algorithm are presented and the properties of the estimators as well as Wald and likelihood ratio-based inference are examined via simulation. Two examples presented illustrate the advantages of MZIP, MZINB, and MZIB models for practical data analysis.     

A new algorithm for clustering based on kernel density estimation

In this paper, we present an algorithm for clustering based on univariate kernel density estimation, named ClusterKDE. It consists of an iterative procedure that in each step a new cluster is obtained by minimizing a smooth kernel function. Although in our applications we have used the univariate Gaussian kernel, any smooth kernel function can be used. The proposed algorithm has the advantage of not requiring a priori the number of cluster. Furthermore, the ClusterKDE algorithm is very simple, easy to implement, well-defined and stops in a finite number of steps, namely, it always converges independently of the initial point. We also illustrate our findings by numerical experiments which are obtained when our algorithm is implemented in the software Matlab and applied to practical applications. The results indicate that the ClusterKDE algorithm is competitive and fast when compared with the well-known Clusterdata and K-means algorithms, used by Matlab to clustering data.     

Reversible jump Markov chain Monte Carlo algorithms for Bayesian variable selection in logistic mixed models

In this article, to reduce computational load in performing Bayesian variable selection, we used a variant of reversible jump Markov chain Monte Carlo methods, and the Holmes and Held (HH) algorithm, to sample model index variables in logistic mixed models involving a large number of explanatory variables. Furthermore, we proposed a simple proposal distribution for model index variables, and used a simulation study and real example to compare the performance of the HH algorithm with our proposed and existing proposal distributions. The results show that the HH algorithm with our proposed proposal distribution is a computationally efficient and reliable selection method.