By Topic

General C-means clustering model

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Jian Yu ; Sch. of Comput. Sci. & Inf. Technol., Beijing Jiaotong Univ., China

Partitional clustering is an important part of cluster analysis. Based on various theories, numerous clustering algorithms have been developed, and new clustering algorithms continue to appear in the literature. It is known that Occam's razor plays a pivotal role in data-based models, and partitional clustering is categorized as a data-based model. However, no relation had previously been discovered between Occam's razor and partitional clustering, as we discuss in this paper. The three main contributions of this paper can be summarized as follows: (1) according to a novel definition of the mean, a unifying generative framework for partitional clustering algorithms, called a general c-means clustering model (GCM), is presented and studied; and, (2) based on the local optimality test of the GCM, the connection between Occam's razor and partitional clustering is established for the first time. As its application, a comprehensive review of the existing objective function-based clustering algorithms is presented based on GCM. 3) Under a common assumption about partitional clustering, a theoretical guide for devising and implementing clustering algorithm is discovered. These conclusions are verified by numerical experimental results.

Published in:

Pattern Analysis and Machine Intelligence, IEEE Transactions on  (Volume:27 ,  Issue: 8 )