基于合作作者网络的作者偏好主题预测

H. N. Le, P. D. Khoa, P. Do
{"title":"基于合作作者网络的作者偏好主题预测","authors":"H. N. Le, P. D. Khoa, P. Do","doi":"10.1109/RIVF.2013.6719869","DOIUrl":null,"url":null,"abstract":"This paper focuses a common question in Social Network Analysis - evaluating how much a person prefers or non-prefers a specific issue. To realize this problem, we use the ILPnet2 database and model it as a co-authorship network in which the graph's nodes represent the authors and the links between two nodes means the two corresponding authors have some common papers. And what we have to do is predicting the preferred topics of authors in this network. Based on the original algorithm in [8], we propose a general algorithm with some basic assumptions and definitions and apply it to solve our problem. Finally, we use the ROC Analysis and Regression Estimation model to evaluate the Degree of Accuracy of the algorithm.","PeriodicalId":121216,"journal":{"name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Predicting preferred topics of authors based on co-authorship network\",\"authors\":\"H. N. Le, P. D. Khoa, P. Do\",\"doi\":\"10.1109/RIVF.2013.6719869\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper focuses a common question in Social Network Analysis - evaluating how much a person prefers or non-prefers a specific issue. To realize this problem, we use the ILPnet2 database and model it as a co-authorship network in which the graph's nodes represent the authors and the links between two nodes means the two corresponding authors have some common papers. And what we have to do is predicting the preferred topics of authors in this network. Based on the original algorithm in [8], we propose a general algorithm with some basic assumptions and definitions and apply it to solve our problem. Finally, we use the ROC Analysis and Regression Estimation model to evaluate the Degree of Accuracy of the algorithm.\",\"PeriodicalId\":121216,\"journal\":{\"name\":\"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RIVF.2013.6719869\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RIVF.2013.6719869","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

本文关注社会网络分析中的一个常见问题-评估一个人对特定问题的偏好或不偏好程度。为了解决这个问题,我们使用ILPnet2数据库,并将其建模为一个合著网络,其中图的节点代表作者,两个节点之间的链接意味着两个对应的作者有一些共同的论文。我们要做的是预测这个网络中作者的首选主题。在文献[8]原始算法的基础上,我们提出了一种具有一些基本假设和定义的通用算法,并将其应用于解决我们的问题。最后,我们使用ROC分析和回归估计模型来评估算法的准确性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Predicting preferred topics of authors based on co-authorship network
This paper focuses a common question in Social Network Analysis - evaluating how much a person prefers or non-prefers a specific issue. To realize this problem, we use the ILPnet2 database and model it as a co-authorship network in which the graph's nodes represent the authors and the links between two nodes means the two corresponding authors have some common papers. And what we have to do is predicting the preferred topics of authors in this network. Based on the original algorithm in [8], we propose a general algorithm with some basic assumptions and definitions and apply it to solve our problem. Finally, we use the ROC Analysis and Regression Estimation model to evaluate the Degree of Accuracy of the algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信