Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Frédéric Cérou

dblp:48/4916 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2010
0000-0002-8752-0492ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1Security and privacy · 1 · 1 first-authorTheory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Learning theory · 64% Kernel, tree and ensemble methods · 36%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Kernel, tree and ensemble methods › ensemble learning
bagging
0.112010
On the Rate of Convergence of the Bagged Nearest Neighbor Estimate · J. Mach. Learn. Res. 2010
Machine learning › Learning theory › statistical learning theory › finite-sample analysis
finite-sample bounds
0.112010
Rates of convergence of the functional k-nearest neighbor estimate · IEEE Trans. Inf. Theory 2010
Machine learning › Kernel, tree and ensemble methods
nearest neighbor methods
0.112010
On the Rate of Convergence of the Bagged Nearest Neighbor Estimate · J. Mach. Learn. Res. 2010
Machine learning › Learning theory › nonparametric regression
nearest neighbor regression
0.112010
Rates of convergence of the functional k-nearest neighbor estimate · IEEE Trans. Inf. Theory 2010
Machine learning › Learning theory
nonparametric regression
0.112010
Rates of convergence of the functional k-nearest neighbor estimate · IEEE Trans. Inf. Theory 2010
Machine learning › Learning theory
function spaces
0.012010
Rates of convergence of the functional k-nearest neighbor estimate · IEEE Trans. Inf. Theory 2010
Machine learning › Learning theory › function spaces
sobolev spaces
0.012010
Rates of convergence of the functional k-nearest neighbor estimate · IEEE Trans. Inf. Theory 2010

Methods — techniques the papers use, named apart from their topics

nearest neighbor · 0.1convergence analysis · 0.1compact embedding theory · 0.1bagging · 0.1
YearPublicationVenuePosition
2010 On the Rate of Convergence of the Bagged Nearest Neighbor Estimate
Gérard Biau, Frédéric Cérou, Arnaud Guyader
J. Mach. Learn. Res.2
2010 Rates of convergence of the functional k-nearest neighbor estimate
abstract
Let F be a separable Banach space, and let (X, Y) be a random pair taking values in F × R. Motivated by a broad range of potential applications, we investigate rates of convergence of the k-nearest neighbor estimate rn(x) of the regression function r(x) = E[Y|X = x], based on n independent copies of the pair (X, Y). Using compact embedding theory, we present explicit and general finite sample bounds on the expected squared difference E[rn(X) - r(X)]2, and particularize our results to classical function spaces such as Sobolev spaces, Besov spaces, and reproducing kernel Hilbert spaces.
Gérard Biau, Frédéric Cérou, Arnaud Guyader
IEEE Trans. Inf. Theory2
2008 Experimental Assessment of the Reliability for Watermarking and Fingerprinting Schemes
abstract
International audience
Frédéric Cérou, Teddy Furon, Arnaud Guyader
EURASIP J. Inf. Secur.1