丁丁:利用目标特征进行信令网络相似性计算和排序

Huey-Eng Chua, S. Bhowmick, L. Tucker-Kellogg
{"title":"丁丁:利用目标特征进行信令网络相似性计算和排序","authors":"Huey-Eng Chua, S. Bhowmick, L. Tucker-Kellogg","doi":"10.1145/3107411.3107470","DOIUrl":null,"url":null,"abstract":"Network similarity ranking attempts to rank a given set of networks based on its \"similarity\" to a reference network. State-of-the-art approaches tend to be general in the sense that they can be applied to networks in a variety of domains. Consequently, they are not designed to exploit domain-specific knowledge to find similar networks although such knowledge may yield interesting insights that are unique to specific problems, paving the way to solutions that are more effective. We propose Tintin which uses a novel target feature-based network similarity distance for ranking similar signaling networks. In contrast to state-of-the-art network similarity techniques, Tintin considers both topological and dynamic features in order to compute network similarity. Our empirical study on signaling networks from BioModels with real-world curated outcomes reveals that Tintin ranking is different from state-of-the-art approaches.","PeriodicalId":246388,"journal":{"name":"Proceedings of the 8th ACM International Conference on Bioinformatics, Computational Biology,and Health Informatics","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"TINTIN: Exploiting Target Features for Signaling Network Similarity Computation and Ranking\",\"authors\":\"Huey-Eng Chua, S. Bhowmick, L. Tucker-Kellogg\",\"doi\":\"10.1145/3107411.3107470\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Network similarity ranking attempts to rank a given set of networks based on its \\\"similarity\\\" to a reference network. State-of-the-art approaches tend to be general in the sense that they can be applied to networks in a variety of domains. Consequently, they are not designed to exploit domain-specific knowledge to find similar networks although such knowledge may yield interesting insights that are unique to specific problems, paving the way to solutions that are more effective. We propose Tintin which uses a novel target feature-based network similarity distance for ranking similar signaling networks. In contrast to state-of-the-art network similarity techniques, Tintin considers both topological and dynamic features in order to compute network similarity. Our empirical study on signaling networks from BioModels with real-world curated outcomes reveals that Tintin ranking is different from state-of-the-art approaches.\",\"PeriodicalId\":246388,\"journal\":{\"name\":\"Proceedings of the 8th ACM International Conference on Bioinformatics, Computational Biology,and Health Informatics\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-08-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 8th ACM International Conference on Bioinformatics, Computational Biology,and Health Informatics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3107411.3107470\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 8th ACM International Conference on Bioinformatics, Computational Biology,and Health Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3107411.3107470","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

网络相似度排序是根据网络与参考网络的“相似度”对一组给定网络进行排序。最先进的方法往往是通用的,因为它们可以应用于各种领域的网络。因此,它们不是为了利用特定领域的知识来找到类似的网络而设计的,尽管这些知识可能会产生针对特定问题的独特的有趣见解,从而为更有效的解决方案铺平道路。我们提出了丁丁,它使用一种新的基于目标特征的网络相似距离来对相似的信令网络进行排序。与最先进的网络相似度技术相比,丁丁同时考虑拓扑和动态特征来计算网络相似度。我们对具有现实世界策划结果的生物模型信号网络的实证研究表明,丁丁排名不同于最先进的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
TINTIN: Exploiting Target Features for Signaling Network Similarity Computation and Ranking
Network similarity ranking attempts to rank a given set of networks based on its "similarity" to a reference network. State-of-the-art approaches tend to be general in the sense that they can be applied to networks in a variety of domains. Consequently, they are not designed to exploit domain-specific knowledge to find similar networks although such knowledge may yield interesting insights that are unique to specific problems, paving the way to solutions that are more effective. We propose Tintin which uses a novel target feature-based network similarity distance for ranking similar signaling networks. In contrast to state-of-the-art network similarity techniques, Tintin considers both topological and dynamic features in order to compute network similarity. Our empirical study on signaling networks from BioModels with real-world curated outcomes reveals that Tintin ranking is different from state-of-the-art approaches.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Mapping Free Text into MedDRA by Natural Language Processing: A Modular Approach in Designing and Evaluating Software Extensions Evolving Conformation Paths to Model Protein Structural Transitions Supervised Machine Learning Approaches Predict and Characterize Nanomaterial Exposures: MWCNT Markers in Lung Lavage Fluid. Geometry Analysis for Protein Secondary Structures Matching Problem Geometric Sampling Framework for Exploring Molecular Walker Energetics and Dynamics
×
引用
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