Optimal asymmetric classification procedures for interval-screened normal data

Statistical methods for an asymmetric normal classification do not adapt well to the situations where the population distributions are perturbed by an interval-screening scheme. This paper explores methods for providing an optimal classification of future samples in this situation. The properties of the screened population distributions are considered and two optimal regions for classifying the future samples are obtained. These developments yield yet other rules for the interval-screened asymmetric normal classification. The rules are studied from several aspects such as the probability of misclassification, robustness, and estimation of the rules. The investigation of the performance of the rules as well as the illustration of the screened classification idea, using two numerical examples, is also considered.     

Utilizing auxiliary variables in sequential ratio and regression estimation schemes

Ratio and regression estimators for a mean are considered in conjunction with certain sequential sampling schemes. An auxiliary variable is assumed present and both fixed-cost and fixed- width confidence interval stopping rules are investigated. The asymptotic distributions of the estimators are derived as well as optimal probabilities pertinent to the schemes. Comparisons are made with results of certain double sampling procedures. Estimation of the ratio of two means is also considered and the results of a Monte Carlo simulation are included.     

Multivariate geometric distributions

Families of multivariate geometric distributions with flexible correlations can be constructed by applying inverse sampling to a sequence of multinomial trials, and counting outcomes in possibly overlapping categories. Further multivariate families can be obtained by considering other stopping rules, with the possibility of different stopping roles for different counts, A simple characterisation is given for stopping rules which produce joint distributions with marginals having the same form as that of the number of trials. The inverse sampling approach provides a unified treatment of diverse results presented by earlier authors, including Goldberg (1934), Bates and Meyman (1952), Edwards and Gurland (1961), Hawkes (1972), Paulson and Uppulori (1972) and Griffiths and Milne (1987). It also provides a basis for investigating the range of possible correlations for a given set of marginal parameters. In the case of more than two joint geometric or negative binomial variables, a convenient matrix formulation is provided.     

On selecting the best population

This paper deals with the problem of selecting the “best” population from a given number of populations in a decision theoretic framework. The class of selection rules considered is based on a suitable partition of the sample space. A selection rule is given which is shown to have certain optimum properties among the selection rules in the given class for a mal rules are known.     

On the design of efficient experiments for choosing between two bernoulli populations

An experiment consists of taking samples one at a time from two Bernoulli populations. At the conclusion of the experiment one of the two populations is declared to have the higher probability of sucess.We propose two classes rules for sampling and for choosing a population which results which results good decisions made quickly.These rules are analysed and are compared suggested previously by means of Monte-Carlo simulations.     

Inference rules and inferential distributions

We introduce the concept of inferential distributions corresponding to inference rules. Fiducial and posterior distributions are special cases. Inferential distributions are essentially unique. They correspond to or represent inference rules and are defined on the parameter space. Not all inference rules can be represented by an inferential distribution. A constructive method is given to investigate its existence for any given inference rule.     

The Interestingness Paradox in Pattern Discovery

Noting that several rule discovery algorithms in data mining can produce a large number of irrelevant or obvious rules from data, there has been substantial research in data mining that addressed the issue of what makes rules truly 'interesting'. This resulted in the development of a number of interestingness measures and algorithms that find all interesting rules from data. However, these approaches have the drawback that many of the discovered rules, while supposed to be interesting by definition, may actually (1) be obvious in that they logically follow from other discovered rules or (2) be expected given some of the other discovered rules and some simple distributional assumptions. In this paper we argue that this is a paradox since rules that are supposed to be interesting, in reality are uninteresting for the above reason. We show that this paradox exists for various popular interestingness measures and present an abstract characterization of an approach to alleviate the paradox. We finally discuss existing work in data mining that addresses this issue and show how these approaches can be viewed with respect to the characterization presented here.     

A response-adaptive design in crossover trial

