InforLorV4, PascalFrancis, Curation, bibRecord, 000162

A new multi-class SVM based on a uniform convergence result

Identifieur interne : 000162 ( PascalFrancis/Curation ); précédent : 000161; suivant : 000163

A new multi-class SVM based on a uniform convergence result

Auteurs : Yann Guermeur [France] ; André Elisseeff [France] ; Hélène Paugam-Moisy [France]

Source :

RBID : Pascal:02-0121845

Descripteurs français

Pascal (Inist)
- Intelligence artificielle, Discrimination, Analyse donnée, Réseau neuronal, Apprentissage probabilités, Machine support vecteur.
Wicri :
- topic : Intelligence artificielle.

English descriptors

KwdEn :
- Artificial intelligence, Data analysis, Discrimination, Neural network, Probability learning, Vector support machine.

Abstract

We introduce a new support vector machine devoted to the approximation of multi-class discriminant functions. Its training procedure consists in minimizing a new expression of the guaranteed risk. This bound is significantly tighter than the former ones, which should make the implementation of the structural risk minimization inductive principle in the context of multi-class discrimination better grounded.

A08	`01`	`1`	`ENG`	`@1 A new multi-class SVM based on a uniform convergence result`
A09	`01`	`1`	`ENG`	`@1 IJCNN 2000 : international joint conference on neural networks : neural computing : new challenges and perspectives for the new millennium : Como, 24-27 July 2000`
A11	`01`	`1`		`@1 GUERMEUR (Yann)`
A11	`02`	`1`		`@1 ELISSEEFF (André)`
A11	`03`	`1`		`@1 PAUGAM-MOISY (Hélène)`
A12	`01`	`1`		`@1 AMARI (Shun-Ichi) @9 ed.`
A12	`02`	`1`		`@1 GILES (C. Lee) @9 ed.`
A12	`03`	`1`		`@1 GORI (Marco) @9 ed.`
A12	`04`	`1`		`@1 PIURI (Vincenzo) @9 ed.`
A14	`01`			`@1 LORIA, Campus Scientifique, BP 239 @2 54506 Vandœuvre-lès-Nancy @3 FRA @Z 1 aut.`
A14	`02`			`@1 ERIC, Université Lumière Lyon 2, 5, avenue Pierre Mendès-France @2 69676 Bron @3 FRA @Z 2 aut. @Z 3 aut.`
A20				`@2 Vol4.183-188`
A21				`@1 2000`
A23	`01`			`@0 ENG`
A25	`01`			`@1 IEEE Computer Society @2 Los Alamitos CA`
A26	`01`			`@0 0-7695-0619-4`
A30	`01`	`1`	`ENG`	`@1 IEEE-INNS-ENNS international joint conference on neural networks @3 Como ITA @4 2000-07-24`
A43	`01`			`@1 INIST @2 Y 33704 @5 354000097049262430`
A44				`@0 0000 @1 © 2002 INIST-CNRS. All rights reserved.`
A45				`@0 13 ref.`
A47	`01`	`1`		`@0 02-0121845`
A60				`@1 C`
A61				`@0 A`
A66	`01`			`@0 USA`
C01	`01`		`ENG`	`@0 We introduce a new support vector machine devoted to the approximation of multi-class discriminant functions. Its training procedure consists in minimizing a new expression of the guaranteed risk. This bound is significantly tighter than the former ones, which should make the implementation of the structural risk minimization inductive principle in the context of multi-class discrimination better grounded.`
C02	`01`	`X`		`@0 001D02C06`
C03	`01`	`X`	`FRE`	`@0 Intelligence artificielle @5 04`
C03	`01`	`X`	`ENG`	`@0 Artificial intelligence @5 04`
C03	`01`	`X`	`SPA`	`@0 Inteligencia artificial @5 04`
C03	`02`	`X`	`FRE`	`@0 Discrimination @5 05`
C03	`02`	`X`	`ENG`	`@0 Discrimination @5 05`
C03	`02`	`X`	`SPA`	`@0 Discriminación @5 05`
C03	`03`	`X`	`FRE`	`@0 Analyse donnée @5 06`
C03	`03`	`X`	`ENG`	`@0 Data analysis @5 06`
C03	`03`	`X`	`SPA`	`@0 Análisis datos @5 06`
C03	`04`	`X`	`FRE`	`@0 Réseau neuronal @5 07`
C03	`04`	`X`	`ENG`	`@0 Neural network @5 07`
C03	`04`	`X`	`SPA`	`@0 Red neuronal @5 07`
C03	`05`	`X`	`FRE`	`@0 Apprentissage probabilités @5 08`
C03	`05`	`X`	`ENG`	`@0 Probability learning @5 08`
C03	`05`	`X`	`SPA`	`@0 Aprendizaje probabilidades @5 08`
C03	`06`	`X`	`FRE`	`@0 Machine support vecteur @4 CD @5 96`
C03	`06`	`X`	`ENG`	`@0 Vector support machine @4 CD @5 96`
N21				`@1 063`
N82				`@1 PSI`

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

to stream PascalFrancis, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000890

Links to Exploration step

