Browse
Submit Data
Databases
API
Help

Dataset Information

20 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Subitizing, unlike estimation, does not process sets in parallel.

ABSTRACT: Enumeration of very small quantities is a common task that we perform everyday. Much research has highlighted that in these conditions humans display fast, near errorless performance, a phenomenon dubbed subitizing. It has been suggested that this regime has a pivotal role in numerosity perception. Here we asked if this system can process multiple sets of items in parallel. At odds with what happens for moderate numerosities, we found a strong impairment caused already by the introduction of a second group of items marked by a different color. Adding shape as a cue provided no benefit. The only case in which subitizing was possible was when the target and distractor group were held constant through the experimental block. These results show the surprising fact that whilst being rapid and errorless, subitizing does not have the capability to disentangle multiple groups of items and deals only with coarse stimulus statistics.

SUBMITTER: Liu W

PROVIDER: S-EPMC7518424 | biostudies-literature | 2020 Sep

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Subitizing, unlike estimation, does not process sets in parallel.

Liu Wei W Zheng Peng P Huang Shaofang S Cicchini Guido Marco GM

Scientific reports 20200924 1

Enumeration of very small quantities is a common task that we perform everyday. Much research has highlighted that in these conditions humans display fast, near errorless performance, a phenomenon dubbed subitizing. It has been suggested that this regime has a pivotal role in numerosity perception. Here we asked if this system can process multiple sets of items in parallel. At odds with what happens for moderate numerosities, we found a strong impairment caused already by the introduction of a s ...[more]

PMID: 32973306

Similar Datasets

Topographic numerosity maps cover subitizing and estimation ranges.

Project description:Numerosity, the set size of a group of items, helps guide behaviour and decisions. Non-symbolic numerosities are represented by the approximate number system. However, distinct behavioural performance suggests that small numerosities, i.e. subitizing range, are implemented differently in the brain than larger numerosities. Prior work has shown that neural populations selectively responding (i.e. hemodynamic responses) to small numerosities are organized into a network of topographical maps. Here, we investigate how neural populations respond to large numerosities, well into the ANS. Using 7 T fMRI and biologically-inspired analyses, we found a network of neural populations tuned to both small and large numerosities organized within the same topographic maps. These results demonstrate a continuum of numerosity preferences that progressively cover both the subitizing range and beyond within the same numerosity map, suggesting a single neural mechanism. We hypothesize that differences in map properties, such as cortical magnification and tuning width, underlie known differences in behaviour.

| S-EPMC8184945 | biostudies-literature

Density Estimation on Small Data Sets.

Project description:How might a smooth probability distribution be estimated with accurately quantified uncertainty from a limited amount of sampled data? Here we describe a field-theoretic approach that addresses this problem remarkably well in one dimension, providing an exact nonparametric Bayesian posterior without relying on tunable parameters or large-data approximations. Strong non-Gaussian constraints, which require a nonperturbative treatment, are found to play a major role in reducing distribution uncertainty. A software implementation of this method is provided.

| S-EPMC6487661 | biostudies-literature

Parameter estimation on multivalent ITC data sets.

Project description:The Wiseman fitting can be used to extract binding parameters from ITC data sets, such as heat of binding, number of binding sites, and the overall dissociation rate. The classical Wiseman fitting assumes a direct binding process and neglects the possibility of intermediate binding steps. In principle, it only provides thermodynamic information and not the kinetics of the process. In this article we show that a concentration dependent dissociation constant could possibly stem from intermediate binding steps. The mathematical form of this dependency can be exploited with the aid of the Robust Perron Cluster Cluster Analysis method. Our proposed extension of the Wiseman fitting rationalizes the concentration dependency, and can probably also be used to determine the kinetic parameters of intermediate binding steps of a multivalent binding process. The novelty of this paper is to assume that the binding rate varies per titration step due to the change of the ligand concentration and to use this information in the Wiseman fitting. We do not claim to produce the most accurate values of the binding parameters, we rather present a novel method of how to approach multivalent bindings from a different angle.

| S-EPMC9352788 | biostudies-literature

Haplotype estimation for biobank-scale data sets.

Project description:The UK Biobank (UKB) has recently released genotypes on 152,328 individuals together with extensive phenotypic and lifestyle information. We present a new phasing method, SHAPEIT3, that can handle such biobank-scale data sets and results in switch error rates as low as ?0.3%. The method exhibits O(NlogN) scaling with sample size N, enabling fast and accurate phasing of even larger cohorts.

| S-EPMC4926957 | biostudies-other

Parallel clustering algorithm for large-scale biological data sets.

Project description:BACKGROUNDS: Recent explosion of biological data brings a great challenge for the traditional clustering algorithms. With increasing scale of data sets, much larger memory and longer runtime are required for the cluster identification problems. The affinity propagation algorithm outperforms many other classical clustering algorithms and is widely applied into the biological researches. However, the time and space complexity become a great bottleneck when handling the large-scale data sets. Moreover, the similarity matrix, whose constructing procedure takes long runtime, is required before running the affinity propagation algorithm, since the algorithm clusters data sets based on the similarities between data pairs. METHODS: Two types of parallel architectures are proposed in this paper to accelerate the similarity matrix constructing procedure and the affinity propagation algorithm. The memory-shared architecture is used to construct the similarity matrix, and the distributed system is taken for the affinity propagation algorithm, because of its large memory size and great computing capacity. An appropriate way of data partition and reduction is designed in our method, in order to minimize the global communication cost among processes. RESULT: A speedup of 100 is gained with 128 cores. The runtime is reduced from serval hours to a few seconds, which indicates that parallel algorithm is capable of handling large-scale data sets effectively. The parallel affinity propagation also achieves a good performance when clustering large-scale gene data (microarray) and detecting families in large protein superfamilies.

