InforLorV4, PascalFrancis, Checkpoint, bibRecord, 000B32

Scope classification : An instance-based learning algorithm with a rule-based characterisation

Identifieur interne : 000B32 ( PascalFrancis/Checkpoint ); précédent : 000B31; suivant : 000B33

Scope 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.

RBID : Pascal:98-0263976

Descripteurs français

Pascal (Inist)
- Intelligence artificielle, Algorithme apprentissage, Complexité algorithme, Classification.
Wicri :
- topic : Intelligence artificielle, Classification.

English descriptors

KwdEn :
- Algorithm complexity, Artificial intelligence, Classification, Learning algorithm.

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:

Links toward previous steps (curation, corpus...)

to stream PascalFrancis, to step Corpus: 000B99
to stream PascalFrancis, to step Curation: 000C75

Links to Exploration step

Pascal:98-0263976

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>
</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>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01>
<fA05><s2>1398</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG"><s1>Scope classification : An instance-based learning algorithm with a rule-based characterisation</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>Machine learning : Chemnitz, April 21-23, 1998</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>LACHICHEL (N.)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>MARQUIS (P.)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>NEDELLEC (Claire)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="02" i2="1"><s1>ROUVEIROL (Céline)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>LORIA, B.P. 239</s1>
<s2>54506 Vandoeuvre-lès-Nancy </s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14>
<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>
</fA14>
<fA20><s1>268-279</s1>
</fA20>
<fA21><s1>1998</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA26 i1="01"><s0>3-540-64417-2</s0>
</fA26>
<fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000078743660330</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 1998 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>13 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>98-0263976</s0>
</fA47>
<fA60><s1>P</s1>
<s2>C</s2>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i2="1"><s0>Lecture notes in computer science</s0>
</fA64>
<fA66 i1="01"><s0>DEU</s0>
</fA66>
<fA66 i1="02"><s0>USA</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>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.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02C02</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Intelligence artificielle</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Artificial intelligence</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Inteligencia artificial</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Algorithme apprentissage</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Learning algorithm</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Algoritmo aprendizaje</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Complexité algorithme</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Algorithm complexity</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Complejidad algoritmo</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Classification</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Classification</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="GER"><s0>Klassifizierung</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Clasificación</s0>
<s5>04</s5>
</fC03>
<fN21><s1>173</s1>
</fN21>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>ECML-98 : European conference on machine learning</s1>
<s2>10</s2>
<s3>Chemnitz DEU</s3>
<s4>1998-04-21</s4>
</fA30>
</pR>
</standard>
</inist>
<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/PascalFrancis/Checkpoint

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000B32 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/biblio.hfd -nk 000B32 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Checkpoint
   |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.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la recherche en informatique en Lorraine

Scope classification : An instance-based learning algorithm with a rule-based characterisation

Scope classification : An instance-based learning algorithm with a rule-based characterisation

Source :

Descripteurs français

English descriptors

Abstract

Links toward previous steps (curation, corpus...)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri