default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSteven de Rooij
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j6]Peter Bloem
, Steven de Rooij:
Large-scale network motif analysis using compression. Data Min. Knowl. Discov. 34(5): 1421-1453 (2020)
2010 – 2019
- 2018
- [i10]Peter Bloem, Steven de Rooij:
A tutorial on MDL hypothesis testing for graph analysis. CoRR abs/1810.13163 (2018) - 2017
- [i9]Peter Bloem, Steven de Rooij:
Large-Scale Network Motif Learning with Compression. CoRR abs/1701.02026 (2017) - [i8]Peter Bloem, Steven de Rooij:
An Expectation-Maximization Algorithm for the Fractal Inverse Problem. CoRR abs/1706.03149 (2017) - 2016
- [c15]Steven de Rooij, Wouter Beek, Peter Bloem, Frank van Harmelen, Stefan Schlobach:
Are Names Meaningful? Quantifying Social Meaning on the Semantic Web. ISWC (1) 2016: 184-199 - 2015
- [j5]Gerben Klaas Dirk de Vries, Steven de Rooij:
Substructure counting graph kernels for machine learning from RDF data. J. Web Semant. 35: 71-84 (2015) - [c14]Peter Bloem, Steven de Rooij, Pieter Adriaans:
Two Problems for Sophistication. ALT 2015: 379-394 - [c13]Hamid R. Bazoobandi, Steven de Rooij, Jacopo Urbani, Annette ten Teije, Frank van Harmelen, Henri E. Bal:
A Compact In-Memory Dictionary for RDF Data. ESWC 2015: 205-220 - 2014
- [j4]Steven de Rooij, Tim van Erven, Peter D. Grünwald, Wouter M. Koolen:
Follow the leader if you can, hedge if you must. J. Mach. Learn. Res. 15(1): 1281-1316 (2014) - [c12]Peter Bloem, Francisco Mota, Steven de Rooij, Luis Antunes, Pieter Adriaans:
A Safe Approximation for Kolmogorov Complexity. ALT 2014: 336-350 - 2013
- [j3]Wouter M. Koolen, Steven de Rooij:
Switching investments. Theor. Comput. Sci. 473: 61-76 (2013) - [j2]Wouter M. Koolen, Steven de Rooij:
Universal Codes From Switching Strategies. IEEE Trans. Inf. Theory 59(11): 7168-7185 (2013) - [c11]Gerben Klaas Dirk de Vries, Steven de Rooij:
A Fast and Simple Graph Kernel for RDF. DMoLD 2013 - [i7]Steven de Rooij, Tim van Erven, Peter D. Grünwald, Wouter M. Koolen:
Follow the Leader If You Can, Hedge If You Must. CoRR abs/1301.0534 (2013) - [i6]Wouter M. Koolen, Steven de Rooij:
Universal Codes from Switching Strategies. CoRR abs/1311.6536 (2013) - 2012
- [j1]Steven de Rooij, Paul M. B. Vitányi:
Approximating Rate-Distortion Graphs of Individual Data: Experiments in Lossy Compression and Denoising. IEEE Trans. Computers 61(3): 395-407 (2012) - 2011
- [c10]Tim van Erven, Peter Grunwald, Wouter M. Koolen, Steven de Rooij:
Adaptive Hedge. NIPS 2011: 1656-1664 - 2010
- [c9]Wouter M. Koolen, Steven de Rooij:
Switching Investments. ALT 2010: 239-254 - [c8]Wojciech Kotlowski, Peter Grünwald, Steven de Rooij:
Following the Flattened Leader. COLT 2010: 106-118
2000 – 2009
- 2009
- [c7]Steven de Rooij, Tim van Erven:
Learning the Switching Rate by Discretising Bernoulli Sources Online. AISTATS 2009: 432-439 - 2008
- [c6]Wouter M. Koolen, Steven de Rooij:
Combining Expert Advice Efficiently. COLT 2008: 275-286 - [c5]Peter Grunwald, Steven de Rooij, Tim van Erven:
The Catch-Up Phenomenon. ITW 2008: 259-260 - [i5]Wouter M. Koolen, Steven de Rooij:
Combining Expert Advice Efficiently. CoRR abs/0802.2015 (2008) - [i4]Tim van Erven, Peter Grünwald, Steven de Rooij:
Catching Up Faster by Switching Sooner: A Prequential Solution to the AIC-BIC Dilemma. CoRR abs/0807.1005 (2008) - 2007
- [c4]Tim van Erven, Peter Grunwald, Steven de Rooij:
Catching Up Faster in Bayesian Model Selection and Model Averaging. NIPS 2007: 417-424 - 2006
- [i3]Steven de Rooij, Paul M. B. Vitányi:
Approximating Rate-Distortion Graphs of Individual Data: Experiments in Lossy Compression and Denoising. CoRR abs/cs/0609121 (2006) - 2005
- [c3]Peter Grünwald, Steven de Rooij:
Asymptotic Log-Loss of Prequential Maximum Likelihood Codes. COLT 2005: 652-667 - [c2]Steven de Rooij, Peter Grünwald:
MDL model selection using the ML plug-in code. ISIT 2005: 760-764 - [i2]Steven de Rooij, Peter Grünwald:
An Empirical Study of MDL Model Selection with Infinite Parametric Complexity. CoRR abs/cs/0501028 (2005) - [i1]Peter Grünwald, Steven de Rooij:
Asymptotic Log-loss of Prequential Maximum Likelihood Codes. CoRR abs/cs/0502004 (2005) - 2004
- [c1]Breanndán Ó Nualláin, Steven de Rooij:
Online Suffix Trees with Counts. Data Compression Conference 2004: 555
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
