Proximity multi-sphere support vector clustering

Trung Le, Dat Tran, Phuoc Nguyen, Wanli Ma, Dharmendra Sharma

Research output: Contribution to journalArticleResearchpeer-review

Abstract

Support vector data description constructs an optimal hypersphere in feature space as a description of a data set. This hypersphere when mapped back to input space becomes a set of contours, and support vector clustering (SVC) employs these contours as cluster boundaries to detect clusters in the data set. However real-world data sets may have some distinctive distributions and hence a single hypersphere cannot be the best description. As a result, the set of contours in input space does not always detect all clusters in the data set. Another issue in SVC is that in some cases, it cannot preserve proximity notation which is crucial for cluster analysis, that is, two data points that are close to each other can be assigned to different clusters using cluster labelling method of SVC. To overcome these drawbacks, we propose Proximity Multi-sphere Support Vector Clustering which employs a set of hyperspheres to provide a better data description for data sets having distinctive distributions and a proximity graph to favour the proximity notation. Experimental results on different data sets are presented to evaluate the proposed clustering technique and compare it with SVC and other clustering techniques.

Original languageEnglish
Pages (from-to)1309-1319
Number of pages11
JournalNeural Computing and Applications
Volume22
Issue number7-8
DOIs
Publication statusPublished - Jun 2013
Externally publishedYes

Keywords

  • Clustering
  • Multi-sphere support vector clustering
  • Multi-sphere support vector data description
  • Proximity graph
  • Support vector clustering
  • Support vector data description

Cite this

Le, Trung ; Tran, Dat ; Nguyen, Phuoc ; Ma, Wanli ; Sharma, Dharmendra. / Proximity multi-sphere support vector clustering. In: Neural Computing and Applications. 2013 ; Vol. 22, No. 7-8. pp. 1309-1319.
@article{03bf77fa1b8d4663bdbd52ae51d88583,
title = "Proximity multi-sphere support vector clustering",
abstract = "Support vector data description constructs an optimal hypersphere in feature space as a description of a data set. This hypersphere when mapped back to input space becomes a set of contours, and support vector clustering (SVC) employs these contours as cluster boundaries to detect clusters in the data set. However real-world data sets may have some distinctive distributions and hence a single hypersphere cannot be the best description. As a result, the set of contours in input space does not always detect all clusters in the data set. Another issue in SVC is that in some cases, it cannot preserve proximity notation which is crucial for cluster analysis, that is, two data points that are close to each other can be assigned to different clusters using cluster labelling method of SVC. To overcome these drawbacks, we propose Proximity Multi-sphere Support Vector Clustering which employs a set of hyperspheres to provide a better data description for data sets having distinctive distributions and a proximity graph to favour the proximity notation. Experimental results on different data sets are presented to evaluate the proposed clustering technique and compare it with SVC and other clustering techniques.",
keywords = "Clustering, Multi-sphere support vector clustering, Multi-sphere support vector data description, Proximity graph, Support vector clustering, Support vector data description",
author = "Trung Le and Dat Tran and Phuoc Nguyen and Wanli Ma and Dharmendra Sharma",
year = "2013",
month = "6",
doi = "10.1007/s00521-012-1001-7",
language = "English",
volume = "22",
pages = "1309--1319",
journal = "Neural Computing and Applications",
issn = "0941-0643",
publisher = "Springer-Verlag London Ltd.",
number = "7-8",

}

Le, T, Tran, D, Nguyen, P, Ma, W & Sharma, D 2013, 'Proximity multi-sphere support vector clustering', Neural Computing and Applications, vol. 22, no. 7-8, pp. 1309-1319. https://doi.org/10.1007/s00521-012-1001-7

Proximity multi-sphere support vector clustering. / Le, Trung; Tran, Dat; Nguyen, Phuoc; Ma, Wanli; Sharma, Dharmendra.

In: Neural Computing and Applications, Vol. 22, No. 7-8, 06.2013, p. 1309-1319.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - Proximity multi-sphere support vector clustering

AU - Le, Trung

AU - Tran, Dat

AU - Nguyen, Phuoc

AU - Ma, Wanli

AU - Sharma, Dharmendra

PY - 2013/6

Y1 - 2013/6

N2 - Support vector data description constructs an optimal hypersphere in feature space as a description of a data set. This hypersphere when mapped back to input space becomes a set of contours, and support vector clustering (SVC) employs these contours as cluster boundaries to detect clusters in the data set. However real-world data sets may have some distinctive distributions and hence a single hypersphere cannot be the best description. As a result, the set of contours in input space does not always detect all clusters in the data set. Another issue in SVC is that in some cases, it cannot preserve proximity notation which is crucial for cluster analysis, that is, two data points that are close to each other can be assigned to different clusters using cluster labelling method of SVC. To overcome these drawbacks, we propose Proximity Multi-sphere Support Vector Clustering which employs a set of hyperspheres to provide a better data description for data sets having distinctive distributions and a proximity graph to favour the proximity notation. Experimental results on different data sets are presented to evaluate the proposed clustering technique and compare it with SVC and other clustering techniques.

AB - Support vector data description constructs an optimal hypersphere in feature space as a description of a data set. This hypersphere when mapped back to input space becomes a set of contours, and support vector clustering (SVC) employs these contours as cluster boundaries to detect clusters in the data set. However real-world data sets may have some distinctive distributions and hence a single hypersphere cannot be the best description. As a result, the set of contours in input space does not always detect all clusters in the data set. Another issue in SVC is that in some cases, it cannot preserve proximity notation which is crucial for cluster analysis, that is, two data points that are close to each other can be assigned to different clusters using cluster labelling method of SVC. To overcome these drawbacks, we propose Proximity Multi-sphere Support Vector Clustering which employs a set of hyperspheres to provide a better data description for data sets having distinctive distributions and a proximity graph to favour the proximity notation. Experimental results on different data sets are presented to evaluate the proposed clustering technique and compare it with SVC and other clustering techniques.

KW - Clustering

KW - Multi-sphere support vector clustering

KW - Multi-sphere support vector data description

KW - Proximity graph

KW - Support vector clustering

KW - Support vector data description

UR - http://www.scopus.com/inward/record.url?scp=84878584659&partnerID=8YFLogxK

U2 - 10.1007/s00521-012-1001-7

DO - 10.1007/s00521-012-1001-7

M3 - Article

VL - 22

SP - 1309

EP - 1319

JO - Neural Computing and Applications

JF - Neural Computing and Applications

SN - 0941-0643

IS - 7-8

ER -