Penerapan K-Medoids Clustering Dan Silhouette Method Untuk Strategi Pemasaran Program Donasi Pada Lembaga Amil Zakat

Ali Mulyawan, Deni Gunawan, H. Basri, Salman Alfarizi, N. Ichsan
{"title":"Penerapan K-Medoids Clustering Dan Silhouette Method Untuk Strategi Pemasaran Program Donasi Pada Lembaga Amil Zakat","authors":"Ali Mulyawan, Deni Gunawan, H. Basri, Salman Alfarizi, N. Ichsan","doi":"10.51211/isbi.v8i1.2468","DOIUrl":null,"url":null,"abstract":"Donation data management is a complex challenge for amil zakat institutions in designing an effective marketing strategy for fundraising programs. In this study, the k-medoids algorithm was used to cluster the donation data with the aim of identifying patterns and characteristics of donors. The k-medoids algorithm was chosen because of its ability to handle unusual data and non-numeric attributes. Through clustering analysis, this study classifies donors based on attributes such as the number of donations, the frequency of donations, and the time interval for donating. And in determining the number of clusters in this study using the silhouette method to measure the quality of the resulting clustering. And getting the most optimal number of clusters is k = 3 with a silhouette score of 0.598782. The results of the study found that groups of donors had similar characteristics, such as donors who made high donations with regular frequency and donors who focused on donations for specific purposes. These findings can be used by charitable organizations in developing more effective fund management, marketing and targeting strategies","PeriodicalId":57647,"journal":{"name":"指挥信息系统与技术","volume":"62 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"指挥信息系统与技术","FirstCategoryId":"1093","ListUrlMain":"https://doi.org/10.51211/isbi.v8i1.2468","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Donation data management is a complex challenge for amil zakat institutions in designing an effective marketing strategy for fundraising programs. In this study, the k-medoids algorithm was used to cluster the donation data with the aim of identifying patterns and characteristics of donors. The k-medoids algorithm was chosen because of its ability to handle unusual data and non-numeric attributes. Through clustering analysis, this study classifies donors based on attributes such as the number of donations, the frequency of donations, and the time interval for donating. And in determining the number of clusters in this study using the silhouette method to measure the quality of the resulting clustering. And getting the most optimal number of clusters is k = 3 with a silhouette score of 0.598782. The results of the study found that groups of donors had similar characteristics, such as donors who made high donations with regular frequency and donors who focused on donations for specific purposes. These findings can be used by charitable organizations in developing more effective fund management, marketing and targeting strategies
捐赠数据管理是一个复杂的挑战,为慈善机构设计一个有效的营销策略。本研究采用k-medoids算法对捐赠数据进行聚类,目的是识别捐赠者的模式和特征。选择k-medoids算法是因为它能够处理异常数据和非数字属性。本研究通过聚类分析,根据捐赠次数、捐赠频率、捐赠时间间隔等属性对捐赠者进行分类。在确定聚类数量时,本研究采用剪影法来衡量聚类结果的质量。得到的最优簇数为k = 3,剪影分数为0.598782。研究结果发现,捐赠者群体具有相似的特征,例如经常进行高捐赠的捐赠者和专注于特定目的的捐赠者。这些发现可以被慈善组织用来制定更有效的基金管理、营销和目标策略
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
1474
期刊介绍:
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信