Computing and Library Services - delivering an inspiring information environment

Mutli Cluster Overlapping K-Means Extension (MCOKE) Algorithm

Baadel, Said, Thabtah, Fadi and Lu, Joan (2015) Mutli Cluster Overlapping K-Means Extension (MCOKE) Algorithm. World Academy of Science, Engineering and Technology International Journal of Computer, Electrical, Automation, Control and Information Engineering, 9 (2).

[img] PDF - Published Version
Restricted to Repository staff only

Download (97kB)


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.

Item Type: Article
Subjects: T Technology > T Technology (General)
Schools: School of Computing and Engineering
Related URLs:
Depositing User: Said Baadel
Date Deposited: 01 Sep 2016 13:02
Last Modified: 28 Aug 2021 14:17


Downloads per month over past year

Repository Staff Only: item control page

View Item View Item

University of Huddersfield, Queensgate, Huddersfield, HD1 3DH Copyright and Disclaimer All rights reserved ©