Mohammad-Reza Zare-Mirakabad, F. Kaveh-Yazdy, Mohammad Tahmasebi
{"title":"k-匿名化时间序列ngram的隐私保护","authors":"Mohammad-Reza Zare-Mirakabad, F. Kaveh-Yazdy, Mohammad Tahmasebi","doi":"10.1109/ISCISC.2013.6767335","DOIUrl":null,"url":null,"abstract":"Time series data, such as ECG, can be shared publicly for data mining applications and researches. This data similar to different kind of data types could be illegally exploited by an adversary to reveal identity of an individual. To prevent re-identification, many k-anonymization methods are introduced. Predictive models use probabilities of Ngrams of time series to predict future values. In this paper we propose an algorithm for k-anonymization of Ngram models of time series. It hides rare Ngrams of the time series between all other Ngrams that their frequencies are guaranteed to be at least k. Utilizing proposed algorithm on the real time series shows its effectivity by maximum information loss 2%.","PeriodicalId":265985,"journal":{"name":"2013 10th International ISC Conference on Information Security and Cryptology (ISCISC)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2013-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Privacy preservation by k-anonymizing Ngrams of time series\",\"authors\":\"Mohammad-Reza Zare-Mirakabad, F. Kaveh-Yazdy, Mohammad Tahmasebi\",\"doi\":\"10.1109/ISCISC.2013.6767335\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Time series data, such as ECG, can be shared publicly for data mining applications and researches. This data similar to different kind of data types could be illegally exploited by an adversary to reveal identity of an individual. To prevent re-identification, many k-anonymization methods are introduced. Predictive models use probabilities of Ngrams of time series to predict future values. In this paper we propose an algorithm for k-anonymization of Ngram models of time series. It hides rare Ngrams of the time series between all other Ngrams that their frequencies are guaranteed to be at least k. Utilizing proposed algorithm on the real time series shows its effectivity by maximum information loss 2%.\",\"PeriodicalId\":265985,\"journal\":{\"name\":\"2013 10th International ISC Conference on Information Security and Cryptology (ISCISC)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 10th International ISC Conference on Information Security and Cryptology (ISCISC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCISC.2013.6767335\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 10th International ISC Conference on Information Security and Cryptology (ISCISC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCISC.2013.6767335","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Privacy preservation by k-anonymizing Ngrams of time series
Time series data, such as ECG, can be shared publicly for data mining applications and researches. This data similar to different kind of data types could be illegally exploited by an adversary to reveal identity of an individual. To prevent re-identification, many k-anonymization methods are introduced. Predictive models use probabilities of Ngrams of time series to predict future values. In this paper we propose an algorithm for k-anonymization of Ngram models of time series. It hides rare Ngrams of the time series between all other Ngrams that their frequencies are guaranteed to be at least k. Utilizing proposed algorithm on the real time series shows its effectivity by maximum information loss 2%.