<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-01291865</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-20T03:24:31+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">An Efficient Active Constraint Selection Algorithm for Clustering</title>
            <author role="aut">
              <persName>
                <forename type="first">Viet Vu</forename>
                <surname>Vu</surname>
              </persName>
              <email type="md5">51a715d58ab1bd4a19539dbc27485729</email>
              <email type="domain">lip6.fr</email>
              <idno type="idhal" notation="numeric">980044</idno>
              <idno type="halauthorid" notation="string">923807-980044</idno>
              <affiliation ref="#struct-396897"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Nicolas</forename>
                <surname>Labroche</surname>
              </persName>
              <email type="md5">47763ec1a694c4768ea29814586eab79</email>
              <email type="domain">univ-tours.fr</email>
              <idno type="idhal" notation="string">nicolas-labroche</idno>
              <idno type="idhal" notation="numeric">4509</idno>
              <idno type="halauthorid" notation="string">8396-4509</idno>
              <idno type="IDREF">https://www.idref.fr/132080303</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-2794-2124</idno>
              <affiliation ref="#struct-396897"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Bernadette</forename>
                <surname>Bouchon-Meunier</surname>
              </persName>
              <email type="md5">362012f1edb8493cf2159e7534a59ba7</email>
              <email type="domain">lip6.fr</email>
              <idno type="idhal" notation="string">bernadette-bouchon-meunier</idno>
              <idno type="idhal" notation="numeric">9708</idno>
              <idno type="halauthorid" notation="string">9616-9708</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-7937-7796</idno>
              <idno type="IDREF">https://www.idref.fr/031064442</idno>
              <affiliation ref="#struct-396897"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Lip6</forename>
                <surname>Publications</surname>
              </persName>
              <email type="md5">48f930374cf1d03f2eafeaae16bb5814</email>
              <email type="domain">lip6.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2016-03-22 11:22:19</date>
              <date type="whenModified">2023-04-11 15:16:28</date>
              <date type="whenReleased">2016-03-22 11:22:19</date>
              <date type="whenProduced">2010-08</date>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="196566">
                <persName>
                  <forename>Lip6</forename>
                  <surname>Publications</surname>
                </persName>
                <email type="md5">48f930374cf1d03f2eafeaae16bb5814</email>
                <email type="domain">lip6.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01291865</idno>
            <idno type="halUri">https://hal.science/hal-01291865</idno>
            <idno type="halBibtex">vu:hal-01291865</idno>
            <idno type="halRefHtml">&lt;i&gt;The 20th International Conference on Pattern Recognition (ICPR-2010)&lt;/i&gt;, Aug 2010, Istanbul, Turkey. pp.2969-2972, &lt;a target="_blank" href="https://dx.doi.org/10.1109/ICPR.2010.727"&gt;&amp;#x27E8;10.1109/ICPR.2010.727&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">The 20th International Conference on Pattern Recognition (ICPR-2010), Aug 2010, Istanbul, Turkey. pp.2969-2972, &amp;#x27E8;10.1109/ICPR.2010.727&amp;#x27E9;</idno>
            <availability status="restricted"/>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UPMC" corresp="SORBONNE-UNIVERSITE">Université Pierre et Marie Curie</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="LIP6" corresp="SORBONNE-UNIVERSITE">Laboratoire d'Informatique de Paris 6</idno>
            <idno type="stamp" n="UPMC_POLE_1" corresp="UPMC">UPMC Pôle 1</idno>
            <idno type="stamp" n="SORBONNE-UNIVERSITE">Sorbonne Université</idno>
            <idno type="stamp" n="SU-SCIENCES" corresp="SORBONNE-UNIVERSITE">Faculté des Sciences de Sorbonne Université</idno>
            <idno type="stamp" n="ALLIANCE-SU"> Alliance Sorbonne Université</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">An Efficient Active Constraint Selection Algorithm for Clustering</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Viet Vu</forename>
                    <surname>Vu</surname>
                  </persName>
                  <email type="md5">51a715d58ab1bd4a19539dbc27485729</email>
                  <email type="domain">lip6.fr</email>
                  <idno type="idhal" notation="numeric">980044</idno>
                  <idno type="halauthorid" notation="string">923807-980044</idno>
                  <affiliation ref="#struct-396897"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Nicolas</forename>
                    <surname>Labroche</surname>
                  </persName>
                  <email type="md5">47763ec1a694c4768ea29814586eab79</email>
                  <email type="domain">univ-tours.fr</email>
                  <idno type="idhal" notation="string">nicolas-labroche</idno>
                  <idno type="idhal" notation="numeric">4509</idno>
                  <idno type="halauthorid" notation="string">8396-4509</idno>
                  <idno type="IDREF">https://www.idref.fr/132080303</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-2794-2124</idno>
                  <affiliation ref="#struct-396897"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Bernadette</forename>
                    <surname>Bouchon-Meunier</surname>
                  </persName>
                  <email type="md5">362012f1edb8493cf2159e7534a59ba7</email>
                  <email type="domain">lip6.fr</email>
                  <idno type="idhal" notation="string">bernadette-bouchon-meunier</idno>
                  <idno type="idhal" notation="numeric">9708</idno>
                  <idno type="halauthorid" notation="string">9616-9708</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-7937-7796</idno>
                  <idno type="IDREF">https://www.idref.fr/031064442</idno>
                  <affiliation ref="#struct-396897"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Proceedings of the 20th International Conference on Pattern Recognition (ICPR-2010)</title>
                <meeting>
                  <title>The 20th International Conference on Pattern Recognition (ICPR-2010)</title>
                  <date type="start">2010-08</date>
                  <settlement>Istanbul</settlement>
                  <country key="TR">Turkey</country>
                </meeting>
                <imprint>
                  <publisher>IEEE</publisher>
                  <biblScope unit="pp">2969-2972</biblScope>
                </imprint>
              </monogr>
              <idno type="doi">10.1109/ICPR.2010.727</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>In this paper, we address the problem of active query selection for clustering with constraints. The objective is to determine automatically a set of queries and their associated must-link and can-not link constraints to help constraints based clustering algorithms to converge. Some works on active constraints learning have already been proposed but they are only applied to K-Means like clustering algorithms which are known to be limited to spherical clusters while we are interested in constraints-based clustering algorithms that deals with clusters of arbitrary shapes and sizes (like Constrained-DBSCAN, Constrained-Hierarchical Clustering. . . ). Our novel approach relies on a k-nearest neighbors graph to estimate the dense regions of the data space and generates queries at the frontier between clusters where the cluster membership is most uncertain. Experiments show that our framework improves the performance of constraints based clustering algorithms.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-396897" status="OLD">
          <orgName>Machine Learning and Information Retrieval</orgName>
          <orgName type="acronym">MALIRE</orgName>
          <date type="start">2004-01-01</date>
          <date type="end">2012-12-31</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-233" type="direct"/>
            <relation active="#struct-93591" type="indirect"/>
            <relation name="UMR7606" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-233" status="OLD">
          <idno type="RNSR">199712651U</idno>
          <idno type="ROR">https://ror.org/05krcen59</idno>
          <orgName>Laboratoire d'Informatique de Paris 6</orgName>
          <orgName type="acronym">LIP6</orgName>
          <date type="start">1997-01-01</date>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <addrLine>4 Place JUSSIEU 75252 PARIS CEDEX 05</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lip6.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-93591" type="direct"/>
            <relation name="UMR7606" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-93591" status="OLD">
          <idno type="ROR">https://ror.org/02en5vm52</idno>
          <orgName>Université Pierre et Marie Curie - Paris 6</orgName>
          <orgName type="acronym">UPMC</orgName>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <addrLine>4 place Jussieu - 75005 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.upmc.fr/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>