Scalable Feature Selection for Multi-class Problems
Identifieur interne : 000B29 ( Main/Curation ); précédent : 000B28; suivant : 000B30Scalable Feature Selection for Multi-class Problems
Auteurs : Boris Chidlovskii [France] ; Loïc Lecerf [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2008.
Abstract
Abstract: Scalable feature selection algorithms should remove irrelevant and redundant features and scale well on very large datasets. We identify that the currently best state-of-art methods perform well on binary classification tasks but often underperform on multi-class tasks. We suggest that they suffer from the so-called accumulative effect which becomes more visible with the growing number of classes and results in removing relevant and unredundant features. To remedy the problem, we propose two new feature filtering methods which are both scalable and well adapted for the multi-class cases. We report the evaluation results on 17 different datasets which include both binary and multi-class cases.
Url:
DOI: 10.1007/978-3-540-87479-9_33
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: Pour aller vers cette notice dans l'étape Curation :002617
- to stream Istex, to step Curation: Pour aller vers cette notice dans l'étape Curation :002445
- to stream Istex, to step Checkpoint: Pour aller vers cette notice dans l'étape Curation :000595
- to stream Main, to step Merge: Pour aller vers cette notice dans l'étape Curation :000B41
Links to Exploration step
ISTEX:AF90A1E8607E3B8D29895429552714181519DB81Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct:series"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Scalable Feature Selection for Multi-class Problems</title>
<author><name sortKey="Chidlovskii, Boris" sort="Chidlovskii, Boris" uniqKey="Chidlovskii B" first="Boris" last="Chidlovskii">Boris Chidlovskii</name>
</author>
<author><name sortKey="Lecerf, Loic" sort="Lecerf, Loic" uniqKey="Lecerf L" first="Loïc" last="Lecerf">Loïc Lecerf</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:AF90A1E8607E3B8D29895429552714181519DB81</idno>
<date when="2008" year="2008">2008</date>
<idno type="doi">10.1007/978-3-540-87479-9_33</idno>
<idno type="url">https://api.istex.fr/document/AF90A1E8607E3B8D29895429552714181519DB81/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">002617</idno>
<idno type="wicri:Area/Istex/Curation">002445</idno>
<idno type="wicri:Area/Istex/Checkpoint">000595</idno>
<idno type="wicri:doubleKey">0302-9743:2008:Chidlovskii B:scalable:feature:selection</idno>
<idno type="wicri:Area/Main/Merge">000B41</idno>
<idno type="wicri:Area/Main/Curation">000B29</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Scalable Feature Selection for Multi-class Problems</title>
<author><name sortKey="Chidlovskii, Boris" sort="Chidlovskii, Boris" uniqKey="Chidlovskii B" first="Boris" last="Chidlovskii">Boris Chidlovskii</name>
<affiliation wicri:level="3"><country xml:lang="fr">France</country>
<wicri:regionArea>Xerox Research Centre Europe, 6, chemin de Maupertuis, F–38240, Meylan</wicri:regionArea>
<placeName><region type="region" nuts="2">Auvergne-Rhône-Alpes</region>
<region type="old region" nuts="2">Rhône-Alpes</region>
<settlement type="city">Meylan</settlement>
</placeName>
</affiliation>
</author>
<author><name sortKey="Lecerf, Loic" sort="Lecerf, Loic" uniqKey="Lecerf L" first="Loïc" last="Lecerf">Loïc Lecerf</name>
<affiliation wicri:level="3"><country xml:lang="fr">France</country>
<wicri:regionArea>Xerox Research Centre Europe, 6, chemin de Maupertuis, F–38240, Meylan</wicri:regionArea>
<placeName><region type="region" nuts="2">Auvergne-Rhône-Alpes</region>
<region type="old region" nuts="2">Rhône-Alpes</region>
<settlement type="city">Meylan</settlement>
</placeName>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s">Lecture Notes in Computer Science</title>
<imprint><date>2008</date>
</imprint>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
<idno type="istex">AF90A1E8607E3B8D29895429552714181519DB81</idno>
<idno type="DOI">10.1007/978-3-540-87479-9_33</idno>
<idno type="ChapterID">33</idno>
<idno type="ChapterID">Chap33</idno>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass></textClass>
<langUsage><language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: Scalable feature selection algorithms should remove irrelevant and redundant features and scale well on very large datasets. We identify that the currently best state-of-art methods perform well on binary classification tasks but often underperform on multi-class tasks. We suggest that they suffer from the so-called accumulative effect which becomes more visible with the growing number of classes and results in removing relevant and unredundant features. To remedy the problem, we propose two new feature filtering methods which are both scalable and well adapted for the multi-class cases. We report the evaluation results on 17 different datasets which include both binary and multi-class cases.</div>
</front>
</TEI>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Main/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000B29 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Curation/biblio.hfd -nk 000B29 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Ticri/CIDE |area= OcrV1 |flux= Main |étape= Curation |type= RBID |clé= ISTEX:AF90A1E8607E3B8D29895429552714181519DB81 |texte= Scalable Feature Selection for Multi-class Problems }}
![]() | This area was generated with Dilib version V0.6.32. | ![]() |