Searching Cheapest Product on Three Different E-Commerce Using K-Means Algorithm

Abstract

The development of e-commerce is starting to change people's lifestyles, not least the people of Indonesia. The existence of e-commerce is very helpful user in buying and selling products. There are many e-commerce that can be found today. Some of the famous e-commerce in Indonesia are Bukalapak, Lazada, and Blibli. A large number of existing e-commerce makes users, especially buyers, have difficulty when looking for products at the cheapest price. This happens because each e-commerce offers different prices for the same product. This research aims to make the cheapest product search system in Bukalapak, Lazada, and Blibli using K-Means algorithm. The results of experiments showed that K-Means algorithm can be used to classify product data from Bukalapak, Lazada, and Blibli well. The results of the clustering process can also help for searching the cheapest products from the three e-commerce becomes faster. However, the number of clusters used will affect the effectiveness of the search process on the system.