Minimum description length - PDFSEARCH.IO - Document Search Engine

Minimum description length
Results: 63

#	Item
1	Proofs for “Information Geometry and Minimum Description Length Networks” An Approximation of ln N (B, α) As the value of ln N (B, α) does not depend on the choice of the coordinate system, we abuse notation and v Add to Reading List Source URL: proceedings.mlr.press Language: English - Date: 2017-05-06 17:27:04
2	Information Geometry and Minimum Description Length Networks Ke Sun SUNK . EDU @ GMAIL . COM Viper Group, Computer Vision and Multimedia Laboratory, University of Geneva, Switzerland Jun Wang Add to Reading List Source URL: proceedings.mlr.press Language: English - Date: 2017-05-06 17:27:04
3	When Data Compression and Statistics Disagree Two Frequentist Challenges for the Minimum Description Length Principle Tim van Erven Add to Reading List Source URL: www.timvanerven.nl Language: English - Date: 2012-06-05 11:28:55
4	The 30th Annual Conference of the Japanese Society for Artificial Intelligence, 2016 2E4-OS-12a-3 汎用知能の知識記述長最小化原理仮説の提案 Proposing minimum knowledge description length principle for Add to Reading List Source URL: kaigi.org - Date: 2016-06-06 06:56:12
5	MDL4BMF: Minimum Description Length for Boolean Matrix Factorization PAULI MIETTINEN, Max-Planck Institute for Informatics JILLES VREEKEN, Max-Planck Institute for Informatics, Saarland University, University of Antwerp Add to Reading List Source URL: eda.mmci.uni-saarland.de - Date: 2014-10-08 03:56:01
6	Powerpoint-presentation Information and Computing Sciences Add to Reading List Source URL: usefulpatterns.org Language: English - Date: 2015-04-25 08:23:03 Theoretical computer science Theory of computation Algorithmic information theory Computability theory Academia Randomness Turing machine Kolmogorov complexity Algorithmically random sequence Algorithmic probability Minimum description length Complexity
7	A MDL4BMF: Minimum Description Length for Boolean Matrix Factorization PAULI MIETTINEN, Max-Planck Institute for Informatics JILLES VREEKEN, Max-Planck Institute for Informatics, Saarland University, University of Antwer Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2014-05-09 10:45:37 Algebra Mathematics Linear algebra Matrix theory Numerical linear algebra Multivariate statistics Dimension reduction Non-negative matrix factorization Matrix Singular value decomposition Principal component analysis Factorization
8	Chapter 1 MINING AND USING SETS OF PATTERNS THROUGH COMPRESSION Matthijs van Leeuwen KU Leuven Leuven, Belgium Add to Reading List Source URL: www.patternsthatmatter.org Language: English - Date: 2014-12-31 10:52:18 Algorithmic information theory Information theory Cybernetics Formal sciences Theoretical computer science Statistics Minimum description length Statistical theory Lossless compression Minimum message length Data compression Kolmogorov complexity
9	Data Min Knowl Disc:169–214 DOIs10618x K RIMP: mining itemsets that compress Jilles Vreeken · Matthijs van Leeuwen · Arno Siebes Add to Reading List Source URL: eda.mmci.uni-saarland.de Language: English - Date: 2011-05-19 07:17:24 Algorithmic information theory Minimum description length Regular expression Data mining Apriori algorithm Bioinformatics Association rule learning
10	Powerpoint-presentation Information and Computing Sciences Add to Reading List Source URL: www.usefulpatterns.org Language: English - Date: 2015-04-25 08:23:03 Algorithmic information theory Computability theory Randomness Theoretical computer science Turing machine Kolmogorov complexity Algorithmically random sequence Algorithmic probability Minimum description length Complexity Ray Solomonoff Algorithm