Serveur d'exploration sur la maladie de Parkinson

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.

Comparative Evaluation of Set-Level Techniques in Microarray Classification

Identifieur interne : 000066 ( Main/Exploration ); précédent : 000065; suivant : 000067

Comparative Evaluation of Set-Level Techniques in Microarray Classification

Auteurs : Jiri Klema ; Matej Holec ; Filip Zelezny ; Jakub Tolar

Source :

RBID : ISTEX:8D32C4B26FC4580477078479FF7AF0BE621D7E30

Abstract

Abstract: Analysis of gene expression data in terms of a priori-defined gene sets typically yields more compact and interpretable results than those produced by traditional methods that rely on individual genes. The set-level strategy can also be adopted in predictive classification tasks accomplished with machine learning algorithms. Here, sample features originally corresponding to genes are replaced by a much smaller number of features, each corresponding to a gene set and aggregating expressions of its members into a single real value. Classifiers learned from such transformed features promise better interpretability in that they derive class predictions from overall expressions of selected gene sets (e.g. corresponding to pathways) rather than expressions of specific genes. In a large collection of experiments we test how accurate such classifiers are compared to traditional classifiers based on genes. Furthermore, we translate some recently published gene set analysis techniques to the above proposed machine learning setting and assess their contributions to the classification accuracies.

Url:
DOI: 10.1007/978-3-642-21260-4_27


Affiliations:


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


Le document en format XML

<record>
<TEI wicri:istexFullTextTei="biblStruct:series">
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en">Comparative Evaluation of Set-Level Techniques in Microarray Classification</title>
<author>
<name sortKey="Klema, Jiri" sort="Klema, Jiri" uniqKey="Klema J" first="Jiri" last="Klema">Jiri Klema</name>
</author>
<author>
<name sortKey="Holec, Matej" sort="Holec, Matej" uniqKey="Holec M" first="Matej" last="Holec">Matej Holec</name>
</author>
<author>
<name sortKey="Zelezny, Filip" sort="Zelezny, Filip" uniqKey="Zelezny F" first="Filip" last="Zelezny">Filip Zelezny</name>
</author>
<author>
<name sortKey="Tolar, Jakub" sort="Tolar, Jakub" uniqKey="Tolar J" first="Jakub" last="Tolar">Jakub Tolar</name>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:8D32C4B26FC4580477078479FF7AF0BE621D7E30</idno>
<date when="2011" year="2011">2011</date>
<idno type="doi">10.1007/978-3-642-21260-4_27</idno>
<idno type="url">https://api.istex.fr/document/8D32C4B26FC4580477078479FF7AF0BE621D7E30/fulltext/pdf</idno>
<idno type="wicri:Area/Main/Corpus">002749</idno>
<idno type="wicri:Area/Main/Curation">002406</idno>
<idno type="wicri:Area/Main/Exploration">000066</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title level="a" type="main" xml:lang="en">Comparative Evaluation of Set-Level Techniques in Microarray Classification</title>
<author>
<name sortKey="Klema, Jiri" sort="Klema, Jiri" uniqKey="Klema J" first="Jiri" last="Klema">Jiri Klema</name>
<affiliation>
<wicri:noCountry code="subField"></wicri:noCountry>
</affiliation>
</author>
<author>
<name sortKey="Holec, Matej" sort="Holec, Matej" uniqKey="Holec M" first="Matej" last="Holec">Matej Holec</name>
<affiliation>
<wicri:noCountry code="subField"></wicri:noCountry>
</affiliation>
</author>
<author>
<name sortKey="Zelezny, Filip" sort="Zelezny, Filip" uniqKey="Zelezny F" first="Filip" last="Zelezny">Filip Zelezny</name>
<affiliation>
<wicri:noCountry code="subField"></wicri:noCountry>
</affiliation>
</author>
<author>
<name sortKey="Tolar, Jakub" sort="Tolar, Jakub" uniqKey="Tolar J" first="Jakub" last="Tolar">Jakub Tolar</name>
<affiliation>
<wicri:noCountry code="subField">Minneapolis</wicri:noCountry>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series>
<title level="s">Lecture Notes in Computer Science</title>
<imprint>
<date>2011</date>
</imprint>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
<idno type="istex">8D32C4B26FC4580477078479FF7AF0BE621D7E30</idno>
<idno type="DOI">10.1007/978-3-642-21260-4_27</idno>
<idno type="ChapterID">Chap27</idno>
<idno type="ChapterID">27</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: Analysis of gene expression data in terms of a priori-defined gene sets typically yields more compact and interpretable results than those produced by traditional methods that rely on individual genes. The set-level strategy can also be adopted in predictive classification tasks accomplished with machine learning algorithms. Here, sample features originally corresponding to genes are replaced by a much smaller number of features, each corresponding to a gene set and aggregating expressions of its members into a single real value. Classifiers learned from such transformed features promise better interpretability in that they derive class predictions from overall expressions of selected gene sets (e.g. corresponding to pathways) rather than expressions of specific genes. In a large collection of experiments we test how accurate such classifiers are compared to traditional classifiers based on genes. Furthermore, we translate some recently published gene set analysis techniques to the above proposed machine learning setting and assess their contributions to the classification accuracies.</div>
</front>
</TEI>
<affiliations>
<list></list>
<tree>
<noCountry>
<name sortKey="Holec, Matej" sort="Holec, Matej" uniqKey="Holec M" first="Matej" last="Holec">Matej Holec</name>
<name sortKey="Klema, Jiri" sort="Klema, Jiri" uniqKey="Klema J" first="Jiri" last="Klema">Jiri Klema</name>
<name sortKey="Tolar, Jakub" sort="Tolar, Jakub" uniqKey="Tolar J" first="Jakub" last="Tolar">Jakub Tolar</name>
<name sortKey="Zelezny, Filip" sort="Zelezny, Filip" uniqKey="Zelezny F" first="Filip" last="Zelezny">Filip Zelezny</name>
</noCountry>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Sante/explor/ParkinsonV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000066 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000066 | SxmlIndent | more

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

{{Explor lien
   |wiki=    Wicri/Sante
   |area=    ParkinsonV1
   |flux=    Main
   |étape=   Exploration
   |type=    RBID
   |clé=     ISTEX:8D32C4B26FC4580477078479FF7AF0BE621D7E30
   |texte=   Comparative Evaluation of Set-Level Techniques in Microarray Classification
}}

Wicri

This area was generated with Dilib version V0.6.23.
Data generation: Sun Jul 3 18:06:51 2016. Site generation: Wed Mar 6 18:46:03 2024