• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

从在线系统中提取信息骨干。

Extracting the information backbone in online system.

机构信息

Web Sciences Center, School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, Sichuan, PR China.

出版信息

PLoS One. 2013 May 14;8(5):e62624. doi: 10.1371/journal.pone.0062624. Print 2013.

DOI:10.1371/journal.pone.0062624
PMID:23690946
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC3653959/
Abstract

Information overload is a serious problem in modern society and many solutions such as recommender system have been proposed to filter out irrelevant information. In the literature, researchers have been mainly dedicated to improving the recommendation performance (accuracy and diversity) of the algorithms while they have overlooked the influence of topology of the online user-object bipartite networks. In this paper, we find that some information provided by the bipartite networks is not only redundant but also misleading. With such "less can be more" feature, we design some algorithms to improve the recommendation performance by eliminating some links from the original networks. Moreover, we propose a hybrid method combining the time-aware and topology-aware link removal algorithms to extract the backbone which contains the essential information for the recommender systems. From the practical point of view, our method can improve the performance and reduce the computational time of the recommendation system, thus improving both of their effectiveness and efficiency.

摘要

信息过载是现代社会的一个严重问题,已经提出了许多解决方案,如推荐系统,以过滤掉不相关的信息。在文献中,研究人员主要致力于提高算法的推荐性能(准确性和多样性),而忽略了在线用户-对象二分网络拓扑结构的影响。在本文中,我们发现二分网络提供的一些信息不仅是冗余的,而且具有误导性。具有这种“少即是多”的特点,我们设计了一些算法通过从原始网络中删除一些链接来提高推荐性能。此外,我们提出了一种结合时间感知和拓扑感知链路删除算法的混合方法,以提取包含推荐系统基本信息的骨干网络。从实际的角度来看,我们的方法可以提高推荐系统的性能并减少计算时间,从而提高其有效性和效率。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b4d7/3653959/f012105710e3/pone.0062624.g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b4d7/3653959/e77bca46f9d6/pone.0062624.g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b4d7/3653959/5931b21afab3/pone.0062624.g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b4d7/3653959/f012105710e3/pone.0062624.g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b4d7/3653959/e77bca46f9d6/pone.0062624.g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b4d7/3653959/5931b21afab3/pone.0062624.g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b4d7/3653959/f012105710e3/pone.0062624.g003.jpg

相似文献

1
Extracting the information backbone in online system.从在线系统中提取信息骨干。
PLoS One. 2013 May 14;8(5):e62624. doi: 10.1371/journal.pone.0062624. Print 2013.
2
Uncovering the essential links in online commercial networks.揭示在线商业网络中的关键联系。
Sci Rep. 2016 Sep 29;6:34292. doi: 10.1038/srep34292.
3
Information filtering in sparse online systems: recommendation via semi-local diffusion.稀疏在线系统中的信息过滤:基于半局部扩散的推荐。
PLoS One. 2013 Nov 18;8(11):e79354. doi: 10.1371/journal.pone.0079354. eCollection 2013.
4
Information Filtering via Heterogeneous Diffusion in Online Bipartite Networks.在线二分网络中基于异构扩散的信息过滤
PLoS One. 2015 Jun 30;10(6):e0129459. doi: 10.1371/journal.pone.0129459. eCollection 2015.
5
Optimizing online social networks for information propagation.优化在线社交网络以促进信息传播。
PLoS One. 2014 May 9;9(5):e96614. doi: 10.1371/journal.pone.0096614. eCollection 2014.
6
Enhancing the robustness of recommender systems against spammers.增强推荐系统抵御垃圾信息发送者的鲁棒性。
PLoS One. 2018 Nov 1;13(11):e0206458. doi: 10.1371/journal.pone.0206458. eCollection 2018.
7
Uncovering the information core in recommender systems.揭示推荐系统中的信息核心。
Sci Rep. 2014 Aug 21;4:6140. doi: 10.1038/srep06140.
8
Similarity from multi-dimensional scaling: solving the accuracy and diversity dilemma in information filtering.多维缩放中的相似性:解决信息过滤中的准确性和多样性困境
PLoS One. 2014 Oct 24;9(10):e111005. doi: 10.1371/journal.pone.0111005. eCollection 2014.
9
Novel online Recommendation algorithm for Massive Open Online Courses (NoR-MOOCs).大规模在线开放课程(MOOCs)新型在线推荐算法(NoR-MOOCs)。
PLoS One. 2021 Jan 22;16(1):e0245485. doi: 10.1371/journal.pone.0245485. eCollection 2021.
10
The power of ground user in recommender systems.推荐系统中的用户影响力。
PLoS One. 2013 Aug 2;8(8):e70094. doi: 10.1371/journal.pone.0070094. Print 2013.

引用本文的文献

