http://www.cnr.it/ontology/cnr/individuo/prodotto/ID29960

FPF-SB : A Scalable Algorithm for Microarray Gene Expression Data Clustering (Articolo in rivista)

Type

Label

FPF-SB : A Scalable Algorithm for Microarray Gene Expression Data Clustering (Articolo in rivista) (literal)

Anno

Alternative label

[1] Geraci F., [1] Pellegrini M., [1] Renda M. E., [1] Leoncini M., [1] Montangero M. (2007)
FPF-SB : A Scalable Algorithm for Microarray Gene Expression Data Clustering
in Lecture notes in computer science; Springer-Verlag, Berlin (Germania)
(literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori

[1] Geraci F., [1] Pellegrini M., [1] Renda M. E., [1] Leoncini M., [1] Montangero M. (literal)

Pagina inizio

Pagina fine

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume

Rivista

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#note

Proc. of 12th International Conference on Human-Computer Interaction (HCI'07), Beijing, P.R. China, July 2007 (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#pagineTotali

Note

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni

Titolo

FPF-SB : A Scalable Algorithm for Microarray Gene Expression Data Clustering (literal)

Abstract

Efficient and effective analysis of large datasets from microarray gene expression data is one of the keys to time-critical personalized medicine. The issue we address here is the scalability of the data processing software for clustering gene expression data into groups with homogeneous expression profile. In this paper we propose FPF-SB, a novel clustering algorithm based on a combination of the Furthest-Point-First (FPF) heuristic for solving the k-center problem and a stability-based method for determining the number of clusters k. Our algorithm improves the state of the art: it is scalable to large datasets without sacrificing output quality (literal)

Editore