| S-EPMC3976248 | biostudies-literature

Electrophysiological Correlates of Subitizing in Healthy Aging.

Project description:To understand the nature of age-related changes in enumeration abilities we measured two ERP responses -N2pc and CDA, associated respectively to attentive individuation and VWM- and posterior alpha band (8-15 Hz) event-related desynchronization (ERD), traditionally linked to enhanced target processing. Two groups of old and young participants enumerated a variable number (1-6) of targets presented among distractors. Older participants were less accurate in enumerating targets. ERP results in old participants showed a suppression of N2pc amplitudes for all numerosities, and a decrease in CDA only for the largest set (4-6 targets). In contrast with the pattern for young adults, time/frequency results on older adults revealed neither a modulation of alpha oscillations as a function of target numerosity, nor an effect of ERD lateralization. These patterns indicate that both attention and working memory contribute to the age-related decline in enumeration, and point to an overall decrease in the activity of the visual areas responsible for the processing of the hemifield where the relevant objects are presented.

| S-EPMC4476746 | biostudies-literature

Effect of Non-canonical Spatial Symmetry on Subitizing.

Project description:Subitizing refers to ability of people to accurately and effortlessly enumerate a small number of items, with a capacity around four elements. Previous research showed that "canonical" organizations, such as familiar layouts on a dice, can readily improve subitizing performance of people. However, almost all canonical shapes found in the world are also highly symmetrical; therefore, it is unclear whether previously reported facilitative effect of canonical organization is really due to canonicality, or simply driven by spatial symmetry. Here, we investigated the possible effect of symmetry on subitizing by using symmetrical, yet non-canonical, shape structures. These symmetrical layouts were compared with highly controlled random patterns (Experiment 1), as well as fully random and canonical patterns (Experiment 2). Our results showed that symmetry facilitates subitizing performance, but only at set size of 6, suggesting that the effect is insufficient to improve performance of people in the lower or upper range. This was also true, although weaker, in reaction time (RT), error distance measures, and Weber Fractions. On the other hand, canonical layouts produced faster and more accurate subitizing performances across multiple set sizes. We conclude that, although previous findings mixed symmetry in their canonical shapes, their findings on shape canonicality cannot be explained by symmetry alone. We also propose that our symmetrical and canonical results are best explained by the "groupitizing" and pattern recognition accounts, respectively.

| S-EPMC8358310 | biostudies-literature

Subitizing object parts reveals a second stage of individuation.

Project description:Humans can efficiently individuate a small number of objects. This subitizing ability is thought to be a consequence of limited attentional resources. However, how and what is selected during the individuation process remain outstanding questions. We investigated these in four experiments by examining if parts of objects are enumerated as efficiently as distinct objects in the presence and absence of distractor objects. We found that distractor presence reduced subitizing efficiency. Crucially, parts connected to multiple objects were enumerated less efficiently than independent objects or parts connected to a single object. These results argue against direct individuation of parts and show that objecthood plays a fundamental role in individuation. Objects are selected first and their components are selected in subsequent steps. This reveals that individuation operates sequentially over multiple levels.

| S-EPMC8062358 | biostudies-literature

Repulsive parallel MCMC algorithm for discovering diverse motifs from large sequence sets.

Project description:MotivationThe motif discovery problem consists of finding recurring patterns of short strings in a set of nucleotide sequences. This classical problem is receiving renewed attention as most early motif discovery methods lack the ability to handle large data of recent genome-wide ChIP studies. New ChIP-tailored methods focus on reducing computation time and pay little regard to the accuracy of motif detection. Unlike such methods, our method focuses on increasing the detection accuracy while maintaining the computation efficiency at an acceptable level. The major advantage of our method is that it can mine diverse multiple motifs undetectable by current methods.ResultsThe repulsive parallel Markov chain Monte Carlo (RPMCMC) algorithm that we propose is a parallel version of the widely used Gibbs motif sampler. RPMCMC is run on parallel interacting motif samplers. A repulsive force is generated when different motifs produced by different samplers near each other. Thus, different samplers explore different motifs. In this way, we can detect much more diverse motifs than conventional methods can. Through application to 228 transcription factor ChIP-seq datasets of the ENCODE project, we show that the RPMCMC algorithm can find many reliable cofactor interacting motifs that existing methods are unable to discover.

| S-EPMC4426842 | biostudies-literature

Estimation of treatment effect for the sequential parallel design.

Project description:The sequential parallel clinical trial is a novel clinical trial design being used in psychiatric diseases that are known to have potentially high placebo response rates. The design consists of an initial parallel trial of placebo versus drug augmented by a second parallel trial of placebo versus drug in the placebo non-responders from the initial trial. Statistical research on the design has focused on hypothesis tests. However, an equally important output from any clinical trial is the estimate of treatment effect and variability around that estimate. In the sequential parallel trial, the most important treatment effect is the effect in the overall population. This effect can be estimated by considering only the first phase of the trial, but this ignores useful information from the second phase of the trial. We develop estimates of treatment effect that incorporate data from both phases of the trial. Our simulations and a real data example suggest that there can be substantial gains in precision by incorporating data from both phases. The potential gains appear to be greatest in moderate-sized trials, which would typically be the case in phase II trials.

| S-EPMC3882761 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data