在云中存储PHR的基于聚类的高效匿名方法

G. Logeswari, D. Sangeetha, V. Vaidehi
{"title":"在云中存储PHR的基于聚类的高效匿名方法","authors":"G. Logeswari, D. Sangeetha, V. Vaidehi","doi":"10.1109/ICRTIT.2014.6996146","DOIUrl":null,"url":null,"abstract":"As there is an increasing need to share the medical information for public health research, enormous amount of Personal Health Records (PHR's) are periodically collected and shared between two or many sources for research purpose. Sharing medical information about an individual without revealing sensitive information is the biggest challenge. Privacy and security are the two biggest obstacles for this process. Since medical information is related to human subjects, it is essential to preserve the privacy of the patients and ensure security to the medical information stored in cloud. In this paper, privacy of the shared PHR's is preserved through data anonymization and encryption algorithm. PHR's can be anonymized using various techniques such as generalization, suppression, truncation, etc., This paper focuses to provide efficient analysis of the shared PHR's by the proposed Efficient K-Means Clustering (EKMC) algorithm and to reduce the cost of data storage by the proposed Data Aggregation and Deduplication (DAD) algorithm. The EKMC algorithm is efficient and consumes less time when compared to the traditional k-means clustering algorithm. A set of performance analysis showing the effectiveness of our approach using synthetic data sets is presented.","PeriodicalId":422275,"journal":{"name":"2014 International Conference on Recent Trends in Information Technology","volume":"295 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"A cost effective clustering based anonymization approach for storing PHR's in cloud\",\"authors\":\"G. Logeswari, D. Sangeetha, V. Vaidehi\",\"doi\":\"10.1109/ICRTIT.2014.6996146\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As there is an increasing need to share the medical information for public health research, enormous amount of Personal Health Records (PHR's) are periodically collected and shared between two or many sources for research purpose. Sharing medical information about an individual without revealing sensitive information is the biggest challenge. Privacy and security are the two biggest obstacles for this process. Since medical information is related to human subjects, it is essential to preserve the privacy of the patients and ensure security to the medical information stored in cloud. In this paper, privacy of the shared PHR's is preserved through data anonymization and encryption algorithm. PHR's can be anonymized using various techniques such as generalization, suppression, truncation, etc., This paper focuses to provide efficient analysis of the shared PHR's by the proposed Efficient K-Means Clustering (EKMC) algorithm and to reduce the cost of data storage by the proposed Data Aggregation and Deduplication (DAD) algorithm. The EKMC algorithm is efficient and consumes less time when compared to the traditional k-means clustering algorithm. A set of performance analysis showing the effectiveness of our approach using synthetic data sets is presented.\",\"PeriodicalId\":422275,\"journal\":{\"name\":\"2014 International Conference on Recent Trends in Information Technology\",\"volume\":\"295 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-04-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 International Conference on Recent Trends in Information Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICRTIT.2014.6996146\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Conference on Recent Trends in Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICRTIT.2014.6996146","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

摘要

由于公共卫生研究对医疗信息共享的需求日益增加,大量的个人健康记录(PHR)被定期收集,并在两个或多个来源之间共享,用于研究目的。在不泄露敏感信息的情况下共享个人医疗信息是最大的挑战。隐私和安全是这一过程的两个最大障碍。由于医疗信息涉及人类受试者,因此保护患者的隐私和确保云存储医疗信息的安全性至关重要。在本文中,通过数据匿名化和加密算法来保护共享PHR的隐私。PHR可以通过泛化、抑制、截断等多种技术进行匿名化,本文的重点是通过提出的高效k均值聚类(EKMC)算法对共享PHR进行高效分析,并通过提出的数据聚合和重复数据删除(DAD)算法降低数据存储成本。与传统的k-means聚类算法相比,EKMC算法效率高,耗时短。一组性能分析显示了我们的方法使用合成数据集的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A cost effective clustering based anonymization approach for storing PHR's in cloud
As there is an increasing need to share the medical information for public health research, enormous amount of Personal Health Records (PHR's) are periodically collected and shared between two or many sources for research purpose. Sharing medical information about an individual without revealing sensitive information is the biggest challenge. Privacy and security are the two biggest obstacles for this process. Since medical information is related to human subjects, it is essential to preserve the privacy of the patients and ensure security to the medical information stored in cloud. In this paper, privacy of the shared PHR's is preserved through data anonymization and encryption algorithm. PHR's can be anonymized using various techniques such as generalization, suppression, truncation, etc., This paper focuses to provide efficient analysis of the shared PHR's by the proposed Efficient K-Means Clustering (EKMC) algorithm and to reduce the cost of data storage by the proposed Data Aggregation and Deduplication (DAD) algorithm. The EKMC algorithm is efficient and consumes less time when compared to the traditional k-means clustering algorithm. A set of performance analysis showing the effectiveness of our approach using synthetic data sets is presented.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信