A fast and effective partitional clustering algorithm for large categorical datasets using a k-means based approach

Partitional clustering algorithms represent an interesting issue in pattern recognition due to their high scalability and efficiency. The k-means, proposed since 1965, had shown great efficiency for numeric clustering but is unfortunately inadequate for categorical clustering. In 1998, the k-modes w...

Full description

Saved in:
Bibliographic Details
Published in:Computers & electrical engineering Vol. 68; pp. 463 - 483
Main Authors: Ben Salem, Semeh, Naouali, Sami, Chtourou, Zied
Format: Journal Article
Language:English
Published: Amsterdam Elsevier Ltd 01.05.2018
Elsevier BV
Subjects:
Algorithms
Artificial intelligence
Categorical clustering
Centroids
Clustering
Complexity theory
Cost analysis
Crime Mining
Datasets
Distance measurement
Efficiency
k-means
k-modes
Partitions
Pattern recognition
Unsupervised learning
k-means
Crime Mining
Pattern recognition
Categorical clustering
k-modes
Unsupervised learning
ISSN:0045-7906, 1879-0755
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Partitional clustering algorithms represent an interesting issue in pattern recognition due to their high scalability and efficiency. The k-means, proposed since 1965, had shown great efficiency for numeric clustering but is unfortunately inadequate for categorical clustering. In 1998, the k-modes was proposed as an extension of the k-means to cluster categorical datasets. In this paper, a new categorical method based on partitions called Manhattan Frequency k-Means (MFk-M) is detailed. It aims to convert the initial categorical data into numeric values using the relative frequency of each modality in the attributes. The L1 (Manhattan distance) norm was also used as an evaluation distance measure to compute the distance between the observations and the centroids. Finally, an approximation is defined to evaluate each resulting partition during the execution of the algorithm to avoid trivial clusterings such as cluster death. Experimental analysis performed on real life datasets highlights the reduced complexity costs and high efficiency of our proposal when compared to the standard k-means and k-modes algorithms.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0045-7906
1879-0755
DOI:10.1016/j.compeleceng.2018.04.023