Penentuan Menu Potensial Menggunakan Algoritma K-Means Pada Titiksetara Coffee Bekasi

This study aims to identify potential customers and help local coffee entrepreneurs compete by offering products that customers desire, as well as address challenges in determining high‑potential menu items using the K‑Means algorithm. The data consist of TitikSetara Coffee’s revenue records from October 2023 through January 2024. RapidMiner software was used to perform clustering via the K‑Means algorithm. The sales data were grouped into three clusters: Cluster 0 for high‑potential menu items, Cluster 1 for medium‑potential menu items, and Cluster 2 for low‑potential menu items. Out of the 26 records analyzed, Cluster 0 contains 4 menu items, Cluster 1 contains 14 menu items, and Cluster 2 contains 8 menu items, with a Davies–Bouldin Index of 0.374. The identified high‑potential menu items can serve as a reference for TitikSetara Coffee, and it is expected that these recommendations will be well‑targeted.

Authors

Institutions

Publication Details

Journal
Jurnal Riset Informatika dan Teknologi Informasi
Published
2025-02-28
DOI
https://doi.org/10.58776/jriti.v2i2.161
Primary Topic
Multimedia Learning Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Penentuan Menu Potensial Menggunakan Algoritma K-Means Pada Titiksetara Coffee Bekasi

Mohammad Alviansyah, Prima Dina Atika
Jurnal Riset Informatika dan Teknologi Informasi
Multimedia Learning Systems
article

Penentuan Menu Potensial Menggunakan Algoritma K-Means Pada Titiksetara Coffee Bekasi

Mohammad Alviansyah, Prima Dina Atika
article en

Abstract

This study aims to identify potential customers and help local coffee entrepreneurs compete by offering products that customers desire, as well as address challenges in determining high‑potential menu items using the K‑Means algorithm. The data consist of TitikSetara Coffee’s revenue records from October 2023 through January 2024. RapidMiner software was used to perform clustering via the K‑Means algorithm. The sales data were grouped into three clusters: Cluster 0 for high‑potential menu items, Cluster 1 for medium‑potential menu items, and Cluster 2 for low‑potential menu items. Out of the 26 records analyzed, Cluster 0 contains 4 menu items, Cluster 1 contains 14 menu items, and Cluster 2 contains 8 menu items, with a Davies–Bouldin Index of 0.374. The identified high‑potential menu items can serve as a reference for TitikSetara Coffee, and it is expected that these recommendations will be well‑targeted.

Jurnal Riset Informatika dan Teknologi InformasiVol. 2(2)
Universitas Bhayangkara Jakarta Raya (ID)
Openalex Percentile: Top 74%
Multimedia Learning Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Penentuan Menu Potensial Menggunakan Algoritma K-Means Pada Titiksetara Coffee Bekasi — Mohammad Alviansyah, Prima Dina Atika · Jurnal Riset Informatika dan Teknologi Informasi (2025) | TGRS Research Map | TGRS