Fast searching optimal negative surveys
Fast searching optimal negative surveys
- Author(s): Yihui Lu ; Wenjian Luo ; Dongdong Zhao
- DOI: 10.1049/cp.2014.1270
For access to this article, please select a purchase option:
Buy conference paper PDF
Buy Knowledge Pack
IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.
ICINS 2014 - 2014 International Conference on Information and Network Security — Recommend this title to your library
Thank you
Your recommendation has been sent to your librarian.
- Author(s): Yihui Lu ; Wenjian Luo ; Dongdong Zhao Source: ICINS 2014 - 2014 International Conference on Information and Network Security, 2014 page ()
- Conference: ICINS 2014 - 2014 International Conference on Information and Network Security
- DOI: 10.1049/cp.2014.1270
- ISBN: 978-1-84919-909-4
- Location: Beijing, China
- Conference date: 14-16 Nov. 2014
- Format: PDF
In a negative survey, a category which does not agree with the fact of each participant is collected. Hence, data collectors cannot acquire the realistic data of participants, and this can efficiently protect participants' private information and sensitive data. However, existing approaches used to estimate the distribution of positive surveys from negative surveys are not practical and time-consuming. This paper proposed a method in order to acquire practical estimation results with a lower computing cost, namely fastNStoPS. Usually, privacy and utility are used to measure the performances of negative surveys, and they are two conflicting metrics. Users have different demands on privacy (or utility) under different circumstances. The optimal negative surveys are a Pareto font of these two objectives. To demonstrate its practicability, the proposed fastNStoPS method is embedded into a Differential Evolution (DE), which is used to find the optimal negative surveys. The experiment results show that the DE has a much better performance on find the optimal negative surveys, and the computing cost is very low.
Inspec keywords: Pareto optimisation; evolutionary computation; data protection
Subjects: Data security; Optimisation techniques
Related content
content/conferences/10.1049/cp.2014.1270
pub_keyword,iet_inspecKeyword,pub_concept
6
6
