Baadel, Said, Thabtah, Fadi Abdeljaber 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).
- Published Version
Restricted to Repository staff only
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.
|Subjects:||T Technology > T Technology (General)|
|Schools:||School of Computing and Engineering|
|Depositing User:||Said Baadel|
|Date Deposited:||01 Sep 2016 13:02|
|Last Modified:||16 Jan 2017 00:39|
Downloads per month over past year
Repository Staff Only: item control page