Minimal algorithmic information loss methods for dimension reduction, feature selection and network sparsification

H Zenil, NA Kiani, A Adams, FS Abrahão… - arxiv preprint arxiv …, 2018 - arxiv.org
We present a novel, domain-agnostic, model-independent, unsupervised, and universally
applicable approach for data summarization. Specifically, we focus on addressing the …

[HTML][HTML] Algorithmic information distortions in node-aligned and node-unaligned multidimensional networks

FS Abrahão, K Wehmuth, H Zenil, A Ziviani - Entropy, 2021 - mdpi.com
In this article, we investigate limitations of importing methods based on algorithmic
information theory from monoplex networks into multidimensional networks (such as …

An Algorithmic Information Distortion in Multidimensional Networks

FS Abrahao, K Wehmuth, H Zenil, A Ziviani - Complex Networks & Their …, 2021 - Springer
Network complexity, network information content analysis, and lossless compressibility of
graph representations have been played an important role in network analysis and network …

Transtemporal edges and crosslayer edges in incompressible high-order networks

FS Abrahao, K Wehmuth, A Ziviani - arxiv preprint arxiv:1905.05276, 2019 - arxiv.org
This work presents some outcomes of a theoretical investigation of incompressible high-
order networks defined by a generalized graph representation. We study some of their …

On the existence of hidden machines in computational time hierarchies

FS Abrahão, K Wehmuth, A Ziviani - arxiv preprint arxiv:2009.01145, 2020 - arxiv.org
Challenging the standard notion of totality in computable functions, one has that, given any
sufficiently expressive formal axiomatic system, there are total functions that, although …

[ЦИТАТА][C] Algorithmic information and incompressibility of families of multidimensional networks

FS Abrahao, K Wehmuth, H Zenil, A Ziviani - 2018 - Research report