异构信息网络中标签共现关系预测

Jinpeng Chen, H. Gao, Zhenyu Wu, Deyi Li
{"title":"异构信息网络中标签共现关系预测","authors":"Jinpeng Chen, H. Gao, Zhenyu Wu, Deyi Li","doi":"10.1109/ICPADS.2013.95","DOIUrl":null,"url":null,"abstract":"In this work, we address a novel problem about tag co-occurrence relationship prediction across heterogeneous networks. Although tag co-occurrence has recently become a hot research topic, many studies mainly focus on how to produce the personalized recommendation leveraging the tag co-occurrence relationship and most of them are considered in a homogeneous network. So far, few studies pay attention to how to predict tag co-occurrence relationship across heterogeneous networks. In order to solve the aforementioned problem, we propose a novel two-step prediction approach. First, weight path-based topological features are systematically extracted from the network. Then, a supervised model is used to learn the best weights associated with different topological features in deciding the co-occurrence relationships. Experiments are performed on real-world dataset, the Flickr network, with comprehensive measurements. Experimental results demonstrate that weight path-based heterogeneous topological features have substantial advantages over commonly used link prediction approaches in predicting co-occurrence relations in information networks.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Tag Co-occurrence Relationship Prediction in Heterogeneous Information Networks\",\"authors\":\"Jinpeng Chen, H. Gao, Zhenyu Wu, Deyi Li\",\"doi\":\"10.1109/ICPADS.2013.95\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this work, we address a novel problem about tag co-occurrence relationship prediction across heterogeneous networks. Although tag co-occurrence has recently become a hot research topic, many studies mainly focus on how to produce the personalized recommendation leveraging the tag co-occurrence relationship and most of them are considered in a homogeneous network. So far, few studies pay attention to how to predict tag co-occurrence relationship across heterogeneous networks. In order to solve the aforementioned problem, we propose a novel two-step prediction approach. First, weight path-based topological features are systematically extracted from the network. Then, a supervised model is used to learn the best weights associated with different topological features in deciding the co-occurrence relationships. Experiments are performed on real-world dataset, the Flickr network, with comprehensive measurements. Experimental results demonstrate that weight path-based heterogeneous topological features have substantial advantages over commonly used link prediction approaches in predicting co-occurrence relations in information networks.\",\"PeriodicalId\":160979,\"journal\":{\"name\":\"2013 International Conference on Parallel and Distributed Systems\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 International Conference on Parallel and Distributed Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPADS.2013.95\",\"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 Parallel and Distributed Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPADS.2013.95","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

摘要

在这项工作中,我们解决了一个关于跨异构网络的标签共现关系预测的新问题。虽然标签共现是近年来的一个研究热点,但许多研究主要集中在如何利用标签共现关系产生个性化推荐上,而且大多数研究都是在同质网络中进行考虑的。到目前为止,很少有研究关注如何预测跨异构网络的标签共现关系。为了解决上述问题,我们提出了一种新的两步预测方法。首先,系统地从网络中提取基于权重路径的拓扑特征;然后,使用监督模型来学习与不同拓扑特征相关联的最佳权值来确定共现关系。实验是在真实世界的数据集,Flickr网络上进行的,并进行了全面的测量。实验结果表明,基于权重路径的异构拓扑特征在预测信息网络共现关系方面比常用的链路预测方法具有显著的优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Tag Co-occurrence Relationship Prediction in Heterogeneous Information Networks
In this work, we address a novel problem about tag co-occurrence relationship prediction across heterogeneous networks. Although tag co-occurrence has recently become a hot research topic, many studies mainly focus on how to produce the personalized recommendation leveraging the tag co-occurrence relationship and most of them are considered in a homogeneous network. So far, few studies pay attention to how to predict tag co-occurrence relationship across heterogeneous networks. In order to solve the aforementioned problem, we propose a novel two-step prediction approach. First, weight path-based topological features are systematically extracted from the network. Then, a supervised model is used to learn the best weights associated with different topological features in deciding the co-occurrence relationships. Experiments are performed on real-world dataset, the Flickr network, with comprehensive measurements. Experimental results demonstrate that weight path-based heterogeneous topological features have substantial advantages over commonly used link prediction approaches in predicting co-occurrence relations in information networks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信