Research on Trajectory Clustering Optimization Algorithm Based on Sparse Representation

Wenting Zhao, Jingkang Yang, Fang Li, Cheng Pang, Ji Li, Xiaonan Luo
{"title":"Research on Trajectory Clustering Optimization Algorithm Based on Sparse Representation","authors":"Wenting Zhao, Jingkang Yang, Fang Li, Cheng Pang, Ji Li, Xiaonan Luo","doi":"10.1109/ICDH51081.2020.00047","DOIUrl":null,"url":null,"abstract":"Privacy issues in the trajectory play an significant role with the popularization of intelligent terminals in the age of big data. Personal information about users is easily exposed to the attackers in LBS. A big number of solutions are presented in the literature to better protect privacy. The scheme based on k-anonymity model has been widely used. However, the traditional methods have some limitations due to their long convergence time and subjective factors. In this paper, we propose a scheme based on sparse representation, which has high computational efficiency and simple solution. Firstly, we process the data set with certain techniques. Then we introduce the expression of sparse representation between trajectories and add regularization for continuous training. Experiments show that the optimization model achieves better clustering results, and the validity of the algorithm is testified by different evaluation indexes.","PeriodicalId":210502,"journal":{"name":"2020 8th International Conference on Digital Home (ICDH)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 8th International Conference on Digital Home (ICDH)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDH51081.2020.00047","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Privacy issues in the trajectory play an significant role with the popularization of intelligent terminals in the age of big data. Personal information about users is easily exposed to the attackers in LBS. A big number of solutions are presented in the literature to better protect privacy. The scheme based on k-anonymity model has been widely used. However, the traditional methods have some limitations due to their long convergence time and subjective factors. In this paper, we propose a scheme based on sparse representation, which has high computational efficiency and simple solution. Firstly, we process the data set with certain techniques. Then we introduce the expression of sparse representation between trajectories and add regularization for continuous training. Experiments show that the optimization model achieves better clustering results, and the validity of the algorithm is testified by different evaluation indexes.
基于稀疏表示的轨迹聚类优化算法研究
随着大数据时代智能终端的普及,隐私问题在发展轨迹中扮演着重要的角色。在LBS中,用户的个人信息很容易暴露给攻击者。为了更好地保护隐私,文献中提出了大量的解决方案。基于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学术文献互助群
群 号:604180095
Book学术官方微信