检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李鹏 闵慧[4] 罗爱静 LI Peng;MIN Hui;LUO Ai-jing(The Third Xiangya Hospital of Central South University,Changsha,Hunan 410013,China;School of Informatics,Hunan University of Chinese Medicine,Changsha,Hunan 410208,China;Key Laboratory of Medical Information Research(CSU),College of Hunan Province,Changsha,Hunan 410006,China;Software Department,Hunan College of Information,Changsha,Hunan 410200,China)
机构地区:[1]中南大学湘雅三医院,湖南长沙410013 [2]湖南中医药大学信息科学与工程学院,湖南长沙410208 [3]医学信息研究湖南省普通高等学校重点实验室(中南大学),湖南长沙410006 [4]湖南信息职业技术学院软件学院,湖南长沙410200
出 处:《电子学报》2021年第8期1489-1497,共9页Acta Electronica Sinica
基 金:国家社会科学基金重点项目(No.17AZD037);国家重点研发计划(No.2017YFC1703306);湖南省卫生健康委科研项目(No.202112072217);湖南自然科学基金青年项目(No.2019JJ50453);湖南自然科学基金面上项目(No.2018JJ2301);湖南省科技厅重点项目(No.2018JJ2301);湖南省教育厅一般项目(No.19C1318)。
摘 要:动态蛋白质网络的构建和复合物挖掘问题是目前研究的热点.针对现有的算法在解决前述问题上的不足,文中考虑了蛋白质的活性周期和连接强度,首先提出了一种基于动态图的蛋白质网络构建算法.然后基于密度聚类设计了一种在动态蛋白质网络上挖掘复合物的算法(PCMA).整个挖掘过程包含三个步骤:基于DBSCAN(Density-Based Spatial Clustering of Applications with Noise)算法的蛋白质复合物生成;基于合并增益的蛋白质复合物合并和基于归属度的复合物调整.在多个公开的生物数据集上进行了实验,实验结果表明,所提算法在查全率、查准率和F-measure方面的性能都要优于现有的算法,且对输入参数不敏感.在保证蛋白质复合物挖掘准确性的前提下,算法的时间复杂度处于一个合理的范围之内.Dynamic protein network construction and complex mining problem is a hot topic.In view of the shortcomings of existing algorithms in solving the above problems,a protein network construction algorithm based on dynamic graph is firstly proposed by considering the active period and the connection strength of proteins in this paper.Then,a protein complex mining algorithm(PCMA)on dynamic protein network is designed based on the density clustering.The whole mining process consists of three steps:the generation of protein complex based on DBSCAN(density-based spatial clustering of applications with noise)algorithm;the combination of protein complex based on the combination gain and the adjustment of protein complex based on the degree of membership.Experiments are carried out on several open biological datasets.The experimental results show that the performance of the proposed algorithm is better than that of the existing algorithms in terms of recall,precision and F-measure,and it is not sensitive to the input parameters.On the premise of ensuring the accuracy of protein complex mining,the time complexity of the proposed algorithm is in a reasonable range.
关 键 词:动态蛋白质网络 蛋白质复合物 动态图 密度聚类 查全率 查准率 时间复杂度
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.33