Scope classification : An instance-based learning algorithm with a rule-based characterisation
Identifieur interne : 00B427 ( Main/Exploration ); précédent : 00B426; suivant : 00B428Scope classification : An instance-based learning algorithm with a rule-based characterisation
Auteurs : N. Lachichel [France] ; P. Marquis [France]Source :
- Lecture notes in computer science [ 0302-9743 ] ; 1998.
Descripteurs français
- Pascal (Inist)
- Wicri :
- topic : Intelligence artificielle, Classification.
English descriptors
Abstract
Scope classification is a new instance-based learning (IBL) technique with a rule-based characterisation. Within the scope approach, the classification of an object o is based on the examples that are closer to o than every example labelled with another class. In contrast to standard distance-based IBL classifiers, scope classification relies on partial pre-orderings ≤o between examples, indexed by objects. Interestingly, the notion of closeness to o that is used characterises the classes predicted by all the rules that cover o and are relevant and consistent for the training set. Accordingly, scope classification is an IBL technique with a rule-based characterisation. Since rules do not have to be explicitly generated, the scope approach applies to classification problems where the number of rules prevents them from being exhaustively computed.
Affiliations:
- France
- Grand Est, Hauts-de-France, Lorraine (région), Nord-Pas-de-Calais
- Lens (Pas-de-Calais), Vandoeuvre-lès-Nancy
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: 000B99
- to stream PascalFrancis, to step Curation: 000C75
- to stream PascalFrancis, to step Checkpoint: 000B32
- to stream Main, to step Merge: 00BB54
- to stream Main, to step Curation: 00B427
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Scope classification : An instance-based learning algorithm with a rule-based characterisation</title>
<author><name sortKey="Lachichel, N" sort="Lachichel, N" uniqKey="Lachichel N" first="N." last="Lachichel">N. Lachichel</name>
<affiliation wicri:level="3"><inist:fA14 i1="01"><s1>LORIA, B.P. 239</s1>
<s2>54506 Vandoeuvre-lès-Nancy </s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Vandoeuvre-lès-Nancy </settlement>
</placeName>
</affiliation>
</author>
<author><name sortKey="Marquis, P" sort="Marquis, P" uniqKey="Marquis P" first="P." last="Marquis">P. Marquis</name>
<affiliation wicri:level="3"><inist:fA14 i1="02"><s1>CRIL/Université d'Artois, Rue de l'Université, S.P. 16</s1>
<s2>62307 Lens</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Hauts-de-France</region>
<region type="old region" nuts="2">Nord-Pas-de-Calais</region>
<settlement type="city">Lens (Pas-de-Calais)</settlement>
</placeName>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">98-0263976</idno>
<date when="1998">1998</date>
<idno type="stanalyst">PASCAL 98-0263976 INIST</idno>
<idno type="RBID">Pascal:98-0263976</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000B99</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000C75</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000B32</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000B32</idno>
<idno type="wicri:doubleKey">0302-9743:1998:Lachichel N:scope:classification:an</idno>
<idno type="wicri:Area/Main/Merge">00BB54</idno>
<idno type="wicri:Area/Main/Curation">00B427</idno>
<idno type="wicri:Area/Main/Exploration">00B427</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Scope classification : An instance-based learning algorithm with a rule-based characterisation</title>
<author><name sortKey="Lachichel, N" sort="Lachichel, N" uniqKey="Lachichel N" first="N." last="Lachichel">N. Lachichel</name>
<affiliation wicri:level="3"><inist:fA14 i1="01"><s1>LORIA, B.P. 239</s1>
<s2>54506 Vandoeuvre-lès-Nancy </s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Vandoeuvre-lès-Nancy </settlement>
</placeName>
</affiliation>
</author>
<author><name sortKey="Marquis, P" sort="Marquis, P" uniqKey="Marquis P" first="P." last="Marquis">P. Marquis</name>
<affiliation wicri:level="3"><inist:fA14 i1="02"><s1>CRIL/Université d'Artois, Rue de l'Université, S.P. 16</s1>
<s2>62307 Lens</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Hauts-de-France</region>
<region type="old region" nuts="2">Nord-Pas-de-Calais</region>
<settlement type="city">Lens (Pas-de-Calais)</settlement>
</placeName>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="1998">1998</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Algorithm complexity</term>
<term>Artificial intelligence</term>
<term>Classification</term>
<term>Learning algorithm</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Intelligence artificielle</term>
<term>Algorithme apprentissage</term>
<term>Complexité algorithme</term>
<term>Classification</term>
</keywords>
<keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Intelligence artificielle</term>
<term>Classification</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Scope classification is a new instance-based learning (IBL) technique with a rule-based characterisation. Within the scope approach, the classification of an object o is based on the examples that are closer to o than every example labelled with another class. In contrast to standard distance-based IBL classifiers, scope classification relies on partial pre-orderings ≤<sub>o</sub>
between examples, indexed by objects. Interestingly, the notion of closeness to o that is used characterises the classes predicted by all the rules that cover o and are relevant and consistent for the training set. Accordingly, scope classification is an IBL technique with a rule-based characterisation. Since rules do not have to be explicitly generated, the scope approach applies to classification problems where the number of rules prevents them from being exhaustively computed.</div>
</front>
</TEI>
<affiliations><list><country><li>France</li>
</country>
<region><li>Grand Est</li>
<li>Hauts-de-France</li>
<li>Lorraine (région)</li>
<li>Nord-Pas-de-Calais</li>
</region>
<settlement><li>Lens (Pas-de-Calais)</li>
<li>Vandoeuvre-lès-Nancy </li>
</settlement>
</list>
<tree><country name="France"><region name="Grand Est"><name sortKey="Lachichel, N" sort="Lachichel, N" uniqKey="Lachichel N" first="N." last="Lachichel">N. Lachichel</name>
</region>
<name sortKey="Marquis, P" sort="Marquis, P" uniqKey="Marquis P" first="P." last="Marquis">P. Marquis</name>
</country>
</tree>
</affiliations>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00B427 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00B427 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Main |étape= Exploration |type= RBID |clé= Pascal:98-0263976 |texte= Scope classification : An instance-based learning algorithm with a rule-based characterisation }}
![]() | This area was generated with Dilib version V0.6.33. | ![]() |