| Virual Oral Presentation Slide by Slide |
IEEE/ICACT20230188 Slide.06
[Big Slide]
| Oral Presentation |
|
|
The DPC algorithm can be summarized into 6 steps as following. First, Calculate densities of all points 𝑥_𝑖 and 𝑥_𝑗. Second, Calculate Local density of data point 𝑥_𝑖 Here, 𝑑_𝑐 represents the neighborhood radius of the data point and it can be an adjustable parameter such that average number of neighbors is 1-2% according to different datasets. For ˇ°smallˇ± datasets, rho is defined as a Gaussian kernel function. | |
| [Go to Next Slide] |