Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Sébastien Gambs"'
Publikováno v:
ACM International Conference on Information and Knowledge Management, Virtual Event
ACM International Conference on Information and Knowledge Management, Virtual Event, Nov 2021, Queensland, Australia. pp.4665-4669, ⟨10.1145/3459637.3481965⟩
CIKM
ACM International Conference on Information and Knowledge Management, Virtual Event, Nov 2021, Queensland, Australia. pp.4665-4669, ⟨10.1145/3459637.3481965⟩
CIKM
International audience; FairCORELS is an open-source Python module for building fair rule lists. It is a multi-objective variant of CORELS, a branch-and-bound algorithm to learn certifiably optimal rule lists. FairCORELS supports six statistical fair
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::de26886acc217b610b9ec7cce3b679c0
https://hal.laas.fr/hal-03427276/file/2021_CIKM_DemoTrack_FairCORELS.pdf
https://hal.laas.fr/hal-03427276/file/2021_CIKM_DemoTrack_FairCORELS.pdf
Publikováno v:
Algorithms, Vol 14, Iss 87, p 87 (2021)
Algorithms
Volume 14
Issue 3
Algorithms
Volume 14
Issue 3
The widespread use of automated decision processes in many areas of our society raises serious ethical issues with respect to the fairness of the process and the possible resulting discrimination. To solve this issue, we propose a novel adversarial t
Publikováno v:
Journal of Computer and System Sciences
Journal of Computer and System Sciences, 2014, 80 (8), pp.1597-1614. ⟨10.1016/j.jcss.2014.04.024⟩
TrustCom/ISPA/IUCC
Journal of Computer and System Sciences, Elsevier, 2014, 80 (8), pp.1597-1614. ⟨10.1016/j.jcss.2014.04.024⟩
Journal of Computer and System Sciences, 2014, 80 (8), pp.1597-1614. ⟨10.1016/j.jcss.2014.04.024⟩
TrustCom/ISPA/IUCC
Journal of Computer and System Sciences, Elsevier, 2014, 80 (8), pp.1597-1614. ⟨10.1016/j.jcss.2014.04.024⟩
International audience; With the advent of GPS-equipped devices, a massive amount of location data is being collected, raising the issue of the privacy risks incurred by the individuals whose movements are recorded. In this work, we focus on a specif
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d7c30a8344b4da4be3bf7b568080930a
https://hal.science/hal-01242268/document
https://hal.science/hal-01242268/document
Publikováno v:
Machine Learning
Machine Learning, 2013, 90 (2), pp.261-287. ⟨10.1007/s10994-012-5316-5⟩
Machine Learning, Springer Verlag, 2013, 90 (2), pp.261-287. ⟨10.1007/s10994-012-5316-5⟩
Machine Learning, 2013, 90 (2), pp.261-287. ⟨10.1007/s10994-012-5316-5⟩
Machine Learning, Springer Verlag, 2013, 90 (2), pp.261-287. ⟨10.1007/s10994-012-5316-5⟩
International audience; We show how the quantum paradigm can be used to speed up unsupervised learning algorithms. More precisely, we explain how it is possible to accelerate learning algorithms by quantizing some of their subroutines. Quantization r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::66c8bb9bb38c788436a8e27f7b63969b
https://hal.inria.fr/hal-00736948
https://hal.inria.fr/hal-00736948
Publikováno v:
14th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2012)
14th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2012), Oct 2012, Toronto, Canada
Lecture Notes in Computer Science ISBN: 9783642335358
SSS
Lecture Notes in Computer Science
14th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2012), Oct 2012, Toronto, Canada
Lecture Notes in Computer Science ISBN: 9783642335358
SSS
Lecture Notes in Computer Science
International audience; In this paper, we consider the scenario in which the profile of a user is represented in a compact way, as a Bloom filter, and the main objective is to privately compute in a distributed manner the similarity between users by
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d7b31f4e24058f25fa3847d66d60e893
https://hal.inria.fr/hal-00724829
https://hal.inria.fr/hal-00724829
Publikováno v:
ICML
By the term "quantization", we refer to the process of using quantum mechanics in order to improve a classical algorithm, usually by making it go faster. In this paper, we initiate the idea of quantizing clustering algorithms by using variations on a