In the present work, whenever the response variables are binary, we frame an adaptive allocation rule for a two-treatment two-period crossover design in the presence of possible carry-over effects. The proposed rule is a combination of the play-the-winner and randomized play-the-winner rules. We study various properties of the proposed rule through asymptotics and simulations. Some related inferential problems are also considered. The proposed procedure is compared with some possible competitor.     

Accurate and efficient numerical calculation of stable densities via optimized quadrature and asymptotics

Stable distributions are an important class of infinitely divisible probability distributions, of which two special cases are the Cauchy distribution and the normal distribution. Aside from a few special cases, the density function for stable distributions has no known analytic form and is expressible only through the variate’s characteristic function or other integral forms. In this paper, we present numerical schemes for evaluating the density function for stable distributions, its gradient, and distribution function in various parameter regimes of interest, some of which had no preexisting efficient method for their computation. The novel evaluation schemes consist of optimized generalized Gaussian quadrature rules for integral representations of the density function, complemented by asymptotic expansions near various values of the shape and argument parameters. We report several numerical examples illustrating the efficiency of our methods. The resulting code has been made available online.     

Classification rules for two parameter exponential populations under order restrictions on parameters

In this paper, we suggest classification procedures of an observation into one of two exponential populations assuming a known ordering between population parameters. We propose classification rules when either location or scale parameters are ordered. Some of these classification rules under ordering are better than usual classification rules with respect to the expected probability of correct classification. We also derive likelihood ratio-based classification rules. Comparison of these classification rules has been done using Monte Carlo simulations.     

Information and capacities

Most economists consider that the cases of negative information value that non-Bayesian decision makers seem to exhibit, clearly show that these models are not models representing rational behaviour. We consider this issue for Choquet Expected Utility maximizers in a simple framework, that is the problem of choosing on which event to bet. First, we find a necessary condition to prevent negative information vlaue that we call Separative Monotonicity. This is a weaker condition than Savage Sure thing Principle and it appears that necessity and possibility measures satisfy it and that we cand find conditioning rules such that the information value is always positive. In a second part, we question the way information value is usually measured and suggest that negative information values are merely resulting from an inadequate formula. Yet, we suggest to impose what appears as a weaker requirement, that is, the betting strategy should not be Statistically Dominated. We show for classical updating rules applied to belief functions that this requirement is violated. We consider a class of conditioning rules and exhibit a necessary and sufficient condition in order to satisfy the Statistical Dominance criterion in the case of belief functions. Received: November 2000; revised version: July 2001     

Minimax rules under zero–one loss for a restricted location parameter

In this paper, we obtain minimax and near-minimax nonrandomized decision rules under zero–one loss for a restricted location parameter of an absolutely continuous distribution. Two types of rules are addressed: monotone and nonmonotone. A complete-class theorem is proved for the monotone case. This theorem extends the previous work of Zeytinoglu and Mintz (1984) to the case of 2e-MLR sampling distributions. A class of continuous monotone nondecreasing rules is defined. This class contains the monotone minimax rules developed in this paper. It is shown that each rule in this class is Bayes with respect to nondenumerably many priors. A procedure for generating these priors is presented. Nonmonotone near-minimax almost-equalizer rules are derived for problems characterized by non-2e-MLR distributions. The derivation is based on the evaluation of a distribution-dependent function Q_c. The methodological importance of this function is that it is used to unify the discrete- and continuous-parameter problems, and to obtain a lower bound on the minimax risk for the non-2e-MLR case.     

Sequential estimation of the variance of an unknown distribution

Sequential fixed-width and risk-efficient estimation of the variance of an unspecified distribution is considered. The second-order asymptotic properties of the sequential rules are studied. Extensive simulation studies are carried out in order to study the small sample behavior of the sequential rules for some frequently used distributions.     

CLASSIFICATION, DISTRIBUTIONS AND ADMISSIBILITY IN AUTOREGRESSIVE PROCESS

