Now 41 visitors
Today:416 Yesterday:393
Total: 2521 1S 0P 0R
2024-07-17, Week 29
TACT Journal Homepage
Conference Call for Paper
Author HomePage
Paper Procedure
Paper Submission
Registration Fare
Welcome Message
Statistics & History
Committee
Paper Archives
Outstanding Papers
Conference Proceedings
Presentation Assistant
Travel Information
Photo Gallery
FAQ
Member Login
Scheduler Login
Archives Login
Sponsors
















Virual Oral Question and Answer
IEEE/ICACT20230212 Question.2
Questioner: lp_saikia@yahoo.co.in    2023-02-16 ¿ÀÈÄ 8:40:15 		IEEE/ICACT20230212 Answer.2
Answer by Auhor 48838968@qq.com   2023-02-16 ¿ÀÈÄ 8:40:15
Your proposed binary tree-based clustering algorithm BTCA is compared with the k-anonymous classical algorithm KACA algorithm, please point out findings. After taking different K values, the experiment shows that the BTCA algorithm proposed in this paper has less information loss than KCAC algorithm. And with the increase of K value, this advantage is more obvious and data availability is higher.

Select Voice