Implementasi Data Mining Association Rules Menggunakan Algoritma Fp-Growth untuk Data Penjualan Keramik
Bibliographic record
Abstract
The ceramic company CV Sukses Bersama is facing challenges in determining the optimal product layout and promotion strategy. To address this issue, this research applies the Data Mining Association Rules method using the FP-Growth algorithm. With the Python programming language, the author conducts an analysis of the company's sales data to identify significant purchasing patterns. The analysis results reveal that the product 'MCC' enjoys an exceptionally high level of popularity, with a support rate reaching 94.86%. This indicates that 'MCC' is the primary favorite among CV Sukses Bersama's customers. The analysis also unveils several significant Association Rules, such as {'MCC'} -> {'HRM'} with a confidence level of 86.99%. This implies that customers who purchase 'MCC' tend to buy 'HRM' with a high level of certainty. These findings hold strategic importance for CV Sukses Bersama, offering valuable insights that can be utilized to design more effective marketing strategies by understanding customer preferences and optimizing product stock management.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.004 | 0.008 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.003 | 0.002 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".