Now 133 visitors
Today:915 Yesterday:838
Total: 12963 196S 45P 12R
2025-10-20, Week 43
TACT Journal Page
Call for Paper
Author Homepage
Paper Procedure
Paper Submission
Registration
Welcome Message
Statistics
Committee
Paper Archives
Outstanding Papers
Proceedings
Presentation Assistant
Hotel & Travel Info
Photo Gallery
FAQ
Member Login
Scheduler Login
Seminar
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