Now 123 visitors
Today:0 Yesterday:0
Total: 444799 S 0P 0R
2026-05-12, Week 20
Member Login
Call for Paper
Committee
Paper Submission
Find My Paper
Author Homepage
Statistics & History
Welcome Message
TACT Journal Homepage
Paper Procedure
FAQ
Registration & Invoice
Paper Archives
Outstanding Papers
Program & Proceedings
Presentation Platform
Hotel & Travel Info
Photo Gallery
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