Abstract
Partitioning nonlinearly separable datasets is a basic problem that is associated with data clustering. In this paper, a novel approach that is termed graph-based multiprototype competitive learning (GMPCL) is proposed to handle this problem. A graph-based method is employed to produce an initial, coarse clustering. After that, a multiprototype competitive learning is introduced to refine the coarse clustering and discover clusters of an arbitrary shape. The GMPCL algorithm is further extended to deal with high-dimensional data clustering, i.e., the fast graph-based multiprototype competitive learning (FGMPCL) algorithm. An experimental comparison has been performed by the exploitation of both synthetic and real-world datasets to validate the effectiveness of the proposed methods. Additionally, we apply our GMPCL/FGMPCL to two computer-vision tasks, namely, automatic color image segmentation and video clustering. Experimental results show that GMPCL/FGMPCL provide an effective and efficient tool with application to computer vision.
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 callMore From: IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews)
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.
