 |
Part 3 THE PROPOSED METHOD. The key different of our algorithm compared with the original DPC is the adding of a loop for soliciting label from users to identify cluster centers. This is the active loop based on the uncertainty strategy. To this aim, a loop (step 5 to step 8 in Algorithm 2) is added to form a user or question process. At each step of the loop, we will choose the point, so that the multiple of rho and delta values, is maxima and solicit users to get its label. The loop process will stop by users; it means that we have collected enough cluster centers. After that, the strategy as in the DPC, is applied for clustering process and gets final results. The detail of algorithm is presented in Algorithm 2. |
IEEE/ICACT20220068 Slide.10
[Big Slide]