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...
Main Authors: | Shohei Hidaka, Masafumi Oizumi |
---|---|
Format: | Article |
Language: | English |
Published: |
Public Library of Science (PLoS)
2018-01-01
|
Series: | PLoS ONE |
Online Access: | http://europepmc.org/articles/PMC6133274?pdf=render |
Similar Items
-
Efficient Algorithms for Searching the Minimum Information Partition in Integrated Information Theory
by: Jun Kitazono, et al.
Published: (2018-03-01) -
Fast and exact fixed-radius neighbor search based on sorting
by: Xinye Chen, et al.
Published: (2024-03-01) -
Exact formulae for the fractional partition functions
by: Iskander, Jonas, et al.
Published: (2021) -
Exact Bounds for Judicious Partitions of Graphs
by: Bolloband#x000E1;s, B, et al.
Published: (1999) -
Information loss associated with imperfect observation and mismatched decoding
by: Masafumi eOizumi, et al.
Published: (2011-03-01)