Finding Compatible People on Social Networking Sites, a Semantic Technology Approach

A. Kazemi, M. Nematbakhsh
{"title":"Finding Compatible People on Social Networking Sites, a Semantic Technology Approach","authors":"A. Kazemi, M. Nematbakhsh","doi":"10.1109/ISMS.2011.54","DOIUrl":null,"url":null,"abstract":"the significant feature of a social networking website is the primary reason they are made for: connecting people and friends via internet. “Friend recommender systems” are wisely designed for finding people, most of whom tend to be with the same interests and backgrounds. These systems use a set of predefined items from which users specify their preferences simply by selecting from a fixed list. As a result, they can’t put it in their own words. Moreover, these systems only consider the “exact similarity matching” among the users’ interests to find and recommend new friends. The main focus of this paper is to introduce a new approach for matching more compatible friends on social networking websites. Contrary to existing approaches, our system let users specify their interests in their own words. Thus, users do not need to select their preferences from a predefined list. In addition, we define “compatibility” by introducing two new relations between users’ interests: “semantic” and “complementary” relations for the purpose of matching compatible users. We chose 50 members from Live Journal social network as our experimental case in this study and calculated compatibility degrees between each pair of them. The results show that the average error of this system is 0.2 which is acceptable in comparison with the similarity matching friend recommendation systems in which the average rate of error is 0.6.","PeriodicalId":193599,"journal":{"name":"2011 Second International Conference on Intelligent Systems, Modelling and Simulation","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Second International Conference on Intelligent Systems, Modelling and Simulation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISMS.2011.54","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

the significant feature of a social networking website is the primary reason they are made for: connecting people and friends via internet. “Friend recommender systems” are wisely designed for finding people, most of whom tend to be with the same interests and backgrounds. These systems use a set of predefined items from which users specify their preferences simply by selecting from a fixed list. As a result, they can’t put it in their own words. Moreover, these systems only consider the “exact similarity matching” among the users’ interests to find and recommend new friends. The main focus of this paper is to introduce a new approach for matching more compatible friends on social networking websites. Contrary to existing approaches, our system let users specify their interests in their own words. Thus, users do not need to select their preferences from a predefined list. In addition, we define “compatibility” by introducing two new relations between users’ interests: “semantic” and “complementary” relations for the purpose of matching compatible users. We chose 50 members from Live Journal social network as our experimental case in this study and calculated compatibility degrees between each pair of them. The results show that the average error of this system is 0.2 which is acceptable in comparison with the similarity matching friend recommendation systems in which the average rate of error is 0.6.
在社交网站上寻找合适的人,一种语义技术方法
社交网站的主要功能是:通过互联网将人们和朋友联系起来。“朋友推荐系统”是为寻找朋友而设计的,大多数人都有相同的兴趣和背景。这些系统使用一组预定义的项目,用户只需从固定列表中选择即可指定他们的偏好。因此,他们不能用自己的话来表达。此外,这些系统只考虑用户兴趣之间的“精确相似匹配”来寻找和推荐新朋友。本文的主要重点是介绍一种在社交网站上匹配更兼容的朋友的新方法。与现有的方法相反,我们的系统允许用户用自己的话指定他们的兴趣。因此,用户不需要从预定义的列表中选择他们的首选项。此外,我们通过引入两种新的用户兴趣关系来定义“兼容性”:“语义”关系和“互补”关系,以匹配兼容的用户。在本研究中,我们从Live Journal社交网络中选择了50名成员作为实验案例,并计算了每对成员之间的兼容性。结果表明,该系统的平均错误率为0.2,与相似匹配的朋友推荐系统的平均错误率为0.6相比,该系统是可以接受的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信