Abstract

A clustering algorithm based on one-class support vector machine has been proposed recently. Because the kernel technique is used, this approach can appear preferable to the traditional k-means clustering. Clustering ensemble method can combine several divisions of all unlabeled data into a single clustering to gain the better clustering results. In this paper, the clustering ensemble method is applied to the clustering algorithm based one-class support vector machines. Several partitions of multiple runs with different random initial data sets are combined into a final clustering result. Experiments show that the new approach can improve the clustering performance.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.