<?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-01527874</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:26:54+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">A bounded exploration approach to constructive algorithms for recurrent neural networks</title>
            <author role="aut">
              <persName>
                <forename type="first">Romuald</forename>
                <surname>Boné</surname>
              </persName>
              <email type="md5">57db6666f8c5cdfc9f6834a3494abfe7</email>
              <email type="domain">univ-tours.fr</email>
              <idno type="idhal" notation="numeric">847908</idno>
              <idno type="halauthorid" notation="string">208678-847908</idno>
              <affiliation ref="#struct-204893"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Michel</forename>
                <surname>Crucianu</surname>
              </persName>
              <email type="md5">0c715a026c697c14721a3ef8d61ba3aa</email>
              <email type="domain">cnam.fr</email>
              <idno type="idhal" notation="string">michel-crucianu</idno>
              <idno type="idhal" notation="numeric">180351</idno>
              <idno type="halauthorid" notation="string">2139-180351</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-8204-6843</idno>
              <affiliation ref="#struct-16574"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Gilles</forename>
                <surname>Verley</surname>
              </persName>
              <email type="md5">fc47aed2912a8804696c04f7d6fd91f6</email>
              <email type="domain">univ-tours.fr</email>
              <idno type="idhal" notation="string">gilles-verley</idno>
              <idno type="idhal" notation="numeric">13860</idno>
              <idno type="halauthorid" notation="string">22581-13860</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-9287-1417</idno>
              <idno type="IDREF">https://www.idref.fr/121747158</idno>
              <affiliation ref="#struct-204893"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Jean-Pierre</forename>
                <surname>Asselin de Beauville</surname>
              </persName>
              <idno type="halauthorid">1171830-0</idno>
            </author>
            <editor role="depositor">
              <persName>
                <forename>GILLES</forename>
                <surname>VERLEY</surname>
              </persName>
              <email type="md5">fc47aed2912a8804696c04f7d6fd91f6</email>
              <email type="domain">univ-tours.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2017-05-25 23:17:51</date>
              <date type="whenModified">2025-11-04 17:34:07</date>
              <date type="whenReleased">2017-05-31 14:07:09</date>
              <date type="whenProduced">2000-07</date>
              <date type="whenEndEmbargoed">2017-05-25</date>
              <ref type="file" target="https://hal.science/hal-01527874v1/document">
                <date notBefore="2017-05-25"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-01527874v1/file/ijcnn96.pdf" id="file-1527874-1589381">
                <date notBefore="2017-05-25"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="473854">
                <persName>
                  <forename>GILLES</forename>
                  <surname>VERLEY</surname>
                </persName>
                <email type="md5">fc47aed2912a8804696c04f7d6fd91f6</email>
                <email type="domain">univ-tours.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01527874</idno>
            <idno type="halUri">https://hal.science/hal-01527874</idno>
            <idno type="halBibtex">bone:hal-01527874</idno>
            <idno type="halRefHtml">&lt;i&gt;Neural Networks, IEEE - INNS - ENNS International Joint Conference on&lt;/i&gt;, 2000</idno>
            <idno type="halRef">Neural Networks, IEEE - INNS - ENNS International Joint Conference on, 2000</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by-nc-nd/4.0/">CC BY-NC-ND 4.0 - Attribution - Non-commercial use - No Derivative Works<ref corresp="#file-1527874-1589381"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UNIV-TOURS">Université François Rabelais</idno>
            <idno type="stamp" n="CNAM">Conservatoire National des Arts et Métiers</idno>
            <idno type="stamp" n="LIFAT">Laboratoire d'Informatique Fondamentale et Appliquée de Tours</idno>
            <idno type="stamp" n="INSA-GROUPE">Groupe INSA</idno>
            <idno type="stamp" n="CEDRIC-CNAM" corresp="CNAM">Centre d'études et de recherche en informatique et communications </idno>
            <idno type="stamp" n="INSA-CVL">INSA CENTRE VAL DE LOIRE</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">A bounded exploration approach to constructive algorithms for recurrent neural networks</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Romuald</forename>
                    <surname>Boné</surname>
                  </persName>
                  <email type="md5">57db6666f8c5cdfc9f6834a3494abfe7</email>
                  <email type="domain">univ-tours.fr</email>
                  <idno type="idhal" notation="numeric">847908</idno>
                  <idno type="halauthorid" notation="string">208678-847908</idno>
                  <affiliation ref="#struct-204893"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Michel</forename>
                    <surname>Crucianu</surname>
                  </persName>
                  <email type="md5">0c715a026c697c14721a3ef8d61ba3aa</email>
                  <email type="domain">cnam.fr</email>
                  <idno type="idhal" notation="string">michel-crucianu</idno>
                  <idno type="idhal" notation="numeric">180351</idno>
                  <idno type="halauthorid" notation="string">2139-180351</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-8204-6843</idno>
                  <affiliation ref="#struct-16574"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Gilles</forename>
                    <surname>Verley</surname>
                  </persName>
                  <email type="md5">fc47aed2912a8804696c04f7d6fd91f6</email>
                  <email type="domain">univ-tours.fr</email>
                  <idno type="idhal" notation="string">gilles-verley</idno>
                  <idno type="idhal" notation="numeric">13860</idno>
                  <idno type="halauthorid" notation="string">22581-13860</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-9287-1417</idno>
                  <idno type="IDREF">https://www.idref.fr/121747158</idno>
                  <affiliation ref="#struct-204893"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Jean-Pierre</forename>
                    <surname>Asselin de Beauville</surname>
                  </persName>
                  <idno type="halauthorid">1171830-0</idno>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="INCOMING">58242</idno>
                <title level="j">Neural Networks, IEEE - INNS - ENNS International Joint Conference on</title>
                <imprint>
                  <date type="datePub">2000-07</date>
                </imprint>
              </monogr>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">recurrent neural networks</term>
                <term xml:lang="en"> constructive algorithms</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-ne">Computer Science [cs]/Neural and Evolutionary Computing [cs.NE]</classCode>
              <classCode scheme="halTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halOldTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halTreeTypology" n="ART">Journal articles</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>When long-term dependencies are present in a time series, the approximation capabilities of recurrent neural networks are difficult to exploit by gradient descent algorithms. It is easier for such algorithms to find good solutions if one includes connections with time delays in the recurrent networks. One can choose the locations and delays for these connections by the heuristic presented here. As shown on two benchmark problems, this heuristic produces very good results while keeping the total number of connections in the recurrent network to a minimum.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-204893" status="VALID">
          <idno type="IdRef">081090722</idno>
          <idno type="RNSR">201220254T</idno>
          <idno type="ROR">https://ror.org/03r938j26</idno>
          <orgName>Laboratoire d'Informatique Fondamentale et Appliquée de Tours</orgName>
          <orgName type="acronym">LIFAT</orgName>
          <date type="start">2012-01-01</date>
          <desc>
            <address>
              <addrLine>64, Avenue Jean Portalis, 37200 Tours</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://lifat.univ-tours.fr/</ref>
          </desc>
          <listRelation>
            <relation name="UR6300" active="#struct-300298" type="direct"/>
            <relation active="#struct-303079" type="direct"/>
            <relation active="#struct-301232" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-16574" status="VALID">
          <idno type="IdRef">155463381</idno>
          <idno type="RNSR">201119480F</idno>
          <idno type="ROR">https://ror.org/044j5mm75</idno>
          <orgName>Centre d'études et de recherche en informatique et communications</orgName>
          <orgName type="acronym">CEDRIC</orgName>
          <desc>
            <address>
              <addrLine>292 rue Saint-Martin 75141 PARIS Cedex 03Case courrier 2D4P30</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://cedric.cnam.fr/</ref>
          </desc>
          <listRelation>
            <relation name="EA4629" active="#struct-179741" type="direct"/>
            <relation name="EA4629" active="#struct-300351" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300298" status="VALID">
          <idno type="IdRef">026404478</idno>
          <idno type="ISNI">0000000121608742</idno>
          <idno type="ROR">https://ror.org/02wwzvj46</idno>
          <orgName>Université de Tours</orgName>
          <orgName type="acronym">UT</orgName>
          <date type="start">1970-12-17</date>
          <desc>
            <address>
              <addrLine>60 rue du Plat d'Étain, 37020 Tours cedex 1</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-tours.fr</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-303079" status="VALID">
          <idno type="IdRef">203592077</idno>
          <orgName>Institut National des Sciences Appliquées - Centre Val de Loire</orgName>
          <orgName type="acronym">INSA CVL</orgName>
          <date type="start">2014-01-01</date>
          <desc>
            <address>
              <addrLine>88 boulevard Lahitolle, CS 60013, 18022 Bourges cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.insa-centrevaldeloire.fr/fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-301232" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-301232" status="VALID">
          <idno type="IdRef">162105150</idno>
          <orgName>Institut National des Sciences Appliquées</orgName>
          <orgName type="acronym">INSA</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
        </org>
        <org type="institution" xml:id="struct-179741" status="VALID">
          <orgName>Ecole Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise</orgName>
          <orgName type="acronym">ENSIIE</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.ensiie.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-300351" status="VALID">
          <idno type="IdRef">027404978</idno>
          <idno type="ISNI">0000000121690459</idno>
          <idno type="ROR">https://ror.org/0175hh227</idno>
          <orgName>Conservatoire National des Arts et Métiers [Cnam]</orgName>
          <orgName type="acronym">Cnam</orgName>
          <desc>
            <address>
              <addrLine>292 Rue Saint-Martin, 75003 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.cnam.fr/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>