Dataset Information

Location-Scale Matching for Approximate Quasi-Order Sampling.

ABSTRACT: Quasi-orders are reflexive and transitive binary relations and have many applications. Examples are the dependencies of mastery among the problems of a psychological test, or methods such as item tree or Boolean analysis that mine for quasi-orders in empirical data. Data mining techniques are typically tested based on simulation studies with unbiased samples of randomly generated quasi-orders. In this paper, we develop techniques for the approximately representative sampling of quasi-orders. Polynomial regression curves are fitted for the mean and standard deviation of quasi-order size as a function of item number. The resulting regression graphs are seen to be quadratic and linear functions, respectively. The extrapolated values for the mean and standard deviation are used to propose two quasi-order sampling techniques. The discrete method matches these location and scale measures with a transformed discrete distribution directly obtained from the sample. The continuous method uses the normal density function with matched expectation and variance. The quasi-orders are constructed according to the biased randomized doubly inductive construction, however they are resampled to become approximately representative following the matched discrete and continuous distributions. In simulations, we investigate the usefulness of these methods. The location-scale matching approach can cope with very large item sets. Close to representative samples of random quasi-orders are constructed for item numbers up to n = 400.

SUBMITTER: Unlu A

PROVIDER: S-EPMC6573793 | biostudies-other | 2019

REPOSITORIES: biostudies-other

ACCESS DATA

Publications

Location-Scale Matching for Approximate Quasi-Order Sampling.

Ünlü Ali A Schrepp Martin M

Frontiers in psychology 20190610

Quasi-orders are reflexive and transitive binary relations and have many applications. Examples are the dependencies of mastery among the problems of a psychological test, or methods such as item tree or Boolean analysis that mine for quasi-orders in empirical data. Data mining techniques are typically tested based on simulation studies with unbiased samples of randomly generated quasi-orders. In this paper, we develop techniques for the approximately representative sampling of quasi-orders. Pol ...[more]

PMID: 31244703

Similar Datasets

Project description:BACKGROUND: The high throughput of modern NGS sequencers coupled with the huge sizes of genomes currently analysed, poses always higher algorithmic challenges to align short reads quickly and accurately against a reference sequence. A crucial, additional, requirement is that the data structures used should be light. The available modern solutions usually are a compromise between the mentioned constraints: in particular, indexes based on the Burrows-Wheeler transform offer reduced memory requirements at the price of lower sensitivity, while hash-based text indexes guarantee high sensitivity at the price of significant memory consumption. METHODS: In this work we describe a technique that permits to attain the advantages granted by both classes of indexes. This is achieved using Hamming-aware hash functions--hash functions designed to search the entire Hamming sphere in reduced time--which are also homomorphisms on de Bruijn graphs. We show that, using this particular class of hash functions, the corresponding hash index can be represented in linear space introducing only a logarithmic slowdown (in the query length) for the lookup operation. We point out that our data structure reaches its goals without compressing its input: another positive feature, as in biological applications data is often very close to be un-compressible. RESULTS: The new data structure introduced in this work is called dB-hash and we show how its implementation--BW-ERNE--maintains the high sensitivity and speed of its (hash-based) predecessor ERNE, while drastically reducing space consumption. Extensive comparison experiments conducted with several popular alignment tools on both simulated and real NGS data, show, finally, that BW-ERNE is able to attain both the positive features of succinct data structures (that is, small space) and hash indexes (that is, sensitivity). CONCLUSIONS: In applications where space and speed are both a concern, standard methods often sacrifice accuracy to obtain competitive throughputs and memory footprints. In this work we show that, combining hashing and succinct indexing techniques, we can attain good performances and accuracy with a memory footprint comparable to that of the most popular compressed indexes.

Project description:In brain imaging, accurate alignment of cortical surfaces is fundamental to the statistical sensitivity and spatial localisation of group studies, and cortical surface-based alignment has generally been accepted to be superior to volume-based approaches at aligning cortical areas. However, human subjects have considerable variation in cortical folding, and in the location of functional areas relative to these folds. This makes alignment of cortical areas a challenging problem. The Multimodal Surface Matching (MSM) tool is a flexible, spherical registration approach that enables accurate registration of surfaces based on a variety of different features. Using MSM, we have previously shown that driving cross-subject surface alignment, using areal features, such as resting state-networks and myelin maps, improves group task fMRI statistics and map sharpness. However, the initial implementation of MSM's regularisation function did not penalize all forms of surface distortion evenly. In some cases, this allowed peak distortions to exceed neurobiologically plausible limits, unless regularisation strength was increased to a level which prevented the algorithm from fully maximizing surface alignment. Here we propose and implement a new regularisation penalty, derived from physically relevant equations of strain (deformation) energy, and demonstrate that its use leads to improved and more robust alignment of multimodal imaging data. In addition, since spherical warps incorporate projection distortions that are unavoidable when mapping from a convoluted cortical surface to the sphere, we also propose constraints that enforce smooth deformation of cortical anatomies. We test the impact of this approach for longitudinal modelling of cortical development for neonates (born between 31 and 43 weeks of post-menstrual age) and demonstrate that the proposed method increases the biological interpretability of the distortion fields and improves the statistical significance of population-based analysis relative to other spherical methods.

Dataset Information

Location-Scale Matching for Approximate Quasi-Order Sampling.

Publications

Location-Scale Matching for Approximate Quasi-Order Sampling.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets