Wenting Zhao, Jingkang Yang, Fang Li, Cheng Pang, Ji Li, Xiaonan Luo
{"title":"基于稀疏表示的轨迹聚类优化算法研究","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":"{\"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}","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}
Research on Trajectory Clustering Optimization Algorithm Based on Sparse Representation
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.