Complete designs with blocks of maximal multiplicity

The set of distinct blocks of a block design is known as its support. We construct complete designs with parameters v(?7), k=3, λ=v ? 2 which contain a block of maximal multiplicity and with support size $\text{b}{}^1\text{= (}{}^{\mathrm{v}}{}_3\text{) ? 4(v ? 2)}$. Any complete design which contains such a block, and has parameters v, k, λ as above, must be supported on at most (^v₃) ? 4(v ? 2) blocks. Attention is given to complete designs because of their direct relationship to simple random sampling.     

Finite Sample Modifications of the Granger Non Causality Test in Cointegrated Vector Autoregressions

This article deals with the Granger non causality test in cointegrated vector autoregressive processes. We propose a new testing procedure that yields an asymptotically standard distribution and performs well in small samples by combining the standard Wald test and the generalized inverse procedure. We also propose a few simple modifications to the test statistics in order to help our procedure perform better in finite samples. Monte Carlo simulations show that our procedure works better than the conventional approach.     

Vector correlation for elliptical distributions

A measure of multivariate correlation between two sets of vectors is considered when the underlying joint distribution is a member of the class of elliptical distributions. Its asymptotic distribution is derived under different situations and these results are used to test hypotheses on vector correlation when the underlying joint distribution is non-normal.     

PREDICTION INTERVALS FOR SUPPORT VECTOR MACHINE REGRESSION

ABSTRACT

The support vector machine (SVM), first developed by Vapnik and his group at AT&T Bell Laboratories, is being used as a new technique for regression and classification problems. In this paper we present an approach to estimating prediction intervals for SVM regression based on posterior predictive densities. Furthermore, the method is illustrated with a data example.     

Some Observations,a Suggestion,and Some Comments on the Conway-Roberts Article

This article provides new tools for the evaluation of dynamic stochastic general equilibrium (DSGE) models and applies them to a large-scale new Keynesian model. We approximate the DSGE model by a vector autoregression, and then systematically relax the implied cross-equation restrictions and document how the model fit changes. We also compare the DSGE model's impulse responses to structural shocks with those obtained after relaxing its restrictions. We find that the degree of misspecification in this large-scale DSGE model is no longer so large as to prevent its use in day-to-day policy analysis, yet is not small enough to be ignored.     

An Algorithm for Unconstrained Quadratically Penalized Convex Optimization

Estimators are often defined as the solutions to data dependent optimization problems. A common form of objective function (function to be optimized) that arises in statistical estimation is the sum of a convex function V and a quadratic complexity penalty. A standard paradigm for creating kernel-based estimators leads to such an optimization problem. This article describes an optimization algorithm designed for unconstrained optimization problems in which the objective function is the sum of a non negative convex function and a known quadratic penalty. The algorithm is described and compared with BFGS on some penalized logistic regression and penalized L ^3/2 regression problems.     

Sequential Pattern Analysis: A Statistical Investigation of Sequence Length and Support

In sequential pattern analysis, the frequency of patterns is evaluated by the support. While computed efficiently from large databases, we show that the support cannot be compared between different databases, since it is influenced by the actual sequence length distribution. Models for this sequence length distribution are surveyed. One of these models, the Good distribution, appears to be sufficiently flexible for practice. It is used to exemplify an approach for adjusting the relative support such that the resulting adjusted support values are better comparable between different databases. We illustrate our findings with texts from the bilingual FinDe corpus.     

Propensity score prediction for electronic healthcare databases using super learner and high-dimensional propensity score methods

ABSTRACT

The optimal learner for prediction modeling varies depending on the underlying data-generating distribution. Super Learner (SL) is a generic ensemble learning algorithm that uses cross-validation to select among a ‘library’ of candidate prediction models. While SL has been widely studied in a number of settings, it has not been thoroughly evaluated in large electronic healthcare databases that are common in pharmacoepidemiology and comparative effectiveness research. In this study, we applied and evaluated the performance of SL in its ability to predict the propensity score (PS), the conditional probability of treatment assignment given baseline covariates, using three electronic healthcare databases. We considered a library of algorithms that consisted of both nonparametric and parametric models. We also proposed a novel strategy for prediction modeling that combines SL with the high-dimensional propensity score (hdPS) variable selection algorithm. Predictive performance was assessed using three metrics: the negative log-likelihood, area under the curve (AUC), and time complexity. Results showed that the best individual algorithm, in terms of predictive performance, varied across datasets. The SL was able to adapt to the given dataset and optimize predictive performance relative to any individual learner. Combining the SL with the hdPS was the most consistent prediction method and may be promising for PS estimation and prediction modeling in electronic healthcare databases.     

Decision Support by Interval SMART/SWING—Incorporating Imprecision in the SMART and SWING Methods

Interval judgments are a way of handling preferential and informational imprecision in multicriteria decision analysis (MCDA). In this article, we study the use of intervals in the simple multiattribute rating technique (SMART) and SWING weighting methods. We generalize the methods by allowing the reference attribute to be any attribute, not just the most or the least important one, and by allowing the decision maker to reply with intervals to the weight ratio questions to account for his/her judgmental imprecision. We also study the practical and procedural implications of using imprecision intervals in these methods. These include, for example, how to select the reference attribute to identify as many dominated alternatives as possible. Based on the results of a simulation study, we suggest guidelines for how to carry out the weighting process in practice. Computer support can be used to make the process visual and interactive. We describe the WINPRE software for interval SMART/SWING, preference assessment by imprecise ratio statements (PAIRS), and preference programming. The use of interval SMART/SWING is illustrated by a job selection example.     

Evaluation of Embedded Intelligent Real‐time Systems*

Over the past two decades, questions have surfaced about the effectiveness and contribution of intelligent systems to decision makers in a variety of settings. This paper focuses on the evaluation challenges associated with intelligent real‐time software systems that are embedded in larger host systems. With the proliferation of such systems in operational settings such as aerospace, medical, manufacturing, and transportation systems, increased attention to evaluations of such systems, and to resulting software safety, is warranted. This paper describes one such evaluation and proposes a set of evaluation criteria for embedded intelligent real‐time systems (EIRTS). Implications of the evaluation and the evaluation criteria are discussed.