Please use this identifier to cite or link to this item: https://hdl.handle.net/2440/77527
Citations
Scopus Web of Science® Altmetric
?
?
Type: Conference paper
Title: Towards identity disclosure control in private hypergraph publishing
Author: Li, Y.
Shen, H.
Citation: Advances in Knowledge Discovery and Data Mining: Proceedings of the 16th Pacific-Asia Conference, PAKDD 2012, held in Kuala Lumpur, 29 May-1 June, 2012 / P.-N. Tan, S. Chawla, C.K. Ho and J. Bailey(eds): pp.347-358
Publisher: Springer Verlag
Publisher Place: Germany
Issue Date: 2012
Series/Report no.: Lecture Notes in Computer Science; 7302
ISBN: 9783642302190
ISSN: 0302-9743
1611-3349
Conference Name: Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining (16th : 2012 : Kuala Lumpur)
Statement of
Responsibility: 
Yidong Li and Hong Shen
Abstract: Identity disclosure control (IDC) on complex data has attracted increasing interest in security and database communities. Most existing work focuses on preventing identity disclosure in graphs that describes pairwise relations between data entities. Many data analysis applications need information about multi-relations among entities, which can be well represented with hypergraphs. However, the IDC problem has been little studied in publishing hypergraphs due to the diversity of hypergraph information which may expose to many types of background knowledge attacks. In this paper, we introduce a novel attack model with the properties of hyperedge rank as background knowledge, and formalize the rank-based hypergraph anonymization (RHA) problem. We propose an algorithm running in near-quadratic time on hypergraph size for rank anonymization which we show to be NP-hard, and in the meanwhile, maintaining data utility for community detection. We also show how to construct the hypergraph under the anonymized properties to protect a hypergraph from rank-based attacks. The performances of the methods have been validated by extensive experiments on real-world datasets. Our rank-based attack model and algorithms for rank anonymization and hypergraph construction are, to our best knowledge, the first systematic study for private hypergraph publishing.
Keywords: Identity disclosure control
private hypergraph publishing
anonymization
community detection
Rights: © Springer-Verlag Berlin Heidelberg 2012
DOI: 10.1007/978-3-642-30220-6_29
Appears in Collections:Aurora harvest 4
Computer Science publications

Files in This Item:
File Description SizeFormat 
RA_hdl_77527.pdf
  Restricted Access
Restricted Access322.91 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.