DocumentCode
584578
Title
Using a Nearest Neighbor Rule for the Clustering Method Based on One-Class Support Vector Machines
Author
Gu, Lei
Author_Institution
JiangSu Province Support Software Eng. R&D Center for Modern Inf. Technol. Applic. in Enterprise, Suzhou, China
fYear
2012
fDate
11-13 Aug. 2012
Firstpage
2067
Lastpage
2070
Abstract
In this paper, a nearest neighbor rule is applied to the clustering method based on one-class support vector machines. Although the traditional clustering method inspired the k-means clustering employs the kernel-based one-class support vector machines in improving the clustering performance, it forms the coarse decision boundaries. So this paper uses a nearest neighbor rule to establishing the better decision boundaries. Experimental results show that the novel clustering algorithm can increase the clustering accuracies according to a nearest neighbor rule.
Keywords
pattern clustering; support vector machines; clustering method; decision boundaries; k-means clustering; kernel-based one-class support vector machines; nearest neighbor rule; Accuracy; Clustering algorithms; Clustering methods; Educational institutions; Kernel; Support vector machines; clustering; k-means; nearest neighbor; one-class support vector machines;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Science & Service System (CSSS), 2012 International Conference on
Conference_Location
Nanjing
Print_ISBN
978-1-4673-0721-5
Type
conf
DOI
10.1109/CSSS.2012.514
Filename
6394832
Link To Document