Occupancy numbers for dynamic heterogeneous populations: Estimate of particles lifetimes

A dynamic model of a heterogeneous population is studied. Particles belonging to a population are divided, at every time t, into a finite number of classes according to their types and the partition changes over time. The role of the occupancy numbers, namely the cardinality of each class, is highlighted. The relationship between the stochastic process of occupancy numbers and the process of particle types is analyzed. The main goal of this paper is the estimation of the lifetime of each particle at a given time t, when the observed data are the history of the process of the number of dead particles up to t. Furthermore, a discrete time approximation of the filter is given.     

A sequential design for a clinical trial with a linear prognostic factor

We study a randomized adaptive design to assign one of the L$L$ treatments to patients who arrive sequentially by means of an urn model. At each stage n$n$, a reward is distributed between treatments. The treatment applied is rewarded according to its response, 0?_Yn?1$0?Y_n?1$, and 1-_Yn$1-Y_n$ is distributed among the other treatments according to their performance until stage n-1$n-1$. Patients can be classified in K+1$K+1$ levels and we assume that the effect of this level in the response to the treatments is linear. We study the asymptotic behavior of the design when the ordinary least square estimators are used as a measure of performance until stage n-1$n-1$.     

Considerations on group-wise identical designs for linear mixed models

We consider a general class of mixed models, where the individual parameter vector is composed of a linear function of the population parameter vector plus an individual random effects vector. The linear function can vary for the different individuals. We show that the search for optimal designs for the estimation of the population parameter vector can be restricted to the class of group-wise identical designs, i.e., for each of the groups defined by the different linear functions only one individual elementary design has to be optimized. A way to apply the result to non-linear mixed models is described.     

Identifiable finite mixtures of location models for clustering mixed-mode data

For clustering mixed categorical and continuous data, Lawrence and Krzanowski (1996) proposed a finite mixture model in which component densities conform to the location model. In the graphical models literature the location model is known as the homogeneous Conditional Gaussian model. In this paper it is shown that their model is not identifiable without imposing additional restrictions. Specifically, for g groups and m locations, (g!)m–1 distinct sets of parameter values (not including permutations of the group mixing parameters) produce the same likelihood function. Excessive shrinkage of parameter estimates in a simulation experiment reported by Lawrence and Krzanowski (1996) is shown to be an artifact of the model's non-identifiability. Identifiable finite mixture models can be obtained by imposing restrictions on the conditional means of the continuous variables. These new identified models are assessed in simulation experiments. The conditional mean structure of the continuous variables in the restricted location mixture models is similar to that in the underlying variable mixture models proposed by Everitt (1988), but the restricted location mixture models are more computationally tractable.     

比喻分类管见

本文针对大中学教坛上把比喻分为明喻、暗喻、借喻的“三分说”分类提出不同看法;认为应分为两大类：常式比喻和变式比喻,并着重分析了 常式比喻与变式比喻之间的联系及其“变”的规律     

THE CHOICE BETWEEN SETS OF REGRESSORS

This paper examines the choice of critical values for testing both non-sequential and nested sequential sets of constraints in the standard linear regression model. Modest increases in (e.g.) t-ratio critical values relative to their one-off values are often sufficient to maintain proper size. A Bayesian decision-theoretic approach, highlighted by the Schwarz (1978) criterion, provides a framework for deriving consistency and asymptotic local power properties of both forms of testing (data mining) algorithms.     

A BAYESIAN INTERPRETATION OF MULTIPLE POINT ESTIMATES

Consider a large number of econometric investigations using different estimation techniques and/or different subsets of all available data to estimate a fixed set of parameters. The resulting empirical distribution of point estimates can be shown - under suitable conditions - to coincide with a Bayesian posterior measure on the parameter space induced by a minimum information procedure. This Bayesian interpretation makes it easier to combine the results of various empirical exercises for statistical decision making. The collection of estimators may be generated by one investigator to ensure the satisfaction of our conditions, or they may be collected from published works, where behavioral assumptions need to be made regarding the dependence structure of econometric studies.     

Boosting with Bayesian stumps

Boosting is a new, powerful method for classification. It is an iterative procedure which successively classifies a weighted version of the sample, and then reweights this sample dependent on how successful the classification was. In this paper we review some of the commonly used methods for performing boosting and show how they can be fit into a Bayesian setup at each iteration of the algorithm. We demonstrate how this formulation gives rise to a new splitting criterion when using a domain-partitioning classification method such as a decision tree. Further we can improve the predictive performance of simple decision trees, known as stumps, by using a posterior weighted average of them to classify at each step of the algorithm, rather than just a single stump. The main advantage of this approach is to reduce the number of boosting iterations required to produce a good classifier with only a minimal increase in the computational complexity of the algorithm.     

Segmentation,alignment and statistical analysis of biosignals with application to disease classification

We present a novel methodology for a comprehensive statistical analysis of approximately periodic biosignal data. There are two main challenges in such analysis: (1) the automatic extraction (segmentation) of cycles from long, cyclostationary biosignals and (2) the subsequent statistical analysis, which in many cases involves the separation of temporal and amplitude variabilities. The proposed framework provides a principled approach for statistical analysis of such signals, which in turn allows for an efficient cycle segmentation algorithm. This is achieved using a convenient representation of functions called the square-root velocity function (SRVF). The segmented cycles, represented by SRVFs, are temporally aligned using the notion of the Karcher mean, which in turn allows for more efficient statistical summaries of signals. We show the strengths of this method through various disease classification experiments. In the case of myocardial infarction detection and localization, we show that our method compares favorably to methods described in the current literature.