Pascal:02-0121845

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">A new multi-class SVM based on a uniform convergence result</title>
<author><name sortKey="Guermeur, Yann" sort="Guermeur, Yann" uniqKey="Guermeur Y" first="Yann" last="Guermeur">Yann Guermeur</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>LORIA, Campus Scientifique, BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Elisseeff, Andre" sort="Elisseeff, Andre" uniqKey="Elisseeff A" first="André" last="Elisseeff">André Elisseeff</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>ERIC, Université Lumière Lyon 2, 5, avenue Pierre Mendès-France</s1>
<s2>69676 Bron</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Paugam Moisy, Helene" sort="Paugam Moisy, Helene" uniqKey="Paugam Moisy H" first="Hélène" last="Paugam-Moisy">Hélène Paugam-Moisy</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>ERIC, Université Lumière Lyon 2, 5, avenue Pierre Mendès-France</s1>
<s2>69676 Bron</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">02-0121845</idno>
<date when="2000">2000</date>
<idno type="stanalyst">PASCAL 02-0121845 INIST</idno>
<idno type="RBID">Pascal:02-0121845</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000890</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000162</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">A new multi-class SVM based on a uniform convergence result</title>
<author><name sortKey="Guermeur, Yann" sort="Guermeur, Yann" uniqKey="Guermeur Y" first="Yann" last="Guermeur">Yann Guermeur</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>LORIA, Campus Scientifique, BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Elisseeff, Andre" sort="Elisseeff, Andre" uniqKey="Elisseeff A" first="André" last="Elisseeff">André Elisseeff</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>ERIC, Université Lumière Lyon 2, 5, avenue Pierre Mendès-France</s1>
<s2>69676 Bron</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Paugam Moisy, Helene" sort="Paugam Moisy, Helene" uniqKey="Paugam Moisy H" first="Hélène" last="Paugam-Moisy">Hélène Paugam-Moisy</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>ERIC, Université Lumière Lyon 2, 5, avenue Pierre Mendès-France</s1>
<s2>69676 Bron</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Artificial intelligence</term>
<term>Data analysis</term>
<term>Discrimination</term>
<term>Neural network</term>
<term>Probability learning</term>
<term>Vector support machine</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Intelligence artificielle</term>
<term>Discrimination</term>
<term>Analyse donnée</term>
<term>Réseau neuronal</term>
<term>Apprentissage probabilités</term>
<term>Machine support vecteur</term>
</keywords>
<keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Intelligence artificielle</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">We introduce a new support vector machine devoted to the approximation of multi-class discriminant functions. Its training procedure consists in minimizing a new expression of the guaranteed risk. This bound is significantly tighter than the former ones, which should make the implementation of the structural risk minimization inductive principle in the context of multi-class discrimination better grounded.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA08 i1="01" i2="1" l="ENG"><s1>A new multi-class SVM based on a uniform convergence result</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>IJCNN 2000 : international joint conference on neural networks : neural computing : new challenges and perspectives for the new millennium : Como, 24-27 July 2000 </s1>
</fA09>
<fA11 i1="01" i2="1"><s1>GUERMEUR (Yann)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>ELISSEEFF (André)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>PAUGAM-MOISY (Hélène)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>AMARI (Shun-Ichi)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="02" i2="1"><s1>GILES (C. Lee)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="03" i2="1"><s1>GORI (Marco)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="04" i2="1"><s1>PIURI (Vincenzo)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>LORIA, Campus Scientifique, BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>ERIC, Université Lumière Lyon 2, 5, avenue Pierre Mendès-France</s1>
<s2>69676 Bron</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</fA14>
<fA20><s2>Vol4.183-188</s2>
</fA20>
<fA21><s1>2000</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA25 i1="01"><s1>IEEE Computer Society</s1>
<s2>Los Alamitos CA</s2>
</fA25>
<fA26 i1="01"><s0>0-7695-0619-4</s0>
</fA26>
<fA30 i1="01" i2="1" l="ENG"><s1>IEEE-INNS-ENNS international joint conference on neural networks</s1>
<s3>Como ITA</s3>
<s4>2000-07-24</s4>
</fA30>
<fA43 i1="01"><s1>INIST</s1>
<s2>Y 33704</s2>
<s5>354000097049262430</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2002 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>13 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>02-0121845</s0>
</fA47>
<fA60><s1>C</s1>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA66 i1="01"><s0>USA</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>We introduce a new support vector machine devoted to the approximation of multi-class discriminant functions. Its training procedure consists in minimizing a new expression of the guaranteed risk. This bound is significantly tighter than the former ones, which should make the implementation of the structural risk minimization inductive principle in the context of multi-class discrimination better grounded.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02C06</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Intelligence artificielle</s0>
<s5>04</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Artificial intelligence</s0>
<s5>04</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Inteligencia artificial</s0>
<s5>04</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Discrimination</s0>
<s5>05</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Discrimination</s0>
<s5>05</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Discriminación</s0>
<s5>05</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Analyse donnée</s0>
<s5>06</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Data analysis</s0>
<s5>06</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Análisis datos</s0>
<s5>06</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Réseau neuronal</s0>
<s5>07</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Neural network</s0>
<s5>07</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Red neuronal</s0>
<s5>07</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Apprentissage probabilités</s0>
<s5>08</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Probability learning</s0>
<s5>08</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Aprendizaje probabilidades</s0>
<s5>08</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Machine support vecteur</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Vector support machine</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fN21><s1>063</s1>
</fN21>
<fN82><s1>PSI</s1>
</fN82>
</pA>
</standard>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Curation

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

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Curation/biblio.hfd -nk 000162 | SxmlIndent | more

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Curation
   |type=    RBID
   |clé=     Pascal:02-0121845
   |texte=   A new multi-class SVM based on a uniform convergence result
}}

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

A new multi-class SVM based on a uniform convergence result

A new multi-class SVM based on a uniform convergence result

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