1. NCCU Academic Hub
  2. 學術產出
  3. College of Informatics
  4. Periodical Articles
  5. Item

學術產出-Periodical Articles

Article View/Open

Publication Export

Google ScholarTM

政大圖書館

Citation Infomation

題名 Efficient and Interpretable Prediction of Protein Functional Classes by Correspondence Analysis and Compact Set Relations
作者 Chang, J.-M.
張家銘
Su, E.C.-Y.
Notredame, C.
Tang, C.Y.
Hsu, W.-L.
Sung, T.-Y.
Erb, I.
Taly, J.-F.
貢獻者 資科系
日期 2013-10
上傳時間 27-Apr-2016 15:30:42 (UTC+8)
摘要 Predicting protein functional classes such as localization sites and modifications plays a crucial role in function annotation. Given a tremendous amount of sequence data yielded from high-throughput sequencing experiments, the need of efficient and interpretable prediction strategies has been rapidly amplified. Our previous approach for subcellular localization prediction, PSLDoc, archives high overall accuracy for Gram-negative bacteria. However, PSLDoc is computational intensive due to incorporation of homology extension in feature extraction and probabilistic latent semantic analysis in feature reduction. Besides, prediction results generated by support vector machines are accurate but generally difficult to interpret. In this work, we incorporate three new techniques to improve efficiency and interpretability. First, homology extension is performed against a compact non-redundant database using a fast search model to reduce running time. Second, correspondence analysis (CA) is incorporated as an efficient feature reduction to generate a clear visual separation of different protein classes. Finally, functional classes are predicted by a combination of accurate compact set (CS) relation and interpretable one-nearest neighbor (1-NN) algorithm. Besides localization data sets, we also apply a human protein kinase set to validate generality of our proposed method. Experiment results demonstrate that our method make accurate prediction in a more efficient and interpretable manner. First, homology extension using a fast search on a compact database can greatly accelerate traditional running time up to twenty-five times faster without sacrificing prediction performance. This suggests that computational costs of many other predictors that also incorporate homology information can be largely reduced. In addition, CA can not only efficiently identify discriminative features but also provide a clear visualization of different functional classes. Moreover, predictions based on CS achieve 100% precision. When combined with 1-NN on unpredicted targets by CS, our method attains slightly better or comparable performance compared with the state-of-the-art systems.
關聯 PLoS One, 8(10), e75542, 1-11
資料類型 article
DOI http://dx.doi.org/10.1371/journal.pone.0075542
dc.contributor 資科系-
dc.creator (作者) Chang, J.-M.-
dc.creator (作者) 張家銘zh_TW
dc.creator (作者) Su, E.C.-Y.en_US
dc.creator (作者) Notredame, C.en_US
dc.creator (作者) Tang, C.Y.en_US
dc.creator (作者) Hsu, W.-L.en_US
dc.creator (作者) Sung, T.-Y.en_US
dc.creator (作者) Erb, I.en_US
dc.creator (作者) Taly, J.-F.en_US
dc.date (日期) 2013-10-
dc.date.accessioned 27-Apr-2016 15:30:42 (UTC+8)-
dc.date.available 27-Apr-2016 15:30:42 (UTC+8)-
dc.date.issued (上傳時間) 27-Apr-2016 15:30:42 (UTC+8)-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/86642-
dc.description.abstract (摘要) Predicting protein functional classes such as localization sites and modifications plays a crucial role in function annotation. Given a tremendous amount of sequence data yielded from high-throughput sequencing experiments, the need of efficient and interpretable prediction strategies has been rapidly amplified. Our previous approach for subcellular localization prediction, PSLDoc, archives high overall accuracy for Gram-negative bacteria. However, PSLDoc is computational intensive due to incorporation of homology extension in feature extraction and probabilistic latent semantic analysis in feature reduction. Besides, prediction results generated by support vector machines are accurate but generally difficult to interpret. In this work, we incorporate three new techniques to improve efficiency and interpretability. First, homology extension is performed against a compact non-redundant database using a fast search model to reduce running time. Second, correspondence analysis (CA) is incorporated as an efficient feature reduction to generate a clear visual separation of different protein classes. Finally, functional classes are predicted by a combination of accurate compact set (CS) relation and interpretable one-nearest neighbor (1-NN) algorithm. Besides localization data sets, we also apply a human protein kinase set to validate generality of our proposed method. Experiment results demonstrate that our method make accurate prediction in a more efficient and interpretable manner. First, homology extension using a fast search on a compact database can greatly accelerate traditional running time up to twenty-five times faster without sacrificing prediction performance. This suggests that computational costs of many other predictors that also incorporate homology information can be largely reduced. In addition, CA can not only efficiently identify discriminative features but also provide a clear visualization of different functional classes. Moreover, predictions based on CS achieve 100% precision. When combined with 1-NN on unpredicted targets by CS, our method attains slightly better or comparable performance compared with the state-of-the-art systems.-
dc.format.extent 1042068 bytes-
dc.format.mimetype application/pdf-
dc.relation (關聯) PLoS One, 8(10), e75542, 1-11-
dc.title (題名) Efficient and Interpretable Prediction of Protein Functional Classes by Correspondence Analysis and Compact Set Relations-
dc.type (資料類型) article-
dc.identifier.doi (DOI) 10.1371/journal.pone.0075542-
dc.doi.uri (DOI) http://dx.doi.org/10.1371/journal.pone.0075542-