Efficient and effective analysis of large datasets from microarraygene expression data is one of the keys to time-critical personalizedmedicine. The issue we address here is the scalability of the dataprocessing software for clustering gene expression data into groupswith homogeneous expression profile. In this paper we propose FPFSB,a novel clustering algorithm based on a combination of theFurthest-Point-First (FPF) heuristic for solving the k-center problemand a stability-based method for determining the number of clustersk. Our algorithm improves the state of the art: it is scalable to largedatasets without sacrificing output quality.
FPF-SB: A SCALABLE ALGORITHM FOR MICROARRAY GENE EXPRESSION DATA CLUSTERING / Geraci, F; Leoncini, Mauro; Montangero, Manuela; Pellegrini, M; Renda, M. E.. - STAMPA. - 4561:(2007), pp. 606-615. (Intervento presentato al convegno 1st International Conference on Digital Human Modeling, ICDHM 2007 tenutosi a Beijing, chn nel 22 - 27 July 2007) [10.1007/978-3-540-73321-8_69].
FPF-SB: A SCALABLE ALGORITHM FOR MICROARRAY GENE EXPRESSION DATA CLUSTERING
LEONCINI, Mauro;MONTANGERO, Manuela;
2007
Abstract
Efficient and effective analysis of large datasets from microarraygene expression data is one of the keys to time-critical personalizedmedicine. The issue we address here is the scalability of the dataprocessing software for clustering gene expression data into groupswith homogeneous expression profile. In this paper we propose FPFSB,a novel clustering algorithm based on a combination of theFurthest-Point-First (FPF) heuristic for solving the k-center problemand a stability-based method for determining the number of clustersk. Our algorithm improves the state of the art: it is scalable to largedatasets without sacrificing output quality.
Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris
