Claim Missing Document
Check
Articles

Found 22 Documents
Search

A Data Science Approach to Cancer Patient Classification Using Support Vector Machine and Random Forest Devi Dwi Anggraini; Mutiara Rizky Salsabila; Keisya Rizkia Kamila; Yunita Sartika Sari
Journal Collabits Vol. 3 No. 1 (2026)
Publisher : Journal Collabits

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22441/collabits.v3i1.37642

Abstract

The increasing availability of healthcare data has encouraged the application of data science and machine learning techniques in medical research. Cancer patient datasets contain numerical demographic and clinical attributes that can be utilized for classification tasks; however, complex feature relationships and limited feature relevance remain key challenges. This study aims to analyze cancer patient data and compare the performance of Support Vector Machine and Random Forest algorithms for gender classification. The dataset used in this study consists of numerical features, including patient age, tumor size, number of examined lymph nodes, number of positive lymph nodes, body mass index, and survival duration measured in months. The research methodology includes data preprocessing, exploratory data analysis, model development, and performance evaluation. Feature normalization and data splitting are applied to ensure a fair comparison between models, while exploratory analysis is conducted to examine data distribution and relationships among variables. Both classification models are trained under identical experimental settings and evaluated using accuracy as the primary performance metric. The results indicate that both algorithms can classify cancer patients with satisfactory accuracy. Support Vector Machine demonstrates slightly better performance compared to Random Forest, suggesting its effectiveness in handling numerical data with complex decision boundaries. The findings highlight the importance of appropriate algorithm selection and feature utilization in healthcare data analysis.
Design and Implementation of a Python-Based Cinema Ticket Ordering Prototype Using Linear Search Ramando Girsang; Hisyam Fadhila; Yunita Sartika sari; Nia Rahmah Kurnianda; Ifan Prihandi
Journal Collabits Vol. 3 No. 2 (2026)
Publisher : Journal Collabits

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22441/collabits.v3i2.27260

Abstract

The increasing adoption of digital services has encouraged the development of ticketing systems that simplify access to movie information and transaction processes. This study aims to design and implement a Python-based cinema ticket ordering prototype and to examine the suitability of the Linear Search algorithm for movie-title lookup in a small and unsorted dataset. The development process consists of requirements analysis, system design, implementation, functional verification, and algorithmic complexity analysis. The prototype supports customer input, movie selection, ticket quantity calculation, optional food and beverage ordering, and transaction calculation. Linear Search is selected because it can operate directly on a small unsorted list without preprocessing or an additional indexing structure. Theoretical comparison shows that Linear Search has O(n) average and worst-case time complexity, while Binary Search offers O(log n) complexity for sorted data and hash-based lookup offers O(1) average lookup time with additional storage requirements. The study therefore does not claim Linear Search as a new or universally efficient algorithm. Its contribution lies in presenting a transparent small-scale ticket-ordering architecture and an academically justified algorithm selection. Future development should incorporate persistent database storage, a graphical or web/mobile interface, authentication, secure payment integration, usability evaluation, and empirical performance benchmarking.