Now 749 visitors
Today:87 Yesterday:834
Total: 3447 401S 102P 83R
2026-01-01, Week 1
Member Login
Welcome Message
Statistics
Committee
TACT Journal Homepage
Call for Paper
Paper Submission
Find My Paper
Author Homepage
Paper Procedure
FAQ
Registration / Invoice
Paper Archives
Outstanding Papers
Proceedings
Presentation Assistant
Hotel & Travel Info
Photo Gallery
Scheduler Login
Seminar
Archives Login
Sponsors






















Virual Oral Question and Answer
IEEE/ICACT20230212 Question.5
Questioner: nvlinh@cs.ccu.edu.tw    2023-02-17 ¿ÀÀü 11:54:37 		IEEE/ICACT20230212 Answer.5
Answer by Auhor 48838968@qq.com   2023-02-17 ¿ÀÀü 11:54:37
Do you compare your work with the state-of-the-art studies? Yes. The existing schemes also introduce clustering algorithm into data publishing privacy protection technology, but all have certain defects. The balance between privacy and availability of data has always been a hot issue in this field. The scheme in this paper reduces information loss and improves data availability by clustering at the cost of minimum information loss. At the same time, hierarchical protection of data with different sensitivity is realized through differential privacy noise mechanism, which enhances the privacy of data.

Select Voice