Abstract

Yasser El Sonbaty
On-Line Hierarchical Clustering
most of the techniques used in the literature for hierarchical clustering are based on off-line operation. the main contribution of this paper is to propose a new algorithm for on-line hierarchical clustering by finding the nearest k objects to each introduced object so farthese nearest k objects are continuously d by the arrival of a new object. by final object, we have the objectstheir nearest k objects which are sorted to produce the hierarchical dendogram. the results of the application of the new algorithm on realsynthetic dataalso using simulation experiments, show that the new technique is quite efficient and, in many respects, superior to traditional off-line hierarchical methods