default search action
Simon Bernard 0001
Person information
- affiliation: LITIS (UR 4108), Université de Rouen Normandie, Rouen, France
Other persons with the same name
- Simon Bernard 0002 — Université Le Havre Normandie, Le Havre, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j6]Usman Malik, Simon Bernard, Alexandre Pauchet, Clément Chatelain, Romain Picot-Clémente, Jérôme Cortinovis:
Pseudo-Labeling With Large Language Models for Multi-Label Emotion Classification of French Tweets. IEEE Access 12: 15902-15916 (2024) - [j5]Lucca Portes Cavalheiro, Simon Bernard, Jean Paul Barddal, Laurent Heutte:
Random forest kernel for high-dimension low sample size classification. Stat. Comput. 34(1): 9 (2024) - 2023
- [c13]Tsiry Mayet, Simon Bernard, Clément Chatelain, Romain Hérault:
Domain Translation via Latent Space Mapping. IJCNN 2023: 1-10 - [i9]Fernando Gonzalez, François-Xavier Demoulin, Simon Bernard:
Towards Long-Term predictions of Turbulence using Neural Operators. CoRR abs/2307.13517 (2023) - [i8]Tsiry Mayet, Simon Bernard, Clément Chatelain, Romain Hérault:
Multiple Noises in Diffusion Model for Semi-Supervised Multi-Domain Translation. CoRR abs/2309.14394 (2023) - [i7]Lucca Portes Cavalheiro, Simon Bernard, Jean Paul Barddal, Laurent Heutte:
Random Forest Dissimilarity for High-Dimension Low Sample Size Classification. CoRR abs/2310.14710 (2023) - 2022
- [i6]Tsiry Mayet, Simon Bernard, Clément Chatelain, Romain Hérault:
Domain Translation via Latent Space Mapping. CoRR abs/2212.03361 (2022) - 2020
- [c12]Hongliu Cao, Simon Bernard, Robert Sabourin, Laurent Heutte:
A Novel Random Forest Dissimilarity Measure for Multi-View Learning. ICPR 2020: 1344-1351 - [i5]Hongliu Cao, Simon Bernard, Robert Sabourin, Laurent Heutte:
A Novel Random Forest Dissimilarity Measure for Multi-View Learning. CoRR abs/2007.02572 (2020) - [i4]Simon Bernard, Hongliu Cao, Robert Sabourin, Laurent Heutte:
Random Forest for Dissimilarity-based Multi-view Learning. CoRR abs/2007.08377 (2020)
2010 – 2019
- 2019
- [j4]Hongliu Cao, Simon Bernard, Robert Sabourin, Laurent Heutte:
Random forest dissimilarity based multi-view learning for Radiomics application. Pattern Recognit. 88: 185-197 (2019) - 2018
- [c11]Hongliu Cao, Simon Bernard, Laurent Heutte, Robert Sabourin:
Improve the Performance of Transfer Learning Without Fine-Tuning Using Dissimilarity-Based Multi-view Learning for Breast Cancer Histology Images. ICIAR 2018: 779-787 - [c10]Hongliu Cao, Simon Bernard, Laurent Heutte, Robert Sabourin:
Dynamic Voting in Multi-view Learning for Radiomics Applications. S+SSPR 2018: 32-41 - [i3]Hongliu Cao, Simon Bernard, Laurent Heutte, Robert Sabourin:
Dissimilarity-based representation for radiomics applications. CoRR abs/1803.04460 (2018) - [i2]Hongliu Cao, Simon Bernard, Laurent Heutte, Robert Sabourin:
Improve the performance of transfer learning without fine-tuning using dissimilarity-based multi-view learning for breast cancer histology images. CoRR abs/1803.11241 (2018) - [i1]Hongliu Cao, Simon Bernard, Laurent Heutte, Robert Sabourin:
Dynamic voting in multi-view learning for radiomics applications. CoRR abs/1806.07686 (2018) - 2016
- [j3]Simon Bernard, Clément Chatelain, Sébastien Adam, Robert Sabourin:
The Multiclass ROC Front method for cost-sensitive classification. Pattern Recognit. 52: 46-60 (2016) - [c9]Clément Dubos, Simon Bernard, Sébastien Adam, Robert Sabourin:
ROC-based cost-sensitive classification with a reject option. ICPR 2016: 3320-3325 - 2013
- [j2]Chesner Désir, Simon Bernard, Caroline Petitjean, Laurent Heutte:
One class random forests. Pattern Recognit. 46(12): 3490-3506 (2013) - 2012
- [j1]Simon Bernard, Sébastien Adam, Laurent Heutte:
Dynamic Random Forests. Pattern Recognit. Lett. 33(12): 1580-1586 (2012) - [c8]Chesner Désir, Simon Bernard, Caroline Petitjean, Laurent Heutte:
A Random Forest Based Approach for One Class Classification in Medical Imaging. MLMI 2012: 250-257 - [c7]Chesner Désir, Simon Bernard, Caroline Petitjean, Laurent Heutte:
A New Random Forest Method for One-Class Classification. SSPR/SPR 2012: 282-290 - 2010
- [c6]Simon Bernard, Laurent Heutte, Sébastien Adam:
A Study of Strength and Correlation in Random Forests. ICIC (3) 2010: 186-191
2000 – 2009
- 2009
- [b1]Simon Bernard:
Forêts Aléatoires: De l'Analyse des Mécanismes de Fonctionnement à la Construction Dynamique. (Random Forests: From the Study of Behaviors to Dynamic Induction). University of Rouen, France, 2009 - [c5]Simon Bernard, Laurent Heutte, Sébastien Adam:
Towards a Better Understanding of Random Forests through the Study of Strength and Correlation. ICIC (2) 2009: 536-545 - [c4]Simon Bernard, Laurent Heutte, Sébastien Adam:
On the selection of decision trees in Random Forests. IJCNN 2009: 302-307 - [c3]Simon Bernard, Laurent Heutte, Sébastien Adam:
Influence of Hyperparameters on Random Forest Accuracy. MCS 2009: 171-180 - 2008
- [c2]Simon Bernard, Laurent Heutte, Sébastien Adam:
Forest-RK: A New Random Forest Induction Method. ICIC (2) 2008: 430-437 - 2007
- [c1]Simon Bernard, Sébastien Adam, Laurent Heutte:
Using Random Forests for Handwritten Digit Recognition. ICDAR 2007: 1043-1047
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:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint