Cluster validity through graph-based boundary analysis

Jianhua Yang, Ickjai Lee

Research output: Chapter in Book / Conference PaperConference Paperpeer-review

14 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationProceedings of the International Conference on Information and Knowledge Engineering, IKE'04
EditorsH.R. Arabnia
Pages204-210
Number of pages7
Publication statusPublished - 2004
EventProceedings of the International Conference on Information and Knowledge Engineering, IKE'04 - Las Vegas, NV, United States
Duration: 21 Jun 200424 Jun 2004

Publication series

NameProceedings of the International Conference on Information and Knowledge Engineering , IKE'04

Conference

ConferenceProceedings of the International Conference on Information and Knowledge Engineering, IKE'04
Country/TerritoryUnited States
CityLas Vegas, NV
Period21/06/0424/06/04

Keywords

  • Cluster Validity
  • Clustering
  • Data Mining
  • Proximity Graph

Fingerprint

Dive into the research topics of 'Cluster validity through graph-based boundary analysis'. Together they form a unique fingerprint.

Cite this