Finding similar users in social networks by using the depth-k skyline query

Sheng-Min Chiu, Yi-Chung Chen, Heng-Yi Su, Yu-Liang Hsu
{"title":"Finding similar users in social networks by using the depth-k skyline query","authors":"Sheng-Min Chiu, Yi-Chung Chen, Heng-Yi Su, Yu-Liang Hsu","doi":"10.1109/ICCE-TW.2015.7216833","DOIUrl":null,"url":null,"abstract":"Search algorithms designed to seek out similar users in social networking sites are a significant function of recommendation systems. Conventionally, such sub-algorithms consider all the dimensions of user data as a whole. However, as the information in various dimensions is generally independent, the conventional approaches may not be the best way to find similar users. This paper solves this problem by proposing an approach based on depth-k skyline queries that searches for similar users with multiple conditions. This paper also presented an algorithm to accelerate this process, the effectiveness of which was demonstrated in a simulation.","PeriodicalId":340402,"journal":{"name":"2015 IEEE International Conference on Consumer Electronics - Taiwan","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE International Conference on Consumer Electronics - Taiwan","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCE-TW.2015.7216833","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

Search algorithms designed to seek out similar users in social networking sites are a significant function of recommendation systems. Conventionally, such sub-algorithms consider all the dimensions of user data as a whole. However, as the information in various dimensions is generally independent, the conventional approaches may not be the best way to find similar users. This paper solves this problem by proposing an approach based on depth-k skyline queries that searches for similar users with multiple conditions. This paper also presented an algorithm to accelerate this process, the effectiveness of which was demonstrated in a simulation.
通过使用depth-k skyline查询在社交网络中查找相似的用户
在社交网站上寻找相似用户的搜索算法是推荐系统的一个重要功能。按照惯例,这些子算法将用户数据的所有维度作为一个整体来考虑。但是,由于各个维度的信息通常是独立的,因此传统方法可能不是查找相似用户的最佳方法。本文提出了一种基于深度k天际线查询的方法来解决这一问题,该方法可以搜索具有多个条件的相似用户。本文还提出了一种加速这一过程的算法,并通过仿真验证了该算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信