Spatially chunking support vector clustering algorithm
Tao Ban; Abe, S.
Neural Networks, 2004. Proceedings. 2004 IEEE International Joint Conference on
Volume 1, Issue , 25-29 July 2004 Page(s): - 418
Digital Object Identifier  
Summary: We propose a novel spatially chunking algorithm to speed up the support vector clustering (SVC) method for large data sets. The input data set is first divided into subsets where samples are geometrically adjacent to each other, an SVC is trained for each subset, and finally the clustering results of the local SVCs are combined to yield a global clustering solution. This method can save the computation cost for SVC by breaking the quadratic programming problem into smaller ones, and since parameter selection is done for each subset, it is able to deal with unevenly distributed data sets. The proposed method has demonstrated satisfactory performance with image segmentation problems on both gray scale and color images.

» View citation and abstract

Log in by entering your IEEE Web Account Username and Password.

IEEE Communications Society members: If you subscribe to the IEEE Electronic Periodicals Package or IEEE Electronic Periodicals Package Plus, you must access your subscription at www.comsoc.org.

Check with your librarian, information professional, or system manager to determine if you need to log in. Please complete the online Technical Support Form if you need assistance.

Select the Purchase History link to access the document. You will have 5 Days after purchase to access the Full Text PDF. Please complete the online Technical Support Form if you need assistance.

• Search and access Abstract records free of charge
• Register for table of contents alerts
• Purchase Full Text PDF documents

» Learn more about subscription options or how to become an IEEE Member.