![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Charlotte Laclau
Person information
Refine list
![note](https://dblp1.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
- [c17]Fatos Torba
, Christophe Gravier
, Charlotte Laclau
, Abderrhammen Kammoun, Julien Subercaze:
A Study on Hierarchical Text Classification as a Seq2seq Task. ECIR (3) 2024: 287-296 - [c16]Antoine Gourru
, Charlotte Laclau
, Manvi Choudhary, Christine Largeron
:
Variational Perspective on Fair Edge Prediction. IDA (1) 2024: 93-104 - [i12]Thibaud Leteno, Antoine Gourru, Charlotte Laclau, Christophe Gravier:
An investigation of structures responsible for gender bias in BERT and DistilBERT. CoRR abs/2401.06495 (2024) - [i11]Paul Krzakala, Junjie Yang, Rémi Flamary, Florence d'Alché-Buc, Charlotte Laclau, Matthieu Labeau:
End-to-end Supervised Prediction of Arbitrary-size Graphs with Partially-Masked Fused Gromov-Wasserstein Matching. CoRR abs/2402.12269 (2024) - 2023
- [c15]Thibaud Leteno, Antoine Gourru, Charlotte Laclau, Rémi Emonet, Christophe Gravier:
Fair Text Classification with Wasserstein Independence. EMNLP 2023: 15790-15803 - [c14]Manvi Choudhary, Antoine Gourru, Charlotte Laclau, Christine Largeron:
Comment rendre un GNN plus équitable pour la prédiction de liens ? EGC 2023: 127-138 - [c13]Raphaël Chevasson, Charlotte Laclau, Christophe Gravier:
Diverse Paraphrasing with Insertion Models for Few-Shot Intent Detection. IDA 2023: 65-76 - [c12]Thibaud Leteno, Antoine Gourru, Charlotte Laclau, Christophe Gravier:
An Investigation of Structures Responsible for Gender Bias in BERT and DistilBERT. IDA 2023: 249-261 - [i10]Quentin Bouniot, Ievgen Redko, Anton Mallasto, Charlotte Laclau, Karol Arndt, Oliver Struckmeier, Markus Heinonen, Ville Kyrki, Samuel Kaski:
Understanding deep neural networks through the lens of their non-linearity. CoRR abs/2310.11439 (2023) - [i9]Thibaud Leteno, Antoine Gourru, Charlotte Laclau, Rémi Emonet, Christophe Gravier:
Fair Text Classification with Wasserstein Independence. CoRR abs/2311.12689 (2023) - 2022
- [c11]Julien Tissier, Charlotte Laclau:
Understanding the Benefits of Forgetting When Learning on Dynamic Graphs. ECML/PKDD (2) 2022: 37-52 - [i8]Aleksandra Burashnikova, Yury Maximov, Marianne Clausel, Charlotte Laclau, Franck Iutzeler, Massih-Reza Amini:
Learning over No-Preferred and Preferred Sequence of Items for Robust Recommendation (Extended Abstract). CoRR abs/2202.13240 (2022) - [i7]Manvi Choudhary, Charlotte Laclau, Christine Largeron:
A Survey on Fairness for Machine Learning on Graphs. CoRR abs/2205.05396 (2022) - 2021
- [j5]Sumit Sidana, Mikhail Trofimov, Oleh Horodnytskyi, Charlotte Laclau, Yury Maximov, Massih-Reza Amini
:
User preference and embedding learning with implicit feedback for recommender systems. Data Min. Knowl. Discov. 35(2): 568-592 (2021) - [j4]Aleksandra Burashnikova, Yury Maximov, Marianne Clausel, Charlotte Laclau, Franck Iutzeler, Massih-Reza Amini:
Learning over No-Preferred and Preferred Sequence of Items for Robust Recommendation. J. Artif. Intell. Res. 71: 121-142 (2021) - [c10]Nina Vesseron, Ievgen Redko, Charlotte Laclau:
Deep Neural Networks Are Congestion Games: From Loss Landscape to Wardrop Equilibrium and Beyond. AISTATS 2021: 1765-1773 - [c9]Charlotte Laclau, Ievgen Redko, Manvi Choudhary, Christine Largeron:
All of the Fairness for Edge Prediction with Optimal Transport. AISTATS 2021: 1774-1782 - 2020
- [i6]Charlotte Laclau, Franck Iutzeler, Ievgen Redko:
Rank-one partitioning: formalization, illustrative examples, and a new cluster enhancing strategy. CoRR abs/2009.00365 (2020) - [i5]Nina Vesseron, Ievgen Redko, Charlotte Laclau:
Deep Neural Networks Are Congestion Games: From Loss Landscape to Wardrop Equilibrium and Beyond. CoRR abs/2010.11024 (2020) - [i4]Charlotte Laclau, Ievgen Redko, Manvi Choudhary, Christine Largeron:
All of the Fairness for Edge Prediction with Optimal Transport. CoRR abs/2010.16326 (2020) - [i3]Aleksandra Burashnikova, Marianne Clausel, Charlotte Laclau, Frack Iutzeller, Yury Maximov, Massih-Reza Amini:
Learning over no-Preferred and Preferred Sequence of items for Robust Recommendation. CoRR abs/2012.06910 (2020)
2010 – 2019
- 2019
- [j3]Charlotte Laclau
, Vincent Brault:
Noise-free latent block model for high dimensional data. Data Min. Knowl. Discov. 33(2): 446-473 (2019) - [c8]Ievgen Redko, Charlotte Laclau:
On Fair Cost Sharing Games in Machine Learning. AAAI 2019: 4790-4797 - 2018
- [c7]Georgios Balikas, Charlotte Laclau, Ievgen Redko, Massih-Reza Amini:
Cross-Lingual Document Retrieval Using Regularized Wasserstein Distance. ECIR 2018: 398-410 - [c6]Sumit Sidana, Charlotte Laclau, Massih-Reza Amini:
Learning to recommend diverse items over implicit feedback on PANDOR. RecSys 2018: 427-431 - [d2]Massih-Reza Amini, Charlotte Laclau, Sumit Sidana:
PANDOR. UCI Machine Learning Repository, 2018 - [i2]Georgios Balikas, Charlotte Laclau, Ievgen Redko, Massih-Reza Amini:
Cross-lingual Document Retrieval using Regularized Wasserstein Distance. CoRR abs/1805.04437 (2018) - 2017
- [j2]Charlotte Laclau, Mohamed Nadif
:
Diagonal latent block model for binary data. Stat. Comput. 27(5): 1145-1163 (2017) - [c5]Charlotte Laclau, Ievgen Redko, Basarab Matei, Younès Bennani, Vincent Brault
:
Co-clustering through Optimal Transport. ICML 2017: 1955-1964 - [c4]Sumit Sidana, Charlotte Laclau, Massih-Reza Amini, Gilles Vandelle, André Bois-Crettez:
KASANDR: A Large-Scale Dataset with Implicit Feedback for Recommendation. SIGIR 2017: 1245-1248 - [d1]Sumit Sidana, Charlotte Laclau, Massih-Reza Amini:
KASANDR. UCI Machine Learning Repository, 2017 - [i1]Mikhail Trofimov, Sumit Sidana, Oleh Horodnitskii, Charlotte Laclau, Yury Maximov, Massih-Reza Amini:
Representation Learning and Pairwise Ranking for Implicit and Explicit Feedback in Recommendation Systems. CoRR abs/1705.00105 (2017) - 2016
- [j1]Charlotte Laclau, Mohamed Nadif
:
Hard and fuzzy diagonal co-clustering for document-term partitioning. Neurocomputing 193: 133-147 (2016) - 2015
- [c3]Charlotte Laclau, Francisco de A. T. de Carvalho
, Mohamed Nadif
:
Fuzzy co-clustering with automated variable weighting. FUZZ-IEEE 2015: 1-8 - [c2]Charlotte Laclau, Mohamed Nadif:
Diagonal Co-clustering Algorithm for Document-Word Partitioning. IDA 2015: 170-180 - 2014
- [c1]Charlotte Laclau, Mohamed Nadif:
Fast Simultaneous Clustering and Feature Selection for Binary Data. IDA 2014: 192-202
Coauthor Index
![](https://dblp1.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-19 21:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint