Published: 2023-12-30

Utilizing Clustering Methods for Categorizing Delivery Requirements Based on Analysis of E-Commerce Product Data

DOI: 10.35870/ijsecs.v3i3.1969

Issue Cover
Article Metrics
Share:

Abstract

This study presents the implementation of the K-Means algorithm model, revealing novel insights into risk categorization in the delivery process. Two distinct clusters were identified: Cluster 1 (C0) indicating high risk, comprising 53 data points out of a dataset of 360, and Cluster 2 (C1) indicating low risk, encompassing 307 data points from the same dataset. Analysis conducted using RapidMiner Studio corroborated these findings, further delineating the cluster membership: C0 with 53 data points and C1 with 307 data points. Each cluster was characterized by optimal centroid values, recorded at 131.717 & 385.075 for C0, and 119.932 & 111.414 for C1. The model's effectiveness was assessed using the Davies-Bouldin Index, yielding a value of 0.626.

Keywords

Data Mining; K-Means; Clustering; E-Commerce; Product Analysis

Peer Review Process

This article has undergone a double-blind peer review process to ensure quality and impartiality.

Indexing Information

Discover where this journal is indexed at our indexing page.

Open Science Badges

This journal supports transparency in research and encourages authors to meet criteria for Open Science Badges.

Similar Articles

You may also start an advanced similarity search for this article.

Most read articles by the same author(s)