ArticlePloS one2018
Fast and exact search for the partition with minimal information loss.
Article in PloS one, 2018. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 12 papers.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
12 citing papers in PubMed.
- Information structure of heterogeneous criticality in a fish school.Scientific reports · 2024Article
- Partial Information Decomposition: Redundancy as Information Bottleneck.Entropy (Basel, Switzerland) · 2024Article
- An implementation of integrated information theory in resting-state fMRI.Communications biology · 2023Article
- Separating weak integrated information theory into inspired and aspirational approaches.Neuroscience of consciousness · 2023Review
- The ambiguous feeling between "mine" and "not-mine" measured by integrated information theory during rubber hand illusion.Scientific reports · 2022Article
- Filtering ASVs/OTUs via mutual information-based microbiome network analysis.BMC bioinformatics · 2022Article
- Integrated information structure collapses with anesthetic loss of conscious arousal in Drosophila melanogaster.PLoS computational biology · 2021Article
- Evaluating Approximations and Heuristic Measures of Integrated Information.Entropy (Basel, Switzerland) · 2019Article
- Exclusion and Underdetermined Qualia.Entropy (Basel, Switzerland) · 2019Article
- Integrated Information as a Measure of Cognitive Processes in Coupled Genetic Repressilators.Entropy (Basel, Switzerland) · 2019Article
- Measuring Integrated Information: Comparison of Candidate Measures in Theory and Simulation.Entropy (Basel, Switzerland) · 2018Article
- Efficient Algorithms for Searching the Minimum Information Partition in Integrated Information Theory.Entropy (Basel, Switzerland) · 2018Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
2 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
In analysis of multi-component complex systems, such as neural systems, identifying groups of units that share similar functionality will aid understanding of the underlying structures of the system. To find such a grouping, it is useful to evaluate to what extent the units of the system are separable. Separability or inseparability can be evaluated by quantifying how much information would be lost if the system were partitioned into subsystems, and the interactions between the subsystems were hypothetically removed. A system of two independent subsystems are completely separable without any loss of information while a system of strongly interacted subsystems cannot be separated without a large loss of information. Among all the possible partitions of a system, the partition that minimizes the loss of information, called the Minimum Information Partition (MIP), can be considered as the optimal partition for characterizing the underlying structures of the system. Although the MIP would reveal novel characteristics of the neural system, an exhaustive search for the MIP is numerically intractable due to the combinatorial explosion of possible partitions. Here, we propose a computationally efficient search to precisely identify the MIP among all possible partitions by exploiting the submodularity of the measure of information loss, when the measure of information loss is submodular. Submodularity is a mathematical property of set functions which is analogous to convexity in continuous functions. Mutual information is one such submodular information loss function, and is a natural choice for measuring the degree of statistical dependence between paired sets of random variables. By using mutual information as a loss function, we show that the search for MIP can be performed in a practical order of computational time for a reasonably large system (N = 100 ∼ 1000). We also demonstrate that MIP search allows for the detection of underlying global structures in a network of nonlinear oscillators.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.