Document classification is an area of great importance for which many classification methods have been developed. However, most of these methods cannot generate time-dependent classification rules. Thus, they are not the best choices for problems with time-varying structures. To address this...

The problem of regression shrinkage and selection for multivariate regression is considered. The goal is to consistently identify those variables relevant for regression. This is done not only for predictors but also for responses. To this end, a novel relationship between multivariate...

Aimed at providing the anticipatory ability for the proactive traffic control systems, a new adaptive online short-term univariate traffic condition forecasting method is presented in this dissertation by assimilating knowledge from previous research. Using 15-minute traffic flow series as a...

Hsu and Berger (J. Amer. Statist. Assoc. 50 (1999) 468) proposed a stepwise confidence interval procedure for identifying the minimum effective dose in dose-response studies under homoscedasticity. In practice, homogeneity of variance is often in doubt. In this paper, we extend Hsu and Berger's...

In this paper, we consider how to recover the structure of a Bayesian network from a moral graph. We present a more accurate characterization of moral edges, based on which a complete subset (i.e., a separator) contained in the neighbor set of one vertex of the putative moral edge in some prime...

This paper is concerned with situations in which estimating equations involve missing data and the full likelihood may not be available. We present an iterative algorithm for solving estimating equations in the presence of missing data. An application is made to a real data set from a...

G. R. Ducharme and Y. Lepage (1986, J. Roy. Statist. Soc. Ser. B48, 197-205) presented the strong collapsibility of odds ratio in 22K tables. However, the concept is not suitable for an ordinal background variable since it is meaningless to pool nonadjacent levels in this case. In this paper, we...

One of the most powerful algorithms for maximum likelihood estimation for many incomplete-data problems is the EM algorithm. The restricted EM algorithm for maximum likelihood estimation under linear restrictions on the parameters has been handled by Kim and Taylor (J. Amer. Statist. Assoc. 430...