1
Personalized Sliding Window Recommendation Algorithm Based on Sequence Alignment.基于序列比对的个性化滑动窗口推荐算法
Entropy (Basel). 2022 Nov 15;24(11):1662. doi: 10.3390/e24111662.
2
Network-Based Driving Force of National Economic Development: A Social Capital Perspective.基于网络的国民经济发展驱动力:社会资本视角
Entropy (Basel). 2021 Sep 29;23(10):1276. doi: 10.3390/e23101276.
3
Extracting backbones in weighted modular complex networks.加权模块化复杂网络中的骨干提取。

本文引用的文献

1
Solving the apparent diversity-accuracy dilemma of recommender systems.解决推荐系统中明显的多样性-准确性困境。
Proc Natl Acad Sci U S A. 2010 Mar 9;107(10):4511-5. doi: 10.1073/pnas.1000488107. Epub 2010 Feb 22.
2
Extracting the multiscale backbone of complex weighted networks.提取复杂加权网络的多尺度骨干
Proc Natl Acad Sci U S A. 2009 Apr 21;106(16):6483-8. doi: 10.1073/pnas.0808904106. Epub 2009 Apr 8.
3
Rewiring networks for synchronization.重新布线网络以实现同步。
Sci Rep. 2020 Sep 23;10(1):15539. doi: 10.1038/s41598-020-71876-0.
4
Extracting h-Backbone as a Core Structure in Weighted Networks.从加权网络中提取 h-骨干作为核心结构。
Sci Rep. 2018 Sep 25;8(1):14356. doi: 10.1038/s41598-018-32430-1.
5
Identifying the perceptive users for online social systems.识别在线社交系统的感知用户。
PLoS One. 2017 Jul 13;12(7):e0178118. doi: 10.1371/journal.pone.0178118. eCollection 2017.
6
Uncovering the essential links in online commercial networks.揭示在线商业网络中的关键联系。
Sci Rep. 2016 Sep 29;6:34292. doi: 10.1038/srep34292.
7
Walking on a user similarity network towards personalized recommendations.在用户相似性网络上迈向个性化推荐。
PLoS One. 2014 Dec 9;9(12):e114662. doi: 10.1371/journal.pone.0114662. eCollection 2014.
8
Promoting cold-start items in recommender systems.在推荐系统中推广冷启动项目。
PLoS One. 2014 Dec 5;9(12):e113457. doi: 10.1371/journal.pone.0113457. eCollection 2014.
9
Ranking reputation and quality in online rating systems.在线评分系统中的排名声誉与质量
PLoS One. 2014 May 12;9(5):e97146. doi: 10.1371/journal.pone.0097146. eCollection 2014.
10
Information filtering in sparse online systems: recommendation via semi-local diffusion.稀疏在线系统中的信息过滤:基于半局部扩散的推荐。
PLoS One. 2013 Nov 18;8(11):e79354. doi: 10.1371/journal.pone.0079354. eCollection 2013.
Chaos. 2008 Sep;18(3):037105. doi: 10.1063/1.2975842.
4
Heat conduction process on community networks as a recommendation model.作为一种推荐模型的社区网络上的热传导过程
Phys Rev Lett. 2007 Oct 12;99(15):154301. doi: 10.1103/PhysRevLett.99.154301. Epub 2007 Oct 10.
5
Bipartite network projection and personal recommendation.二分网络投影与个性化推荐。
Phys Rev E Stat Nonlin Soft Matter Phys. 2007 Oct;76(4 Pt 2):046115. doi: 10.1103/PhysRevE.76.046115. Epub 2007 Oct 25.
6
Synchronization is optimal in nondiagonalizable networks.在不可对角化网络中,同步是最优的。
Phys Rev E Stat Nonlin Soft Matter Phys. 2006 Jun;73(6 Pt 2):065106. doi: 10.1103/PhysRevE.73.065106. Epub 2006 Jun 28.
7
Transport in weighted networks: partition into superhighways and roads.加权网络中的传输:划分为超级高速公路和道路。
Phys Rev Lett. 2006 Apr 14;96(14):148702. doi: 10.1103/PhysRevLett.96.148702. Epub 2006 Apr 13.
8
Cycles and clustering in bipartite networks.二分网络中的循环与聚类
Phys Rev E Stat Nonlin Soft Matter Phys. 2005 Nov;72(5 Pt 2):056127. doi: 10.1103/PhysRevE.72.056127. Epub 2005 Nov 22.
9
Scale-free trees: the skeletons of complex networks.无标度树:复杂网络的骨架
Phys Rev E Stat Nonlin Soft Matter Phys. 2004 Oct;70(4 Pt 2):046126. doi: 10.1103/PhysRevE.70.046126. Epub 2004 Oct 28.
10
Assortative mixing in networks.网络中的选择性混合。
Phys Rev Lett. 2002 Nov 11;89(20):208701. doi: 10.1103/PhysRevLett.89.208701. Epub 2002 Oct 28.