 |
In this section, we will present some basic concepts using such as density peak detecting, active learning, and the min- max method. These methods will be used in our new algorithm in the next section.
Firstly, we explain the Density peak detecting process.
In 2014, Rodriguez and Laio proposed the density peak concept in the context of clustering problem. Using a parameter dc, the local density of xi is defined as equation 1 and 2. From two factors r(xi) and d(xi), we can build a decision graph in which the x-axis and the y-axis are respectively the rho and delta values for whole data set. Date set Art1 (top) and the decision graph (bottom): four points in the right up corner of the figure can be seen as peaks of the decision graph. |
IEEE/ICACT20220071 Slide.07
[Big Slide]