Finding best algorithmic components for clustering microarray data

The analysis of microarray data is fundamental to microbiology. Although clustering has long been realized as central to the discovery of gene functions and disease diagnostic, researchers have found the construction of good algorithms a surprisingly difficult task. In this paper, we address this pr...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Knowledge and information systems Ročník 35; číslo 1; s. 111 - 130
Hlavní autori: Vukićević, Milan, Kirchner, Kathrin, Delibašić, Boris, Jovanović, Miloš, Ruhland, Johannes, Suknović, Milija
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: London Springer-Verlag 01.04.2013
Springer
Springer Nature B.V
Predmet:
ISSN:0219-1377, 0219-3116
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The analysis of microarray data is fundamental to microbiology. Although clustering has long been realized as central to the discovery of gene functions and disease diagnostic, researchers have found the construction of good algorithms a surprisingly difficult task. In this paper, we address this problem by using a component-based approach for clustering algorithm design, for class retrieval from microarray data. The idea is to break up existing algorithms into independent building blocks for typical sub-problems, which are in turn reassembled in new ways to generate yet unexplored methods. As a test, 432 algorithms were generated and evaluated on published microarray data sets. We found their top performers to be better than the original, component-providing ancestors and also competitive with a set of new algorithms recently proposed. Finally, we identified components that showed consistently good performance for clustering microarray data and that should be considered in further development of clustering algorithms.
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0219-1377
0219-3116
DOI:10.1007/s10115-012-0542-5