Using Social Information to Compose a Similarity Function Based on Friends Attendance at Events

L. M. Pascoal, H. A. D. D. Nascimento, C. Camilo-Junior, Edialma Queiroz da Silva, E. L. Aleixo, Thierson Couto
{"title":"Using Social Information to Compose a Similarity Function Based on Friends Attendance at Events","authors":"L. M. Pascoal, H. A. D. D. Nascimento, C. Camilo-Junior, Edialma Queiroz da Silva, E. L. Aleixo, Thierson Couto","doi":"10.1109/CEC.2018.8477864","DOIUrl":null,"url":null,"abstract":"The analysis of affinity or similarity between people is an important task in the study of social dynamics. Traditional methods for determining similarity depends on considerable amount of data regarding people's preferences and features. Those methods present limitations when the data is scarce and/or changes constantly. This paper introduces a new method for determining people similarity that does not suffer from the same problems. The method can learn a customized similarity function based on social variables of friends that attend the same events (concerts, parties, conferences etc), collected from social networks. Two types of optimization algorithms for learning a similarity function are presented: The universal function approximator modelling, which relays on the relationship of social attributes and a friends' importance ranking; and the populational evolutionary modelling, which linearly combines social variables. Both models were tested in a generalist and in a specialist approach. The results show that the specialist approach exceeded in almost 38 % the generalist approach using populational evolutionary methods and in almost 69 % when using the universal function approximator methods. Among the implemented optimization algorithms employed inside the methods for learning similarity, Genetic Algorithm and Particle Swarm Optimization presented better performance for the populational evolutionary methods and the Artificial Neural Network presented the best performance overall using the universal function approximator modelling.","PeriodicalId":6344,"journal":{"name":"2009 IEEE Congress on Evolutionary Computation","volume":"52 1","pages":"1-8"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE Congress on Evolutionary Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2018.8477864","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The analysis of affinity or similarity between people is an important task in the study of social dynamics. Traditional methods for determining similarity depends on considerable amount of data regarding people's preferences and features. Those methods present limitations when the data is scarce and/or changes constantly. This paper introduces a new method for determining people similarity that does not suffer from the same problems. The method can learn a customized similarity function based on social variables of friends that attend the same events (concerts, parties, conferences etc), collected from social networks. Two types of optimization algorithms for learning a similarity function are presented: The universal function approximator modelling, which relays on the relationship of social attributes and a friends' importance ranking; and the populational evolutionary modelling, which linearly combines social variables. Both models were tested in a generalist and in a specialist approach. The results show that the specialist approach exceeded in almost 38 % the generalist approach using populational evolutionary methods and in almost 69 % when using the universal function approximator methods. Among the implemented optimization algorithms employed inside the methods for learning similarity, Genetic Algorithm and Particle Swarm Optimization presented better performance for the populational evolutionary methods and the Artificial Neural Network presented the best performance overall using the universal function approximator modelling.
利用社会信息构建基于朋友出席事件的相似性函数
分析人与人之间的亲和力或相似性是社会动力学研究中的一项重要任务。确定相似性的传统方法依赖于大量关于人们偏好和特征的数据。当数据稀缺和/或不断变化时,这些方法存在局限性。本文介绍了一种新的确定人物相似度的方法,该方法不会出现相同的问题。该方法可以根据从社交网络中收集的参加相同活动(音乐会、派对、会议等)的朋友的社会变量来学习定制的相似性函数。提出了两种学习相似函数的优化算法:基于社会属性关系和好友重要性排序的通用函数逼近器建模;种群进化模型,线性地结合了社会变量。这两种模型都在通才和专家方法中进行了测试。结果表明,使用群体进化方法时,专家方法比通才方法高出近38%,而使用通用函数逼近方法时,专家方法高出近69%。在相似度学习方法内部采用的已实现优化算法中,遗传算法和粒子群优化算法在种群进化方法中表现较好,人工神经网络在通用函数逼近器建模中表现最佳。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信