default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarine Depecker
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j8]Baptiste Broto
, François Bachoc, Marine Depecker, Jean-Marc Martinez:
Gaussian Linear Approximation for the Estimation of the Shapley Effects. SIAM/ASA J. Uncertain. Quantification 9(3): 1132-1151 (2021)- 2020
- [j7]Baptiste Broto, François Bachoc, Marine Depecker:
Variance Reduction for Estimation of Shapley Effects and Adaptation to Unknown Input Distribution. SIAM/ASA J. Uncertain. Quantification 8(2): 693-716 (2020)
2010 – 2019
- 2019
- [j6]Baptiste Broto, François Bachoc, Marine Depecker, Jean-Marc Martinez:
Sensitivity indices for independent groups of variables. Math. Comput. Simul. 163: 19-31 (2019) - 2014
- [j5]Pierre Blanchart, Marine Depecker:
A Nonlinear Semantic-Preserving Projection Approach to Visualize Multivariate Periodical Time Series. IEEE Trans. Neural Networks Learn. Syst. 25(6): 1053-1070 (2014) - 2013
- [j4]Stéphan Clémençon, Marine Depecker, Nicolas Vayatis:
Ranking forests. J. Mach. Learn. Res. 14(1): 39-73 (2013) - [j3]Stéphan Clémençon, Marine Depecker, Nicolas Vayatis:
An empirical comparison of learning algorithms for nonparametric scoring: the TreeRank algorithm and other methods. Pattern Anal. Appl. 16(4): 475-496 (2013) - 2011
- [j2]Stéphan Clémençon, Marine Depecker, Nicolas Vayatis:
Adaptive partitioning schemes for bipartite ranking - How to grow and prune a ranking tree. Mach. Learn. 83(1): 31-69 (2011) - [j1]Stéphan Clémençon, Marine Depecker, Nicolas Vayatis:
Avancées récentes dans le domaine de l'apprentissage d'ordonnancements. Rev. d'Intelligence Artif. 25(3): 345-368 (2011) - [c3]Cécilia Damon, Edouard Duchesnay, Marine Depecker:
Structured Multivariate Pattern Classification to Detect MRI Markers for an Early Diagnosis of Alzheimer's Disease. ICMLA (2) 2011: 384-387 - 2010
- [b1]Marine Depecker:
Méthodes d'apprentissage statistique pour le scoring. (Statistical learning methods for bipartite ranking). Télécom ParisTech, France, 2010
2000 – 2009
- 2009
- [c2]Stéphan Clémençon, Marine Depecker, Nicolas Vayatis:
Bagging Ranking Trees. ICMLA 2009: 658-663 - [c1]Stéphan Clémençon, Nicolas Vayatis, Marine Depecker:
AUC optimization and the two-sample problem. NIPS 2009: 360-368
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 2024-10-07 21:15 CEST 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:
