Abstract

This paper presents a validity-guided support vector clustering (SVC) algorithm for identifying an optimal cluster configuration. Since the SVC is a kernel based clustering approach, the parameter of kernel functions plays a crucial role in the clustering result. Without a priori knowledge of data sets, a validity measure, based on a ratio of overall cluster compactness to separation, has been developed to automatically determine a suitable parameter of the kernel functions. Using this parameter, the SVC algorithm is capable of identifying the optimal cluster number with compact and smooth arbitrary-shaped cluster boundaries. Computer simulations have been conducted to demonstrate the effectiveness of the proposed validity-guided SVC algorithm.

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.