Adaptive Privacy-Preserving Visualization Using Parallel Coordinates

被引:34
作者
Dasgupta, Aritra [1 ]
Kosara, Robert [1 ]
机构
[1] UNC Charlotte, Charlotte, NC USA
关键词
Parallel coordinates; privacy; clustering;
D O I
10.1109/TVCG.2011.163
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Current information visualization techniques assume unrestricted access to data. However, privacy protection is a key issue for a lot of real-world data analyses. Corporate data, medical records, etc. are rich in analytical value but cannot be shared without first going through a transformation step where explicit identifiers are removed and the data is sanitized. Researchers in the field of data mining have proposed different techniques over the years for privacy-preserving data publishing and subsequent mining techniques on such sanitized data. A well-known drawback in these methods is that for even a small guarantee of privacy, the utility of the datasets is greatly reduced. In this paper, we propose an adaptive technique for privacy preservation in parallel coordinates. Based on knowledge about the sensitivity of the data, we compute a clustered representation on the fly, which allows the user to explore the data without breaching privacy. Through the use of screen-space privacy metrics, the technique adapts to the user's screen parameters and interaction. We demonstrate our method in a case study and discuss potential attack scenarios.
引用
收藏
页码:2241 / 2248
页数:8
相关论文
共 30 条
[1]  
Aggarwal Gagan, 2005, Journal of Privacy Technology (JOPT)
[2]  
Agrawal R, 2000, SIGMOD REC, V29, P439, DOI 10.1145/335191.335438
[3]  
Bertino E, 2008, ADV DATABASE SYST, V34, P183
[4]  
Bezzi M, 2008, 3 INT C SEC PRIV COM, P28
[5]  
Brickell J., 2008, KNOWLEDGE DISCOVERY
[6]  
Bu SF, 2007, PROC INT CONF DATA, P671
[7]  
Bugliesi M., 2006, LECT NOTES COMPUT SC, P1
[8]  
Byun JW, 2007, LECT NOTES COMPUT SC, V4443, P188
[9]  
Ciriani V., 2007, Privacy-Preserving Data Mining: Models and Algorithms, P105
[10]  
Clifton C., 2002, NATL SCI FDN WORKSHO, P126