1,512 research outputs found

    Fast DD-classification of functional data

    Full text link
    A fast nonparametric procedure for classifying functional data is introduced. It consists of a two-step transformation of the original data plus a classifier operating on a low-dimensional hypercube. The functional data are first mapped into a finite-dimensional location-slope space and then transformed by a multivariate depth function into the DDDD-plot, which is a subset of the unit hypercube. This transformation yields a new notion of depth for functional data. Three alternative depth functions are employed for this, as well as two rules for the final classification on [0,1]q[0,1]^q. The resulting classifier has to be cross-validated over a small range of parameters only, which is restricted by a Vapnik-Cervonenkis bound. The entire methodology does not involve smoothing techniques, is completely nonparametric and allows to achieve Bayes optimality under standard distributional settings. It is robust, efficiently computable, and has been implemented in an R environment. Applicability of the new approach is demonstrated by simulations as well as a benchmark study

    Better Be Convincing or Better Be Stylish? a Theory Based Multi-Agent Simulation to Explain Minority Influence in Groups Via Arguments or Via Peripheral Cues

    Get PDF
    Very often in the history of mankind, social changes took place because a minority was successful in persuading the dominant majority of a new idea. Social psychology provides empirically well-founded theories of social influence that can explain the power of minorities at individual level. In this contribution, we present an agent-based computer simulation of one such theory, the Elaboration Likelihood Model (ELM). After introducing the theoretical background and our agent model, we present three simulation experiments that confirm past laboratory research but also go beyond its findings by adopting the method of computer simulation. First, we found that even a minority with low argument quality can be successful as long as it has positive peripheral cues. Second, our results suggest that a higher personal relevance of a topic for the majority led it to be more receptive to minority influence only when the minority showed neutral peripheral cues and very good arguments. Third, we found evidence that a neutral or only slightly biased majority is influenced more easily than a strongly biased one. To sum up, we consider these results to illustrate the notion that a well-presented, comprehensible and valid computer simulation provides a useful tool for theory development and application in an exploratory manner as long as it is well founded in terms of the model and theory.Social Influences, Persuasion Processes, Group Processes, Minority Influence, Computer Simulation, Modelling, Theory Verification, Simulation Experiments

    Price majorization and the inverse Lorenz function

    Get PDF
    The paper presents an approach to the measurement of economic disparity in several commodities. We introduce a special view on the usual Lorenz curve and extend this view to the multivariate situation: Given a vector of shares of the total endowments in each commodity, the multivariate inverse Lorenz function (ILF) indicates the maximum percentage of the population by which these shares or less are held. Its graph is the Lorenz hypersurface. Many properties of the ILF are studied and the equivalence of the pointwise ordering of ILFs and the price Lorenz order is established. We also study similar notions for distributions of absolute endowments. Finally, several disparity indices are suggested that are consistent with these orderings. --Multivariate Lorenz order,directional majorization,price Lorenz order,generalized Lorenz function,multivariate disparity indices

    Can Markov-regime switching models improve power price forecasts? Evidence for German daily power prices

    Get PDF
    Nonlinear autoregressive Markov regime-switching models are intuitive and frequently proposed time series approaches for the modelling of electricity spot prices. In this paper such models are compared to an ordinary linear autoregressive model with regard to their forecast performance. The study is carried out using German daily spot prices from the European Energy Exchange in Leipzig. Four nonlinear models are used for the forecast study. The resultsof the study suggest that Markov regime-switching models provide better forecasts than linear models. --Electricity spot prices,Markov regime-switching,forecasting

    An exact algorithm for weighted-mean trimmed regions in any dimension

    Get PDF
    Trimmed regions are a powerful tool of multivariate data analysis. They describe a probability distribution in Euclidean d-space regarding location, dispersion, and shape, and they order multivariate data with respect to their centrality. Dyckerhoff and Mosler (201x) have introduced the class of weighted-mean trimmed regions, which possess attractive properties regarding continuity, subadditivity, and monotonicity. We present an exact algorithm to compute the weighted-mean trimmed regions of a given data cloud in arbitrary dimension d. These trimmed regions are convex polytopes in Rd. To calculate them, the algorithm builds on methods from computational geometry. A characterization of a region's facets is used, and information about the adjacency of the facets is extracted from the data. A key problem consists in ordering the facets. It is solved by the introduction of a tree-based order. The algorithm has been programmed in C++ and is available as an R package. --central regions,data depth,multivariate data analysis,convex polytope,computational geometry,algorithm,C++, R

    Fast computation of Tukey trimmed regions and median in dimension p>2p>2

    Full text link
    Given data in Rp\mathbb{R}^{p}, a Tukey κ\kappa-trimmed region is the set of all points that have at least Tukey depth κ\kappa w.r.t. the data. As they are visual, affine equivariant and robust, Tukey regions are useful tools in nonparametric multivariate analysis. While these regions are easily defined and interpreted, their practical use in applications has been impeded so far by the lack of efficient computational procedures in dimension p>2p > 2. We construct two novel algorithms to compute a Tukey κ\kappa-trimmed region, a na\"{i}ve one and a more sophisticated one that is much faster than known algorithms. Further, a strict bound on the number of facets of a Tukey region is derived. In a large simulation study the novel fast algorithm is compared with the na\"{i}ve one, which is slower and by construction exact, yielding in every case the same correct results. Finally, the approach is extended to an algorithm that calculates the innermost Tukey region and its barycenter, the Tukey median

    Checking for orthant orderings between discrete multivariate distributions: An algorithm

    Get PDF
    We consider four orthant stochastic orderings between random vectors X and Y that have finitely discrete probability distributions in IRk. For each of the orderings conditions have been developed that are necessary and sufficient for dominance of Y over X. We present an algorithm that checks these conditions in an efficient way by operating on a semilattice generated by the support of the two distributions. In particular, the algorithm can be used to compute multivariate Smirnov statistics. --Multivariate stochastic orders,decision under risk,comparison of empirical distribution functions
    corecore