Frédéric Precioso

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Warith Harchaoui

> Home > Persons > Frédéric Precioso

Publications

2023
[i16]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2309-02858
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2309-02858
Louis Ohl, Pierre-Alexandre Mattei, Charles Bouveyron, Warith Harchaoui, Mickaël Leclercq, Arnaud Droit, Frédéric Precioso:
Generalised Mutual Information: a Framework for Discriminative Clustering. CoRR abs/2309.02858 (2023)
2022
[c84]
- view
  - electronic edition @ nips.cc (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/nips/OhlMBHLDP22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/nips/OhlMBHLDP22
Louis Ohl, Pierre-Alexandre Mattei, Charles Bouveyron, Warith Harchaoui, Mickaël Leclercq, Arnaud Droit, Frédéric Precioso:
Generalised Mutual Information for Discriminative Clustering. NeurIPS 2022
[i10]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2210-06300
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2210-06300
Louis Ohl, Pierre-Alexandre Mattei, Charles Bouveyron, Warith Harchaoui, Mickaël Leclercq, Arnaud Droit, Frédéric Precioso:
Generalised Mutual Information for Discriminative Clustering. CoRR abs/2210.06300 (2022)

a service of

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.