In this paper we investigate the performance of a refined version of the Kohonen self organizing feature maps algorithm in terms of classification correctness when we inject in a sparse input matrix different kinds of noise and compared these classification results with the one without noise. The analysis not only gives indications on the classification errors due to noisy data, but also let a methodology to emerge in order to identify the portion of the input matrix that must be controlled with great care for avoiding classification errors. The methodology also suggests a suitable data partitioning approach for a GRID implementation of the described algorithm. The methodological indications were successfully verified by a case study belonging to the bioinformatics field. © 2008 Springer Berlin Heidelberg.
Input Noise Robustness and Sensitivity Analysis to Improve Large Datasets Clustering by Using the GRID
GIORDANO, Daniela;
2008-01-01
Abstract
In this paper we investigate the performance of a refined version of the Kohonen self organizing feature maps algorithm in terms of classification correctness when we inject in a sparse input matrix different kinds of noise and compared these classification results with the one without noise. The analysis not only gives indications on the classification errors due to noisy data, but also let a methodology to emerge in order to identify the portion of the input matrix that must be controlled with great care for avoiding classification errors. The methodology also suggests a suitable data partitioning approach for a GRID implementation of the described algorithm. The methodological indications were successfully verified by a case study belonging to the bioinformatics field. © 2008 Springer Berlin Heidelberg.File | Dimensione | Formato | |
---|---|---|---|
LNCS2008-discoveryscience.pdf
solo gestori archivio
Tipologia:
Versione Editoriale (PDF)
Licenza:
Non specificato
Dimensione
876.77 kB
Formato
Adobe PDF
|
876.77 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.