Clustering involves the partitioning of n objects into k clusters. Many clustering algorithms use hard-partitioning techniques where each object is assigned to one cluster. In this paper we propose an overlapping algorithm MCOKE which allows objects to belong to one or more clusters. The algorithm is different from fuzzy clustering techniques because objects that overlap are assigned a membership value of 1 (one) as opposed to a fuzzy membership degree. The algorithm is also different from other overlapping algorithms that require a similarity threshold be defined a priori which can be difficult to determine by novice users.
|Number of pages||4|
|Journal||International Journal of Computer, Electrical, Automation, Control and Information Engineering|
|Publication status||Published - 2015|
Baadel, S., Thabtah, F., & Lu, Z. (2015). MCOKE: Multi-Cluster Overlapping K-Means Extension Algorithm. International Journal of Computer, Electrical, Automation, Control and Information Engineering, 9(2), 427-430. . http://waset.org/publications/10000529/mcoke-multi-cluster-overlapping-k-means-extension-algorithm