Cluster validity using support vector machines

Vladimir Estivill-Castro, Jianhua Yang

Research output: Chapter in Book / Conference PaperChapterpeer-review

17 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 analysis. This is the issue of validity and we propose here a method by which Support Vector Machines are used to evaluate the separation in the clustering results. However, we not only obtain a method to compare clustering results from different algorithms or different runs of the same algorithm, but we can also filter noise and outliers. Thus, for a fixed data set we can identify what is the most robust and potentially meaningful clustering result. A set of experiments illustrates the steps of our approach.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsYahiko Kambayashi, Mukesh Mohania, Wolfram Wob
PublisherSpringer Verlag
Pages244-256
Number of pages13
ISBN (Print)354040807X
DOIs
Publication statusPublished - 2003

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2737
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'Cluster validity using support vector machines'. Together they form a unique fingerprint.

Cite this