default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGéraldin Nanfack
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c6]Géraldin Nanfack, Alexander Fulleringer, Jonathan Marty, Michael Eickenberg, Eugene Belilovsky:
Adversarial Attacks on the Interpretation of Neuron Activation Maximization. AAAI 2024: 4315-4324- [i5]Géraldin Nanfack, Michael Eickenberg, Eugene Belilovsky:
From Feature Visualization to Visual Circuits: Effect of Adversarial Model Manipulation. CoRR abs/2406.01365 (2024) - [i4]Humza Wajid Hameed, Géraldin Nanfack, Eugene Belilovsky:
Not Only the Last-Layer Features for Spurious Correlations: All Layer Deep Feature Reweighting. CoRR abs/2409.14637 (2024) - 2023
- [j3]Hendrik Blockeel
, Laurens Devos, Benoît Frénay, Géraldin Nanfack, Siegfried Nijssen:
Decision trees: from efficient prediction to responsible AI. Frontiers Artif. Intell. 6 (2023) - [j2]Géraldin Nanfack, Paul Temple, Benoît Frénay:
Learning Customised Decision Trees for Domain-knowledge Constraints. Pattern Recognit. 142: 109610 (2023) - [c5]Alexandre Englebert, Sédrick Stassin, Géraldin Nanfack, Sidi Ahmed Mahmoudi, Xavier Siebert, Olivier Cornu, Christophe De Vleeschouwer:
Explaining through Transformer Input Sampling. ICCV (Workshops) 2023: 806-815 - [i3]Sédrick Stassin, Alexandre Englebert, Géraldin Nanfack, Julien Albert, Nassim Versbraegen, Gilles Peiffer, Miriam Doh, Nicolas Riche, Benoît Frénay, Christophe De Vleeschouwer:
An Experimental Investigation into the Evaluation of Explainability Methods. CoRR abs/2305.16361 (2023) - [i2]Géraldin Nanfack, Alexander Fulleringer, Jonathan Marty, Michael Eickenberg, Eugene Belilovsky:
Adversarial Attacks on the Interpretation of Neuron Activation Maximization. CoRR abs/2306.07397 (2023) - 2022
- [b1]Géraldin Nanfack:
Constraint Enforcement on Decision Trees and its Application to Global Explainability. University of Namur, Belgium, 2022 - [j1]Géraldin Nanfack, Paul Temple, Benoît Frénay:
Constraint Enforcement on Decision Trees: A Survey. ACM Comput. Surv. 54(10s): 201:1-201:36 (2022) - 2021
- [c4]Géraldin Nanfack, Valentin Delchevalerie, Benoît Frénay:
Boundary-Based Fairness Constraints in Decision Trees and Random Forests. ESANN 2021 - [c3]Géraldin Nanfack, Paul Temple, Benoît Frénay:
Global explanations with decision rules: a co-learning approach. UAI 2021: 589-599 - 2020
- [c2]Adrien Bibal, Viet Minh Vu, Géraldin Nanfack, Benoît Frénay:
Explaining t-SNE Embeddings Locally by Adapting LIME. ESANN 2020: 393-398
2010 – 2019
- 2017
- [c1]Géraldin Nanfack, Azeddine Elhassouny, Rachid Oulad Haj Thami:
Squeeze-SegNet: a new fast deep convolutional neural network for semantic segmentation. ICMV 2017: 106962O - [i1]Géraldin Nanfack, Azeddine Elhassouny, Rachid Oulad Haj Thami:
Squeeze-SegNet: A new fast Deep Convolutional Neural Network for Semantic Segmentation. CoRR abs/1711.05491 (2017)
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-16 21:27 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:
