Yang, Jianjua, and Lee, Ickjai (2004) Cluster validity through graph-based boundary analysis. In: Proceedings of the 2004 International Conference on Information and Knowledge Engineering. From: 2004 International Conference on Information and Knowledge Engineering, 21-24 June 2004, Nevada, USA.

PDF (Published Version) Restricted to Repository staff only

 

14

3

Abstract

Gaining confidence that a clustering algorithm has produced meaningful results and not an accident of its usually heuristic optimization is central to data mining. This is the issue of cluster validity. We propose here a method by which proximity graphs are used to effectively detect border points and measure the margin between clusters. With analysis of boundary situation, we design a framework and relevant working principles to evaluate the separation and compactness in the clustering results. The method can obtain an insight into the internal structure in clustering result.

Actions (Repository Staff Only)

Item Control Page