2010
DOI: 10.2174/092986610791190255
|View full text |Cite
|
Sign up to set email alerts
|

Using Affinity Propagation Combined Post-Processing to Cluster Protein Sequences

Abstract: The sizes of the protein databases are growing rapidly nowadays thus clustering protein sequences based only on sequence information becomes increasingly important. In this paper, we analyze the limitation of Affinity propagation (AP) algorithm when clustering a dataset generated randomly. Then we propose a post-processing method to improve the AP algorithm. This method uses the median of the input similarities as the shared preference value, and then employs post-processing phase combined mergence and reassig… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2011
2011
2021
2021

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 11 publications
(4 citation statements)
references
References 0 publications
0
4
0
Order By: Relevance
“…Affinity propagation is used in the clustering of microarray and gene expression data [154][155][156] and in sequence analysis [157]. Its versatility beyond bioinformatics [158], especially in natural language processing (NLP) [159][160][161] and computer vision [162,163], suggests that this article's mathematically modest clustering exercise can benefit from interdisciplinary cross-pollination.…”
Section: Clustering Through Affinity Propagationmentioning
confidence: 99%
“…Affinity propagation is used in the clustering of microarray and gene expression data [154][155][156] and in sequence analysis [157]. Its versatility beyond bioinformatics [158], especially in natural language processing (NLP) [159][160][161] and computer vision [162,163], suggests that this article's mathematically modest clustering exercise can benefit from interdisciplinary cross-pollination.…”
Section: Clustering Through Affinity Propagationmentioning
confidence: 99%
“…It has been proved that APC is a fast clustering algorithm especially in the case of a large number of samples, and has several advantages on speed, general applicability and good performance (Bodenhofer et al , 2011). So far, APC has been used successfully for microarray/gene expression data clustering (Frey and Dueck, 2007), sequence analysis (Yang et al , 2010), text clustering (Guan et al , 2010), data stream clustering (Zhang et al , 2013), vehicular ad hoc networks clustering (Hassanabadi et al , 2014), among others. Especially, for large data sets, APC offers obvious advantages over existing methods (e.g.…”
Section: Testings On a Private Carmentioning
confidence: 99%
“…As outlined by Bodenhofer et al [81], AP is especially appropriate for bioinformatics purposes because: (i) numerous similarity scales applied in bioinformatics are not associated with explicit vectorial features; and (ii) detecting a small set of clusters can offer the opportunity for exploration in biological datasets. So far, AP algorithm has been demonstrated to be effective for the purpose of for microarray data analysis [80][81][82][83][84][85], Network analysis [86][87][88] structural biology studies [89][90][91], and sequence analysis [92]. For review, see [81].…”
Section: Clusteringmentioning
confidence: 99%