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

Prasetyo, Vincentius Riandaru (2018) Searching Cheapest Product On Three Different E-Commerce Using K-Means Algorithm. In: International Seminar on Intelligent Technology and Its Application 2018, August, 30-31 2018, Watu Jimbar, Bali.

This is the latest version of this item.

[thumbnail of Searching Cheapest Product_ Vincentius Riandaru.pdf]
Searching Cheapest Product_ Vincentius Riandaru.pdf - Updated Version

Download (2MB) | Preview
Official URL / DOI:


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 ecommerce 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.

Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: e-commerce, clustering, k-means, cosine similarity, precision, recall
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: Faculty of Engineering > Department of Information Technology
Date Deposited: 10 Mar 2021 04:21
Last Modified: 24 Mar 2021 16:34

Available Versions of this Item

Actions (login required)

View Item View Item