Computing and Library Services - delivering an inspiring information environment

Overlapping Clustering: A Review

Baadel, Said, Thabtah, Fadi and Lu, Joan (2016) Overlapping Clustering: A Review. In: SAI Computing Conference (SAI), 2016. IEEE. ISBN 978-1-4673-8461-2

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

Download (116kB)


Data Clustering or unsupervised classification is one of the main research area in Data Mining. Partitioning Clustering involves the partitioning of n objects into k clusters. Many clustering algorithms use hard (crisp) partitioning techniques where each object is assigned to one cluster. Other algorithms utilise overlapping techniques where an object may belong to one or more clusters. Partitioning algorithms that overlap include the commonly used Fuzzy K-means and its variations. Other more recent algorithms reviewed in this paper are the Overlapping K-Means (OKM), Weighted OKM (WOKM) the Overlapping Partitioning Cluster (OPC) and the Multi-Cluster Overlapping K-means Extension (MCOKE). This review focuses on the above mentioned partitioning methods and future direction in overlapping clustering is highlighted in this paper.

Item Type: Book Chapter
Subjects: T Technology > T Technology (General)
Schools: School of Computing and Engineering
Related URLs:
Depositing User: Said Baadel
Date Deposited: 05 Sep 2016 14:08
Last Modified: 28 Aug 2021 16:47


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 ©