从在线数据库中提取学术社交网络

M. K. Nasution, S. Noah
{"title":"从在线数据库中提取学术社交网络","authors":"M. K. Nasution, S. Noah","doi":"10.1109/STAIR.2011.5995766","DOIUrl":null,"url":null,"abstract":"There has been quite a number of research efforts in extracting academic social network from on-line open sources such as the DBLP, ACM DL and IEEXplore. Extraction of such a network is usually based on the concept of co-occurrences. One of the issues in such efforts is actually involved extracting reliable and trusted network particularly when dealing with the heterogeneity of features in the Web. In this paper we demonstrate the use of association rule to enhance existing superficial method for extracting social network from online database such as the DBLP. The approach proposed has shown the capacity to extract social relation as well as the strength of these relations.","PeriodicalId":376671,"journal":{"name":"2011 International Conference on Semantic Technology and Information Retrieval","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"44","resultStr":"{\"title\":\"Extraction of academic social network from online database\",\"authors\":\"M. K. Nasution, S. Noah\",\"doi\":\"10.1109/STAIR.2011.5995766\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"There has been quite a number of research efforts in extracting academic social network from on-line open sources such as the DBLP, ACM DL and IEEXplore. Extraction of such a network is usually based on the concept of co-occurrences. One of the issues in such efforts is actually involved extracting reliable and trusted network particularly when dealing with the heterogeneity of features in the Web. In this paper we demonstrate the use of association rule to enhance existing superficial method for extracting social network from online database such as the DBLP. The approach proposed has shown the capacity to extract social relation as well as the strength of these relations.\",\"PeriodicalId\":376671,\"journal\":{\"name\":\"2011 International Conference on Semantic Technology and Information Retrieval\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-06-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"44\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 International Conference on Semantic Technology and Information Retrieval\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/STAIR.2011.5995766\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Semantic Technology and Information Retrieval","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/STAIR.2011.5995766","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 44

摘要

从在线开放资源(如DBLP、ACM DL和IEEXplore)中提取学术社交网络已经有相当多的研究工作。这种网络的提取通常基于共现的概念。这些工作中的一个问题实际上涉及到提取可靠和可信的网络,特别是在处理Web中特性的异构性时。在本文中,我们展示了使用关联规则来改进现有的从在线数据库(如DBLP)中提取社交网络的肤浅方法。所提出的方法显示了提取社会关系的能力以及这些关系的强度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Extraction of academic social network from online database
There has been quite a number of research efforts in extracting academic social network from on-line open sources such as the DBLP, ACM DL and IEEXplore. Extraction of such a network is usually based on the concept of co-occurrences. One of the issues in such efforts is actually involved extracting reliable and trusted network particularly when dealing with the heterogeneity of features in the Web. In this paper we demonstrate the use of association rule to enhance existing superficial method for extracting social network from online database such as the DBLP. The approach proposed has shown the capacity to extract social relation as well as the strength of these relations.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Word Sense Disambiguation by using domain knowledge Morphological analysis for rule based machine translation Measuring flow in gaming platforms Construction of topics and clusters in Topic Detection and Tracking tasks Phonetic coding methods for Malay names retrieval
×
引用
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