![](https://dblp.uni-trier.de./img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de./img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de./img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Guillaume Metzler
Person information
Refine list
![note](https://dblp.uni-trier.de./img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i3]Irina Proskurina, Luc Brun, Guillaume Metzler, Julien Velcin:
When Quantization Affects Confidence of Large Language Models? CoRR abs/2405.00632 (2024) - 2023
- [c6]Irina Proskurina, Guillaume Metzler, Julien Velcin:
The Other Side of Compression: Measuring Bias in Pruned Transformers. IDA 2023: 366-378 - [i2]Irina Proskurina, Guillaume Metzler, Julien Velcin:
Mini Minds: Exploring Bebeshka and Zlata Baby Models. CoRR abs/2311.03216 (2023) - 2021
- [j2]Rémi Viola, Rémi Emonet, Amaury Habrard, Guillaume Metzler, Sébastien Riou, Marc Sebban:
A Nearest Neighbor Algorithm for Imbalanced Classification. Int. J. Artif. Intell. Tools 30(3): 2150013:1-2150013:27 (2021) - 2020
- [c5]Rémi Viola, Rémi Emonet, Amaury Habrard, Guillaume Metzler, Marc Sebban:
Learning from Few Positives: a Provably Accurate Metric Learning Algorithm to Deal with Imbalanced Data. IJCAI 2020: 2155-2161 - [c4]Léo Gautheron, Pascal Germain
, Amaury Habrard, Guillaume Metzler, Emilie Morvant, Marc Sebban, Valentina Zantedeschi:
Landmark-Based Ensemble Learning with Random Fourier Features and Gradient Boosting. ECML/PKDD (3) 2020: 141-157
2010 – 2019
- 2019
- [b1]Guillaume Metzler:
Apprentissage dans un contexte déséquilibré : une application à la détection de fraude. (Learning from Imbalanced Data: Application to Bank Fraud Detection). Jean Monnet University, Saint-Étienne, France, 2019 - [c3]Kevin Bascol, Rémi Emonet, Élisa Fromont, Amaury Habrard, Guillaume Metzler, Marc Sebban:
From Cost-Sensitive to Tight F-measure Bounds. AISTATS 2019: 1245-1253 - [c2]Rémi Viola, Rémi Emonet, Amaury Habrard, Guillaume Metzler, Sébastien Riou, Marc Sebban:
An Adjusted Nearest Neighbor Algorithm Maximizing the F-Measure from Imbalanced Data. ICTAI 2019: 243-250 - [i1]Rémi Viola, Rémi Emonet, Amaury Habrard, Guillaume Metzler, Sébastien Riou, Marc Sebban:
An Adjusted Nearest Neighbor Algorithm Maximizing the F-Measure from Imbalanced Data. CoRR abs/1909.00693 (2019) - 2018
- [j1]Guillaume Metzler, Xavier Badiche, Brahim Belkasmi, Élisa Fromont
, Amaury Habrard, Marc Sebban:
Learning maximum excluding ellipsoids from imbalanced data with theoretical guarantees. Pattern Recognit. Lett. 112: 310-316 (2018) - [c1]Guillaume Metzler, Xavier Badiche, Brahim Belkasmi, Élisa Fromont
, Amaury Habrard, Marc Sebban:
Tree-Based Cost Sensitive Methods for Fraud Detection in Imbalanced Data. IDA 2018: 213-224
Coauthor Index
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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-06-10 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint