InforLorV4, PascalFrancis, Checkpoint, bibRecord, 000799

Keyword spotting using Support Vector Machines

Identifieur interne : 000799 ( PascalFrancis/Checkpoint ); précédent : 000798; suivant : 000800

Keyword spotting using Support Vector Machines

Auteurs : YASSINE BEN AYED [France] ; Dominique Fohr [France] ; Jean Paul Haton [France] ; Gérard Chollet [France]

Source :

Lecture notes in computer science [ 0302-9743 ] ; 2002.

RBID : Pascal:03-0146695

Descripteurs français

Pascal (Inist)
- Fonction base radiale, Apprentissage probabilités, Reconnaissance forme, Mot clé, Reconnaissance parole, Reconnaissance automatique, Base donnée, Machine support vecteur.
Wicri :
- topic : Base de données.

English descriptors

KwdEn :
- Automatic recognition, Database, Keyword, Pattern recognition, Probability learning, Radial basis function, Speech recognition, Vector support machine.

Abstract

Support Vector Machines is a new and promising technique in statistical learning theory. Recently, this technique produced very interesting results in pattern recognition [1,2,3]. In this paper, one of the first application of Support Vector Machines (SVM) technique for the problem of keyword spotting is presented. It classifies the correct and the incorrect keywords by using linear and Radial Basis Function kernels. This is a first work proposed to use SVM in keyword spotting, in order to improve recognition and rejection accuracy. The obtained results are very promising.

Affiliations:

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

to stream PascalFrancis, to step Corpus: 000818
to stream PascalFrancis, to step Curation: 000225

Links to Exploration step

