Results 11 to 20 of about 55,495 (230)
Bitcoin price prediction using machine learning: An approach to sample dimension engineering
Journal of Computational and Applied Mathematics, 2020 After the boom and bust of cryptocurrencies’ prices in recent years, Bitcoin has been increasingly regarded as an investment asset. Because of its highly volatile nature, there is a need for good predictions on which to base investment decisions ...
Zheshi Chen, Chunhong Li, Wenjun Sun
semanticscholar +1 more source
A Decomposition Method for Global Evaluation of Shannon Entropy and Local Estimations of Algorithmic Complexity [PDF]
Entropy, 2016 We investigate the properties of a Block Decomposition Method (BDM), which extends the power of a Coding Theorem Method (CTM) that approximates local estimations of algorithmic complexity based on Solomonoff–Levin’s theory of algorithmic probability ...
H. Zenil +5 more
semanticscholar +1 more source
Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement [PDF]
Quantum Science and TechnologyWhile scalable error correction schemes and fault tolerant quantum computing seem not to be universally accessible in the near sight, the efforts of many researchers have been directed to the exploration of the contemporary available quantum hardware ...
Guilherme Ilário Correr +4 more
semanticscholar +1 more source
Translating the Cantor set by a random [PDF]
, 2011 We determine the constructive dimension of points in random translates of the Cantor set. The Cantor set "cancels randomness" in the sense that some of its members, when added to Martin-Lof random reals, identify a point with lower constructive dimension
Dougherty, Randall +3 more
core +2 more sources
Deep Isolation Forest for Anomaly Detection [PDF]
IEEE Transactions on Knowledge and Data Engineering, 2022 Isolation forest (iForest) has been emerging as arguably the most popular anomaly detector in recent years due to its general effectiveness across different benchmarks and strong scalability.
Hongzuo Xu +3 more
semanticscholar +1 more source
Constructions of cyclic constant dimension codes [PDF]
Designs, Codes and Cryptography, 2017 Subspace codes and particularly constant dimension codes have attracted much attention in recent years due to their applications in random network coding.
Bocong Chen, Hongwei Liu
semanticscholar +1 more source
Randomness extraction and asymptotic Hamming distance [PDF]
, 2013 We obtain a non-implication result in the Medvedev degrees by studying sequences that are close to Martin-L\"of random in asymptotic Hamming distance. Our result is that the class of stochastically bi-immune sets is not Medvedev reducible to the class of
Bjoern Kjos-Hanssen +2 more
core +2 more sources
Asymmetry of the Kolmogorov complexity of online predicting odd and even bits [PDF]
, 2014 Symmetry of information states that $C(x) + C(y|x) = C(x,y) + O(\log C(x))$. We show that a similar relation for online Kolmogorov complexity does not hold. Let the even (online Kolmogorov) complexity of an n-bitstring $x_1x_2...
Bauwens, Bruno
core +3 more sources
Compressibility, laws of nature, initial conditions and complexity [PDF]
, 2017 We critically analyse the point of view for which laws of nature are just a mean to compress data. Discussing some basic notions of dynamical systems and information theory, we show that the idea that the analysis of large amount of data by means of an ...
Chibbaro, Sergio, Vulpiani, Angelo
core +3 more sources
Lower Error Bounds for Randomized Multilevel and Changing Dimension Algorithms [PDF]
, 2013 We provide lower error bounds for randomized algorithms that approximate integrals of functions depending on an unrestricted or even infinite number of variables. More precisely, we consider the infinite-dimensional integration problem on weighted Hilbert spaces with an underlying anchored decomposition and arbitrary weights.
openaire +2 more sources