2005
DOI: 10.1155/jbb.2005.80
|View full text |Cite
|
Sign up to set email alerts
|

Functional Clustering Algorithm for High‐Dimensional Proteomics Data

Abstract: Clustering proteomics data is a challenging problem for any traditional clustering algorithm. Usually, the number of samples is largely smaller than the number of protein peaks. The use of a clustering algorithm which does not take into consideration the number of features of variables (here the number of peaks) is needed. An innovative hierarchical clustering algorithm may be a good approach. We propose here a new dissimilarity measure for the hierarchical clustering combined with a functional data analysis. … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
4
0

Year Published

2006
2006
2014
2014

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(4 citation statements)
references
References 18 publications
0
4
0
Order By: Relevance
“…These dimension reduction approaches can be modified to analyze and cluster high-dimensional protein profiles, although several statistical issues related to curve parameter estimation and longitudinal covariance modeling should be resolved [ 41 ]. In particular, when the number of proteins is largely smaller than the number of protein peaks, Bensmail et al proposed an alternative hierarchical clustering algorithm based on a dissimilarity measure combined with a functional data analysis [ 28 ]. This alternative can also allow functional smoothing of proteomics expression profiles or spectra.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…These dimension reduction approaches can be modified to analyze and cluster high-dimensional protein profiles, although several statistical issues related to curve parameter estimation and longitudinal covariance modeling should be resolved [ 41 ]. In particular, when the number of proteins is largely smaller than the number of protein peaks, Bensmail et al proposed an alternative hierarchical clustering algorithm based on a dissimilarity measure combined with a functional data analysis [ 28 ]. This alternative can also allow functional smoothing of proteomics expression profiles or spectra.…”
Section: Discussionmentioning
confidence: 99%
“…In addition, protein data have their unique feature, i.e., a protein may appear in a spectrum typically with thousands of peaks, leading to the number of samples largely smaller than the number of protein peaks. A variety of clustering approaches have been developed to handle such high-dimensional complexity of proteomics data [ 24 - 28 ]. The purpose of this article is to implement functional clustering into analysis and modeling of proteome dynamics.…”
Section: Introductionmentioning
confidence: 99%
“…Each serum sample was fractionated to increase the peak resolution in SELDI spectra and normalized peak information from each of the fractions merged into an input data matrix that included 48 samples and 168 feature (predictor) vectors. Such small datasets are often a reality in biomedical research, since obtaining large number of serum samples for many diseases can be difficult and expensive [38].…”
Section: Discussionmentioning
confidence: 99%
“…In this article, we focus on the nonsupervised task which consists in finding groups of individuals whose proteomic landscape is similar. Surprisingly the clustering task received less attention, and is mainly based on hierarchical clustering on the set of peaks detected across spectra (Bensmail et al ; Morris et al ). However, such method is known to depend heavily on the peak detection method and has the strong disadvantage to neglect the interindividual variability whereas this information should be central for subgroup discovery.…”
Section: Introductionmentioning
confidence: 99%