Steven de Rooij

According to our database1, Steven de Rooij authored at least 25 papers between 2004 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Large-scale network motif analysis using compression.
Data Min. Knowl. Discov., 2020

2018
A tutorial on MDL hypothesis testing for graph analysis.
CoRR, 2018

2017
An Expectation-Maximization Algorithm for the Fractal Inverse Problem.
CoRR, 2017

Large-Scale Network Motif Learning with Compression.
CoRR, 2017

2016
Are Names Meaningful? Quantifying Social Meaning on the Semantic Web.
Proceedings of the Semantic Web - ISWC 2016, 2016

2015
Substructure counting graph kernels for machine learning from RDF data.
J. Web Semant., 2015

A Compact In-Memory Dictionary for RDF Data.
Proceedings of the Semantic Web. Latest Advances and New Domains, 2015

Two Problems for Sophistication.
Proceedings of the Algorithmic Learning Theory - 26th International Conference, 2015

2014
Follow the leader if you can, hedge if you must.
J. Mach. Learn. Res., 2014

A Safe Approximation for Kolmogorov Complexity.
Proceedings of the Algorithmic Learning Theory - 25th International Conference, 2014

2013
Universal Codes From Switching Strategies.
IEEE Trans. Inf. Theory, 2013

Switching investments.
Theor. Comput. Sci., 2013

A Fast and Simple Graph Kernel for RDF.
Proceedings of the International Workshop on Data Mining on Linked Data, 2013

2012
Approximating Rate-Distortion Graphs of Individual Data: Experiments in Lossy Compression and Denoising.
IEEE Trans. Computers, 2012

2011
Adaptive Hedge.
Proceedings of the Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011. Proceedings of a meeting held 12-14 December 2011, 2011

2010
Following the Flattened Leader.
Proceedings of the COLT 2010, 2010

2009
Learning the Switching Rate by Discretising Bernoulli Sources Online.
Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics, 2009

2008
Catching Up Faster by Switching Sooner: A Prequential Solution to the AIC-BIC Dilemma
CoRR, 2008

The Catch-Up Phenomenon.
Proceedings of the 2008 IEEE Information Theory Workshop, 2008

Combining Expert Advice Efficiently.
Proceedings of the 21st Annual Conference on Learning Theory, 2008

2007
Catching Up Faster in Bayesian Model Selection and Model Averaging.
Proceedings of the Advances in Neural Information Processing Systems 20, 2007

2005
An Empirical Study of MDL Model Selection with Infinite Parametric Complexity
CoRR, 2005

MDL model selection using the ML plug-in code.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Asymptotic Log-Loss of Prequential Maximum Likelihood Codes.
Proceedings of the Learning Theory, 18th Annual Conference on Learning Theory, 2005

2004
Online Suffix Trees with Counts.
Proceedings of the 2004 Data Compression Conference (DCC 2004), 2004


  Loading...