用分割聚类方法检测蛋白质定位位点的异常值

P. Ashok, G. M. Kadhar Nawaz, K. Thangavel, E. Elayaraja
{"title":"用分割聚类方法检测蛋白质定位位点的异常值","authors":"P. Ashok, G. M. Kadhar Nawaz, K. Thangavel, E. Elayaraja","doi":"10.1109/ICPRIME.2013.6496519","DOIUrl":null,"url":null,"abstract":"A large molecule composed of one or more chains of amino acids in a specific order, the order is determined by the base sequence of nucleotides in the gene that codes for the protein. Proteins are required for the structure, function, and regulation of the body's cells, tissues, and organs and each protein has unique functions. Localization sites of proteins are identified by the mechanism and moved to its corresponding organelles. In this paper, we introduce the method clustering and its type's K-Means and K-Medoids. The clustering algorithms are improved by implementing the two initial centroid selection methods instead of selecting centroid randomly. K-Means algorithm can be improved by implementing the initial cluster centroids are selected by the two proposed algorithms instead of selecting centroids randomly, which is compared by using Davie Bouldin index measure, hence the proposed algorithm1 overcomes the drawbacks of selecting initial cluster centers then other methods. In the yeast dataset, the defective proteins (objects) are considered as outliers, which are identified by the clustering methods with ADOC (Average Distance between Object and Centroid) function. The outlier's detection method and performance analysis method are studied and compared, the experimental results shows that the K-Medoids method performs well when compare with the K-Means clustering.","PeriodicalId":123210,"journal":{"name":"2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Outliers detection on protein localization sites by partitional clustering methods\",\"authors\":\"P. Ashok, G. M. Kadhar Nawaz, K. Thangavel, E. Elayaraja\",\"doi\":\"10.1109/ICPRIME.2013.6496519\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A large molecule composed of one or more chains of amino acids in a specific order, the order is determined by the base sequence of nucleotides in the gene that codes for the protein. Proteins are required for the structure, function, and regulation of the body's cells, tissues, and organs and each protein has unique functions. Localization sites of proteins are identified by the mechanism and moved to its corresponding organelles. In this paper, we introduce the method clustering and its type's K-Means and K-Medoids. The clustering algorithms are improved by implementing the two initial centroid selection methods instead of selecting centroid randomly. K-Means algorithm can be improved by implementing the initial cluster centroids are selected by the two proposed algorithms instead of selecting centroids randomly, which is compared by using Davie Bouldin index measure, hence the proposed algorithm1 overcomes the drawbacks of selecting initial cluster centers then other methods. In the yeast dataset, the defective proteins (objects) are considered as outliers, which are identified by the clustering methods with ADOC (Average Distance between Object and Centroid) function. The outlier's detection method and performance analysis method are studied and compared, the experimental results shows that the K-Medoids method performs well when compare with the K-Means clustering.\",\"PeriodicalId\":123210,\"journal\":{\"name\":\"2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-04-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPRIME.2013.6496519\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPRIME.2013.6496519","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

一种由一条或多条氨基酸链按特定顺序组成的大分子,其顺序由编码蛋白质的基因中核苷酸的碱基序列决定。蛋白质是人体细胞、组织和器官的结构、功能和调节所必需的,每种蛋白质都有独特的功能。蛋白质的定位位点通过该机制被识别并移动到相应的细胞器上。本文介绍了聚类方法及其K-Means和k - medium类型。通过实现两种初始质心选择方法来改进聚类算法,而不是随机选择质心。K-Means算法可以通过实现由两种算法选择初始聚类质心而不是随机选择质心来改进K-Means算法,并通过Davie Bouldin指数度量进行比较,从而克服了K-Means算法选择初始聚类质心的缺点。在酵母数据集中,将缺陷蛋白(对象)视为离群值,采用ADOC(对象与质心之间的平均距离)函数聚类方法对其进行识别。对离群点检测方法和性能分析方法进行了研究和比较,实验结果表明,与K-Means聚类方法相比,K-Medoids方法具有较好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Outliers detection on protein localization sites by partitional clustering methods
A large molecule composed of one or more chains of amino acids in a specific order, the order is determined by the base sequence of nucleotides in the gene that codes for the protein. Proteins are required for the structure, function, and regulation of the body's cells, tissues, and organs and each protein has unique functions. Localization sites of proteins are identified by the mechanism and moved to its corresponding organelles. In this paper, we introduce the method clustering and its type's K-Means and K-Medoids. The clustering algorithms are improved by implementing the two initial centroid selection methods instead of selecting centroid randomly. K-Means algorithm can be improved by implementing the initial cluster centroids are selected by the two proposed algorithms instead of selecting centroids randomly, which is compared by using Davie Bouldin index measure, hence the proposed algorithm1 overcomes the drawbacks of selecting initial cluster centers then other methods. In the yeast dataset, the defective proteins (objects) are considered as outliers, which are identified by the clustering methods with ADOC (Average Distance between Object and Centroid) function. The outlier's detection method and performance analysis method are studied and compared, the experimental results shows that the K-Medoids method performs well when compare with the K-Means clustering.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Separable reversible data hiding using Rc4 algorithm Personal approach for mobile search: A review Bijective soft set based classification of medical data Deployment and power assignment problem in Wireless Sensor Networks for intruder detection application using MEA Protein sequence motif patterns using adaptive Fuzzy C-Means granular computing model
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1