Pascal:03-0146695

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Keyword spotting using Support Vector Machines</title>
<author><name sortKey="Yassine Ben Ayed" sort="Yassine Ben Ayed" uniqKey="Yassine Ben Ayed" last="Yassine Ben Ayed">YASSINE BEN AYED</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>LORIA-CNRS/ INRIA Lorraine, BP239</s1>
<s2>54506, Vandoeuvre</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
<wicri:noRegion>Vandoeuvre</wicri:noRegion>
<wicri:noRegion>BP239</wicri:noRegion>
<wicri:noRegion>54506, Vandoeuvre</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Fohr, Dominique" sort="Fohr, Dominique" uniqKey="Fohr D" first="Dominique" last="Fohr">Dominique Fohr</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>LORIA-CNRS/ INRIA Lorraine, BP239</s1>
<s2>54506, Vandoeuvre</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
<wicri:noRegion>Vandoeuvre</wicri:noRegion>
<wicri:noRegion>BP239</wicri:noRegion>
<wicri:noRegion>54506, Vandoeuvre</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Haton, Jean Paul" sort="Haton, Jean Paul" uniqKey="Haton J" first="Jean Paul" last="Haton">Jean Paul Haton</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>LORIA-CNRS/ INRIA Lorraine, BP239</s1>
<s2>54506, Vandoeuvre</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
<wicri:noRegion>Vandoeuvre</wicri:noRegion>
<wicri:noRegion>BP239</wicri:noRegion>
<wicri:noRegion>54506, Vandoeuvre</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Chollet, Gerard" sort="Chollet, Gerard" uniqKey="Chollet G" first="Gérard" last="Chollet">Gérard Chollet</name>
<affiliation wicri:level="3"><inist:fA14 i1="02"><s1>ENST, CNRS-LTCI, 46 rue Barrault</s1>
<s2>75634 Paris</s2>
<s3>FRA</s3>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Île-de-France</region>
<settlement type="city">Paris</settlement>
</placeName>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">03-0146695</idno>
<date when="2002">2002</date>
<idno type="stanalyst">PASCAL 03-0146695 INIST</idno>
<idno type="RBID">Pascal:03-0146695</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000818</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000225</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000799</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000799</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Keyword spotting using Support Vector Machines</title>
<author><name sortKey="Yassine Ben Ayed" sort="Yassine Ben Ayed" uniqKey="Yassine Ben Ayed" last="Yassine Ben Ayed">YASSINE BEN AYED</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>LORIA-CNRS/ INRIA Lorraine, BP239</s1>
<s2>54506, Vandoeuvre</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
<wicri:noRegion>Vandoeuvre</wicri:noRegion>
<wicri:noRegion>BP239</wicri:noRegion>
<wicri:noRegion>54506, Vandoeuvre</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Fohr, Dominique" sort="Fohr, Dominique" uniqKey="Fohr D" first="Dominique" last="Fohr">Dominique Fohr</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>LORIA-CNRS/ INRIA Lorraine, BP239</s1>
<s2>54506, Vandoeuvre</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
<wicri:noRegion>Vandoeuvre</wicri:noRegion>
<wicri:noRegion>BP239</wicri:noRegion>
<wicri:noRegion>54506, Vandoeuvre</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Haton, Jean Paul" sort="Haton, Jean Paul" uniqKey="Haton J" first="Jean Paul" last="Haton">Jean Paul Haton</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>LORIA-CNRS/ INRIA Lorraine, BP239</s1>
<s2>54506, Vandoeuvre</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
<wicri:noRegion>Vandoeuvre</wicri:noRegion>
<wicri:noRegion>BP239</wicri:noRegion>
<wicri:noRegion>54506, Vandoeuvre</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Chollet, Gerard" sort="Chollet, Gerard" uniqKey="Chollet G" first="Gérard" last="Chollet">Gérard Chollet</name>
<affiliation wicri:level="3"><inist:fA14 i1="02"><s1>ENST, CNRS-LTCI, 46 rue Barrault</s1>
<s2>75634 Paris</s2>
<s3>FRA</s3>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Île-de-France</region>
<settlement type="city">Paris</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="2002">2002</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>Automatic recognition</term>
<term>Database</term>
<term>Keyword</term>
<term>Pattern recognition</term>
<term>Probability learning</term>
<term>Radial basis function</term>
<term>Speech recognition</term>
<term>Vector support machine</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Fonction base radiale</term>
<term>Apprentissage probabilités</term>
<term>Reconnaissance forme</term>
<term>Mot clé</term>
<term>Reconnaissance parole</term>
<term>Reconnaissance automatique</term>
<term>Base donnée</term>
<term>Machine support vecteur</term>
</keywords>
<keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Base de données</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Support Vector Machines is a new and promising technique in statistical learning theory. Recently, this technique produced very interesting results in pattern recognition [1,2,3]. In this paper, one of the first application of Support Vector Machines (SVM) technique for the problem of keyword spotting is presented. It classifies the correct and the incorrect keywords by using linear and Radial Basis Function kernels. This is a first work proposed to use SVM in keyword spotting, in order to improve recognition and rejection accuracy. The obtained results are very promising.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01>
<fA05><s2>2448</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG"><s1>Keyword spotting using Support Vector Machines</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>TSD 2002 : text, speech and dialogue : Brno, 9-12 September 2002</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>YASSINE BEN AYED</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>FOHR (Dominique)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>HATON (Jean Paul)</s1>
</fA11>
<fA11 i1="04" i2="1"><s1>CHOLLET (Gérard)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>SOJKA (Petr)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="02" i2="1"><s1>KOPECEK (Ivan)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="03" i2="1"><s1>PALA (Karel)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>LORIA-CNRS/ INRIA Lorraine, BP239</s1>
<s2>54506, Vandoeuvre</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>ENST, CNRS-LTCI, 46 rue Barrault</s1>
<s2>75634 Paris</s2>
<s3>FRA</s3>
<sZ>4 aut.</sZ>
</fA14>
<fA20><s1>285-292</s1>
</fA20>
<fA21><s1>2002</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA26 i1="01"><s0>3-540-44129-8</s0>
</fA26>
<fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000108476490390</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2003 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>8 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>03-0146695</s0>
</fA47>
<fA60><s1>P</s1>
<s2>C</s2>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0>
</fA64>
<fA66 i1="01"><s0>DEU</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>Support Vector Machines is a new and promising technique in statistical learning theory. Recently, this technique produced very interesting results in pattern recognition [1,2,3]. In this paper, one of the first application of Support Vector Machines (SVM) technique for the problem of keyword spotting is presented. It classifies the correct and the incorrect keywords by using linear and Radial Basis Function kernels. This is a first work proposed to use SVM in keyword spotting, in order to improve recognition and rejection accuracy. The obtained results are very promising.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02C04</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001D02C02</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Fonction base radiale</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Radial basis function</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Función radial base</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Apprentissage probabilités</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Probability learning</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Aprendizaje probabilidades</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Reconnaissance forme</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Pattern recognition</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Reconocimiento patrón</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Mot clé</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Keyword</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Palabra clave</s0>
<s5>04</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Reconnaissance parole</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Speech recognition</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Reconocimiento palabra</s0>
<s5>05</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Reconnaissance automatique</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Automatic recognition</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Reconocimiento automático</s0>
<s5>06</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Base donnée</s0>
<s5>07</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG"><s0>Database</s0>
<s5>07</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA"><s0>Base dato</s0>
<s5>07</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Machine support vecteur</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG"><s0>Vector support machine</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fN21><s1>083</s1>
</fN21>
<fN82><s1>PSI</s1>
</fN82>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>International conference on text, speech and dialogue</s1>
<s2>5</s2>
<s3>Brno CZE</s3>
<s4>2002-09-09</s4>
</fA30>
</pR>
</standard>
</inist>
<affiliations><list><country><li>France</li>
</country>
<region><li>Île-de-France</li>
</region>
<settlement><li>Paris</li>
</settlement>
</list>
<tree><country name="France"><noRegion><name sortKey="Yassine Ben Ayed" sort="Yassine Ben Ayed" uniqKey="Yassine Ben Ayed" last="Yassine Ben Ayed">YASSINE BEN AYED</name>
</noRegion>
<name sortKey="Chollet, Gerard" sort="Chollet, Gerard" uniqKey="Chollet G" first="Gérard" last="Chollet">Gérard Chollet</name>
<name sortKey="Fohr, Dominique" sort="Fohr, Dominique" uniqKey="Fohr D" first="Dominique" last="Fohr">Dominique Fohr</name>
<name sortKey="Haton, Jean Paul" sort="Haton, Jean Paul" uniqKey="Haton J" first="Jean Paul" last="Haton">Jean Paul Haton</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 000799 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/biblio.hfd -nk 000799 | 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:03-0146695
   |texte=   Keyword spotting using Support Vector Machines
}}

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

Keyword spotting using Support Vector Machines

Keyword spotting using Support Vector Machines

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