Abstract
In this paper, we propose a fast and reliable distance measure between two convex clusters using support vector machines (SVM). In doing so, the optimal hyperplane obtained by the SVM is used to calculate the minimal distance between the two clusters. As a result, an effective cluster merging algorithm that groups convex clusters resulted from the fuzzy convex clustering (FCC) method in is developed using this optimal distance. Hence, the number of clusters can be further reduced without losing its representation of the data. Several experimental results are given.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
