Virual Oral Presentation Slide by Slide |
![]() | ![]() |
|
![]() |
The clustering algorithm based on binary tree firstly needs to define the distance between data, and then can measure the information loss in the generalization process, and finally cluster the binary tree at the cost of minimum information loss. |
[Go to Next Slide] |