Cargando…
Fast and exact search for the partition with minimal information loss
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 separab...
Autores principales: | , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2018
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6133274/ https://www.ncbi.nlm.nih.gov/pubmed/30204751 http://dx.doi.org/10.1371/journal.pone.0201126 |
_version_ | 1783354485816426496 |
---|---|
author | Hidaka, Shohei Oizumi, Masafumi |
author_facet | Hidaka, Shohei Oizumi, Masafumi |
author_sort | Hidaka, Shohei |
collection | PubMed |
description | 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. |
format | Online Article Text |
id | pubmed-6133274 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2018 |
publisher | Public Library of Science |
record_format | MEDLINE/PubMed |
spelling | pubmed-61332742018-09-27 Fast and exact search for the partition with minimal information loss Hidaka, Shohei Oizumi, Masafumi PLoS One Research Article 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. Public Library of Science 2018-09-11 /pmc/articles/PMC6133274/ /pubmed/30204751 http://dx.doi.org/10.1371/journal.pone.0201126 Text en © 2018 Hidaka, Oizumi http://creativecommons.org/licenses/by/4.0/ This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/) , which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. |
spellingShingle | Research Article Hidaka, Shohei Oizumi, Masafumi Fast and exact search for the partition with minimal information loss |
title | Fast and exact search for the partition with minimal information loss |
title_full | Fast and exact search for the partition with minimal information loss |
title_fullStr | Fast and exact search for the partition with minimal information loss |
title_full_unstemmed | Fast and exact search for the partition with minimal information loss |
title_short | Fast and exact search for the partition with minimal information loss |
title_sort | fast and exact search for the partition with minimal information loss |
topic | Research Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6133274/ https://www.ncbi.nlm.nih.gov/pubmed/30204751 http://dx.doi.org/10.1371/journal.pone.0201126 |
work_keys_str_mv | AT hidakashohei fastandexactsearchforthepartitionwithminimalinformationloss AT oizumimasafumi fastandexactsearchforthepartitionwithminimalinformationloss |