An on-Line Agglomerative Clustering Method for Non-Stationary Data
, , , and .
Neural Computation (1999)

An on-line agglomerative clustering algorithm for non-stationary data is described. Three issues are addressed. The first regards the temporal aspects of the data. The clustering of stationary data by the proposed algorithm is comparable to the other popular algorithms tested (batch and on-line). The second issue addressed is the number of clusters required to represent the data. The algorithm provides an efficient framework to determine the natural number of clusters given the scale of the problem. Finally, the proposed algorithm implicitly minimizes the local distortion -- a measure whichtakes into account clusters with relatively small mass.
  • @gromgull
This publication has not been reviewed yet.

rating distribution
average user rating0.0 out of 5.0 based on 0 reviews
    Please log in to take part in the discussion (add own reviews or comments).