作者: Sergei Solonets , Victor Drobny , Victor Rivera , JooYoung Lee
DOI: 10.1007/978-3-319-73521-4_5
关键词:
摘要: With the rapid growth of Online Social Networks (OSNs) and information involved in them, research studies concerning OSNs, as well foundation businesses, have become popular. Privacy on OSNs is typically protected by anonymisation methods. Current methods are not sufficient to ensure privacy they impose restrictions network making it suitable for studies. This paper introduces an approach find optimal anonymous graph under user-defined metrics using Constraint Programming, a technique that provides well-tested optimised engine combinatorial problems. The finds good trade-off between protection sensitive data quality represented network.