Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : JOURNAL OF APPLIED INFORMATICS AND COMPUTING

Donor Segmentation Analysis Using the RFM Model and K-Means Clustering to Optimize Fundraising Strategies ., Rezki; Lapatta, Nouval Trezandy; Ardiansyah, Rizka; ., Wirdayanti; Angreni, Dwi Shinta
Journal of Applied Informatics and Computing Vol. 8 No. 2 (2024): December 2024
Publisher : Politeknik Negeri Batam

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30871/jaic.v8i2.8464

Abstract

This study aims to segment donors using the Recency, Frequency, Monetary (RFM) model and the K-Means algorithm to optimize fundraising strategies. The RFM model is used to measure donor engagement through three dimensions: Recency (the last time a donation was made), Frequency (the frequency of donations), and Monetary (the amount of donations). By utilizing RFM scores, donors are then grouped using the K-means algorithm to generate more specific donor segments. This study was conducted using donation data from a non-profit organization, focusing on strategies to improve donor loyalty and donation frequency. The segmentation results identified several key segments, including Loyal Donors, New Donors, Potential Donors, and Low-Priority Donors. Each segment exhibits different donation behavior characteristics and requires a different strategic approach. The implementation of these segmentation results is expected to help the organization design more effective communication strategies and donation programs, as well as improve donor retention and lifetime value. Additionally, this study identifies the potential for enhancing the analytical model for broader applications in the future. This research contributes to non-profit organizations by offering a more efficient approach to managing donor relationships.
Comparative Performance Analysis of GRPC and Rest API Under Various Traffic Conditions and Data Sizes Using a Quantitative Approach Ain, Moch. Zukhruf; Rizka Ardiansyah; Septiano Anggun Pratama; Muhammad Akbar; Nouval Trezandy Lapatta
Journal of Applied Informatics and Computing Vol. 9 No. 2 (2025): April 2025
Publisher : Politeknik Negeri Batam

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30871/jaic.v9i2.9276

Abstract

Web 3.0 presents challenges in efficient data exchange, especially in decentralized systems. REST API (HTTP/1.1) remains widely used due to its broad compatibility but has communication inefficiencies, while gRPC (HTTP/2) offers better performance with multiplexing and Protocol Buffers. This study compares REST API and gRPC under various traffic conditions and data sizes using Apache JMeter and Wireshark, measuring throughput, response time, latency, and data transfer efficiency. Results show that REST API has higher throughput in low-traffic scenarios (995 vs. 29.5 req/min) and faster GET response time (3 ms vs. 20 ms), while gRPC excels in large data transfers (276.34 KB/s vs. 134.1 KB/s) and stable latency (0.147 ms). However, ANOVA analysis (p > 0.05) indicates no statistically significant difference. REST API is ideal for standard web applications, while gRPC is suited for microservices and real-time systems.