The problem considered here is to classify a unit into one of two populations based on a vector of measurements on the unit. The observation vector is assumed to follow an auto-regressive process. Samples from the process are used to construct classification rules. The distributions of some classification statistics are obtained. The admissibility of some classification rules is established.     

An Application of Operational-Subjective Statistical Methods to Rational Expectations

This article presents a sequential scoring analysis of six econometric forecast distributions for the main components of the annual U.S. gross national product (GNP) accounts—nominal GNP, real GNP, and the implicit price deflator. Analysis of sequential forecasts is presented in terms of proper scoring rules. Computations relevant to the calibration and refinement properties of the forecast distributions are discussed. Annual data are studied for the period 1952–1982. The six forecast distributions are distinguished by the different stances they entail with respect to a subjectivist characterization of the rational-expectations hypothesis.     

基于大数据规则挖掘的交通拥堵治理研究

随着中国城市机动车保有量的急剧增多,交通拥堵已经成为现代城市病。交通拥堵在道路网络中呈现向四周放射的传导特性,拥堵路段倾向于将拥堵扩散传导到其他相邻路段,该特性此前未被系统研究过,综合比较各种方法的适用性,从时间和大数据规则挖掘角度对拥堵建模;使用时间序列规则挖掘算法建立交通拥堵传导规律模型,并基于传导规则预测未来交通流状况;更重要的是,挖掘出来的拥堵传导规则直观可用,能够用于建立拥堵预警防治机制,完善道路路网建设规划中不合理的部分,从而达到提升交通效率的目的。研究结果证明本模型能够较好达到研究目的,挖掘出的拥堵传导规则可以精确分析交通拥堵状况并预测未来交通流状况,因此可以为交通拥堵治理决策提供重要参考。     

ASSESSING ERROR RATE ESTIMATORS: THE LEAVE-ONE-OUT METHOD RECONSIDERED

Many comparative studies of the estimators of error rates of supervised classification rules are based on inappropriate criteria. In particular, although they fix the Bayes error rate, their summary statistics aggregate a range of true error rates. This means that their conclusions about the performance of classification rules cannot be trusted. This paper discusses the general issues involved, and then focuses attention specifically on the leave-one-out estimator. The estimator is investigated in a simulation study, both in absolute terms and in comparison with a popular bootstrap estimator. An improvement to the leave-one-out estimator is suggested, but the bootstrap estimator appears to maintain superiority even when the criteria are adjusted.     

Linear discrimination for three known normal populations

A random vector is assumed to have one of three known multivariate normal distributions with equal covariance matrices. It is desired to separate the three distributions by means of a single linear discriminant function. Such a function can lead to a classification rule. The function whose classification rule minimizes the average of the three probabilities of misclassification is found. Also the function is found whose rule minimizes the maximum of the three probabilities of misclassification.     

Minimum Scoring Rule Inference

Proper scoring rules are devices for encouraging honest assessment of probability distributions. Just like log‐likelihood, which is a special case, a proper scoring rule can be applied to supply an unbiased estimating equation for any statistical model, and the theory of such equations can be applied to understand the properties of the associated estimator. In this paper, we discuss some novel applications of scoring rules to parametric inference. In particular, we focus on scoring rule test statistics, and we propose suitable adjustments to allow reference to the usual asymptotic chi‐squared distribution. We further explore robustness and interval estimation properties, by both theory and simulations.     

Varying Naïve Bayes Models With Applications to Classification of Chinese Text Documents

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 problem, we propose a varying naïve Bayes model, which is a natural extension of the naïve Bayes model that allows for time-dependent classification rule. The method of kernel smoothing is developed for parameter estimation and a BIC-type criterion is invented for feature selection. Asymptotic theory is developed and numerical studies are conducted. Finally, the proposed method is demonstrated on a real dataset, which was generated by the Mayor Public Hotline of Changchun, the capital city of Jilin Province in Northeast China.