Reducing Features to Improve Link Prediction Performance in Location Based Social Networks, Non-Monotonically Selected Subset from Feature Clusters

A. Bayrak, Faruk Polat
{"title":"Reducing Features to Improve Link Prediction Performance in Location Based Social Networks, Non-Monotonically Selected Subset from Feature Clusters","authors":"A. Bayrak, Faruk Polat","doi":"10.1145/3341161.3343853","DOIUrl":null,"url":null,"abstract":"In most cases, feature sets available for machine learning algorithms require a feature engineering approach to pick the subset for optimal performance. During our link prediction research, we had observed the same challenge for features of Location Based Social Networks (LBSNs). We applied multiple reduction approaches to avoid performance issues caused by redundancy and relevance interactions between features. One of the approaches was the custom two-step method; starts with clustering features based on the proposed interaction related similarity measurement and ends with non-monotonically selecting optimal feature subset from those clusters. In this study, we applied well-known generic feature reduction algorithms together with our custom method for LBSNs to evaluate novelty and verify the contributions. Results from multiple data groups depict that our custom feature reduction approach makes higher and more stable effectivity optimizations for link prediction when compared with others.","PeriodicalId":403360,"journal":{"name":"2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3341161.3343853","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In most cases, feature sets available for machine learning algorithms require a feature engineering approach to pick the subset for optimal performance. During our link prediction research, we had observed the same challenge for features of Location Based Social Networks (LBSNs). We applied multiple reduction approaches to avoid performance issues caused by redundancy and relevance interactions between features. One of the approaches was the custom two-step method; starts with clustering features based on the proposed interaction related similarity measurement and ends with non-monotonically selecting optimal feature subset from those clusters. In this study, we applied well-known generic feature reduction algorithms together with our custom method for LBSNs to evaluate novelty and verify the contributions. Results from multiple data groups depict that our custom feature reduction approach makes higher and more stable effectivity optimizations for link prediction when compared with others.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
在基于位置的社交网络中减少特征以提高链接预测性能,从特征簇中非单调选择子集
在大多数情况下,机器学习算法可用的特征集需要特征工程方法来选择最佳性能的子集。在我们的链接预测研究中,我们观察到基于位置的社交网络(LBSNs)的特征面临同样的挑战。我们采用了多种约简方法来避免由于特征之间的冗余和相关性交互而导致的性能问题。其中一种方法是自定义的两步法;从基于所提出的交互相关相似性度量的聚类特征开始,以非单调地从这些聚类中选择最优特征子集结束。在这项研究中,我们将众所周知的通用特征约简算法与我们自定义的LBSNs方法结合起来评估新颖性并验证贡献。来自多个数据组的结果表明,与其他方法相比,我们的自定义特征约简方法对链接预测的效率优化更高、更稳定。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Neural-Brane: An inductive approach for attributed network embedding Customer Recommendation Based on Profile Matching and Customized Campaigns in On-Line Social Networks Characterizing and Detecting Livestreaming Chatbots Two Decades of Network Science: as seen through the co-authorship network of network scientists Show me your friends, and I will tell you whom you vote for: Predicting voting behavior in social networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1