Running summarizing tools on a new article

Check the paper below, then start its synthesis.


Optimizing Clustering Techniques for Retail Industry: One-Dimensional Time Warping Method for Demand Uncertainty

Mochamad Nizar Palefi Ma’ady (Institut Teknologi Telkom Surabaya), Prita Meilanitasari (Universitas Internasional Semen Indonesia), Nisa Isrofi (Institut Teknologi Telkom Surabaya), Iwan Vanany (Institut Teknologi Sepuluh Nopember)

International Conference on Sustainable Information Engineering and Technology (SIET)
DOI: 10.1145/3626641.3627602 (Computer Science)
License: not stated (all rights reserved)

Abstract: Product availability is a crucial factor in maintaining customer satisfaction and securing revenue streams for retailers and suppliers. By clustering products based on demand patterns and inventory turnover, retailers can enhance efficiency and improve customer satisfaction. This study proposes optimizing product clustering by comparing dynamic time warping and k-means methods to find the best clustering solution. The results show that dynamic time warping outperforms the k-means algorithm, with a higher Silhouette score of 0.8406 compared to 0.7578. This indicates that our proposed method is more efficient in optimizing product clustering. Furthermore, the time complexity is faster compared to k-means. We also provide a numerical demonstration of the table-filling procedure for a small problem. Overall, this study offers insights into how retailers can improve their product clustering strategies to better meet customer needs and maximize revenue.

Published on 24 Oct. 2023