3,261 research outputs found

    The interpoint depth for directional data

    No full text
    The notion of the interpoint depth is applied to spherical spaces by us-ing an appropriate angular distance function for data lying on the surfaceof the unit hypersphere. The traditional multivariate methods, indeed, arenot suitable for the analysis of directional data and this holds true also fordistance measures and related depth based methods. The interpoint depthfor directional data possesses some nice properties and can be used for highdimensional data analysis. This notion of depth is particularly useful toinvestigate local features of distribution such as multimodality and can beexploited to deal with many statistical problems. The behavior of the pro-posed depth is investigated by means of simulated data. In addition threeinteresting applications are presented

    Robustness aspects of DD-classifier for directional data

    No full text
    This book is the collection of the Abstract / Short Papers submitted by the authors of the International Conference of The CLAssification and Data Analysis Group (CLADAG) of the Italian Statistical Society (SIS), held in Milan (Italy) on September 13-15, 201

    A depth-based classifier for circular data

    No full text
    A depth-based procedure to perform supervised classification of circular data is developed. The proposed classifier is evaluated over a real data set by comparing its performance with the discriminant method introduced by Ackermann

    Depth-based classification of directional data

    No full text
    A non-parametric procedure based on the concept angular depth function is developed for dealing with classification problems of objects in directional statistics. Several notions of depth for directional data are adopted: the angular simplicial, the angular Tukey’s, the arc distance, the cosine distance and the chord distance depths. The proposed method is flexible and can be applied even in high-dimensional cases when a suitable notion of depth is adopted. Performances are investigated and compared by applying methods to different distributional settings through simulated and real data sets

    Clustering directional data through depth functions

    No full text
    A new depth-based clustering procedure for directional data is proposed. Such method is fully non-parametric and has the advantages to be flexible and applicable even in high dimensions when a suitable notion of depth is adopted. The introduced technique is evaluated through an extensive simulation study. In addition, a real data example in text mining is given to explain its effectiveness in comparison with other existing directional clustering algorithms
    corecore