Charlotte Laclau

Orcid: 0000-0002-7389-3191

According to our database1, Charlotte Laclau authored at least 31 papers between 2014 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
End-to-end Supervised Prediction of Arbitrary-size Graphs with Partially-Masked Fused Gromov-Wasserstein Matching.
CoRR, 2024

Variational Perspective on Fair Edge Prediction.
Proceedings of the Advances in Intelligent Data Analysis XXII, 2024

A Study on Hierarchical Text Classification as a Seq2seq Task.
Proceedings of the Advances in Information Retrieval, 2024

2023
Understanding deep neural networks through the lens of their non-linearity.
CoRR, 2023

An Investigation of Structures Responsible for Gender Bias in BERT and DistilBERT.
Proceedings of the Advances in Intelligent Data Analysis XXI, 2023

Diverse Paraphrasing with Insertion Models for Few-Shot Intent Detection.
Proceedings of the Advances in Intelligent Data Analysis XXI, 2023

Comment rendre un GNN plus équitable pour la prédiction de liens ?
Proceedings of the Extraction et Gestion des Connaissances, 2023

Fair Text Classification with Wasserstein Independence.
Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing, 2023

2022
A Survey on Fairness for Machine Learning on Graphs.
CoRR, 2022

Learning over No-Preferred and Preferred Sequence of Items for Robust Recommendation (Extended Abstract).
CoRR, 2022

Understanding the Benefits of Forgetting When Learning on Dynamic Graphs.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2022

2021
Learning over No-Preferred and Preferred Sequence of Items for Robust Recommendation.
J. Artif. Intell. Res., 2021

User preference and embedding learning with implicit feedback for recommender systems.
Data Min. Knowl. Discov., 2021

Deep Neural Networks Are Congestion Games: From Loss Landscape to Wardrop Equilibrium and Beyond.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

All of the Fairness for Edge Prediction with Optimal Transport.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
Learning over no-Preferred and Preferred Sequence of items for Robust Recommendation.
CoRR, 2020

Rank-one partitioning: formalization, illustrative examples, and a new cluster enhancing strategy.
CoRR, 2020

2019
Noise-free latent block model for high dimensional data.
Data Min. Knowl. Discov., 2019

On Fair Cost Sharing Games in Machine Learning.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
PANDOR.
Dataset, October, 2018

Learning to recommend diverse items over implicit feedback on PANDOR.
Proceedings of the 12th ACM Conference on Recommender Systems, 2018

Cross-Lingual Document Retrieval Using Regularized Wasserstein Distance.
Proceedings of the Advances in Information Retrieval, 2018

2017

Diagonal latent block model for binary data.
Stat. Comput., 2017

Representation Learning and Pairwise Ranking for Implicit and Explicit Feedback in Recommendation Systems.
CoRR, 2017

KASANDR: A Large-Scale Dataset with Implicit Feedback for Recommendation.
Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2017

Co-clustering through Optimal Transport.
Proceedings of the 34th International Conference on Machine Learning, 2017

2016
Hard and fuzzy diagonal co-clustering for document-term partitioning.
Neurocomputing, 2016

2015
Diagonal Co-clustering Algorithm for Document-Word Partitioning.
Proceedings of the Advances in Intelligent Data Analysis XIV, 2015

Fuzzy co-clustering with automated variable weighting.
Proceedings of the 2015 IEEE International Conference on Fuzzy Systems, 2015

2014
Fast Simultaneous Clustering and Feature Selection for Binary Data.
Proceedings of the Advances in Intelligent Data Analysis XIII, 2014


  Loading...