|
University of Oklahoma |
>>Research
|
Clustering using 3-Branch Dendrogram | ||||||||||||
| Motivated from the dendrogram with two branches, a 3-branch dendrogram is designed. In this system, every closest three points are grouped and a new point standing for those three points is generated. The new point is what we call "Median point", it is the point which has the least cumulated distance from all the points. The 3-branch dendrogram is more stable when perturbation comes to the system. The program was initially designed using Matlab and is being rewriten in C++. | |||||||||||||
|
