In machine learning and data science literature, clustering is the task of dividing the observations (data points) into several categories in such a way that data points falling into one group are being dissimilar than the data points falling to the other groups such that the variation within a...

We consider the basic problem of refi tting a time series over a finite period of time and formulate it as a stochastic dynamic program. By changing the underlying Markov decision process we are able to obtain a model that at optimality considers historical data as well as forecasts of future...

The spatial granularity of poverty statistics can have a significant impact on the efficiency of targeting resources meant to improve the living conditions of the poor. However, achieving granularity typically requires increasing the sample sizes of surveys on household income and expenditure or...

A nonlinear Gauss-Seidel type algorithm is proposed for computing the maximum posterior estimates of the random effects in a generalized linear mixed model. We show that the algorithm converges in virtually all typical situations of generalized linear mixed models. A numerical example shows the...

In this study we combine clustering techniques with a moving window algorithm in order to filter financial market data outliers. We apply the algorithm to a set of financial market data which consists of 25 series selected from a larger dataset using a cluster analysis technique taking into...