A clustering algorithm based on an estimated distribution model
International Journal of Business Intelligence and Data Mining, 2005•inderscienceonline.com
This paper applies an estimated distribution model to clustering problems. The proposed
clustering method makes use of an inter-intra cluster metric and performs a conditional split-
merge operation. With conditional splitting and merging, the proposed clustering method
does not require the information of cluster number and an improved cluster vector is
subsequently guaranteed. In addition, this paper compares movement conditions between
inter-intra cluster metric and intra cluster metric. It proves that, under some conditions, the …
clustering method makes use of an inter-intra cluster metric and performs a conditional split-
merge operation. With conditional splitting and merging, the proposed clustering method
does not require the information of cluster number and an improved cluster vector is
subsequently guaranteed. In addition, this paper compares movement conditions between
inter-intra cluster metric and intra cluster metric. It proves that, under some conditions, the …
This paper applies an estimated distribution model to clustering problems. The proposed clustering method makes use of an inter-intra cluster metric and performs a conditional split-merge operation. With conditional splitting and merging, the proposed clustering method does not require the information of cluster number and an improved cluster vector is subsequently guaranteed. In addition, this paper compares movement conditions between inter-intra cluster metric and intra cluster metric. It proves that, under some conditions, the intersection of convergence space between inter-intra cluster metric and intra cluster metric is not empty, and neither is the other subset in the convergence space. This sheds light on how much a cluster metric can play in clustering convergence.

Showing the best result for this search. See all results