Sentiment Analysis of BCA Mobile App Reviews Using K-Nearest Neighbour and Support Vector Machine Algorithm

The rapid growth of financial technology (fintech) services in Indonesia has significantly transformed digital transaction behavior, with digital wallets such as DANA becoming widely adopted. Despite high usage rates, public discourse on social media frequently highlights both positive experiences and recurring concerns related to system reliability and data security. Twitter, as a real-time public communication platform, provides a rich source of user-generated content that reflects public perception toward fintech services. This study investigates public sentiment toward DANA fintech services in Indonesia through sentiment analysis of Twitter data using machine learning approaches. Purpose:This study aims to analyze public perception of DANA fintech services based on sentiment expressed on Twitter and to compare the performance of several machine learning classification algorithms in identifying positive, neutral, and negative sentiments in Indonesian-language social media texts. Methods/Study design/approach: The study employs a quantitative descriptive approach using text mining and sentiment analysis techniques. Twitter data were collected via the Twitter API over a specified period and processed through preprocessing stages including text cleaning, tokenization, stopword removal, and stemming. Feature extraction was performed using the Term Frequency–Inverse Document Frequency (TF-IDF) method. Sentiment classification was conducted using Support Vector Machine (SVM), K-Nearest Neighbor (KNN), and Random Forest algorithms. Model performance was evaluated using accuracy, precision, recall, and F1-score metrics. Result/Findings:The results indicate that public sentiment toward DANA is predominantly positive, driven by perceptions of transaction convenience and speed, followed by neutral sentiment, while negative sentiment is mainly associated with system disruptions and data security issues. Among the evaluated algorithms, SVM achieved the highest classification accuracy (91.4%), outperforming Random Forest and KNN. These findings demonstrate that SVM is more effective for sentiment classification of short Indonesian-language texts on social media platforms. Novelty/Originality/Value:This study contributes to the growing body of sentiment analysis research in Indonesia by providing empirical evidence on public perception of fintech services using machine learning techniques. By systematically comparing multiple classification algorithms in the context of Indonesian Twitter data, the study offers methodological insights and practical implications for fintech service providers in improving service quality, communication strategies, and user trust.

The development of online transportation applications such as Maxim has increased the need for sentiment analysis to understand user opinions from reviews on the Google Play Store. The main challenges in this analysis are language diversity, variations in writing style, and data imbalance, which affect model accuracy. This study aims to evaluate the performance of the Support Vector Machine (SVM), K-Nearest Neighbor (KNN), and Random Forest (RF) algorithms, as well as ensemble approaches through the Voting Classifier and Combined Classifier, in sentiment analysis of Maxim app reviews. The dataset consists of 2,851 Indonesian-language reviews collected through web scraping from the Google Play Store in 2025. Sentiment labels were automatically determined based on user ratings, where ratings of 4–5 were categorized as positive and ratings below 4 as negative, with an initial distribution of 2,295 positive and 556 negative reviews before balancing using SMOTE–Tomek Links. Preprocessing steps included case folding, tokenization, stopword removal, and stemming using Sastrawi, while feature weighting was performed with unigram TF-IDF. The Combined Classifier merged the probability scores from the SVM, KNN, and RF models to produce the final prediction. Evaluation was conducted using 5-Fold Cross Validation with accuracy, precision, recall, F1-score, and ROC-AUC as evaluation metrics. The results show that RF and the Combined Classifier achieved the best performance with 85% accuracy, 87% precision, 85% recall, 86% F1-score, and 0.91 ROC-AUC, while SVM and the Voting Classifier ranked in the middle and KNN ranked the lowest. These findings confirm that ensemble learning, particularly the Combined Classifier, effectively improves the accuracy and stability of review classification compared to individual methods.

This research aims to categorize survey data to determine the level of satisfaction with the services provided by the village government as a public service provider. Villages or sub-districts currently offer services in response to community demand, although only partially or as efficiently as possible. The data collection technique used was distributing questionnaires to the village community. The method used for classification is the machine learning method. Before the classification process, feature selection is carried out at the data pre-processing stage using Particle Swarm Optimization (PSO), which has been proven to increase the accuracy of the classification values. The classification methods employed include Decision Tree (DT), Naive Bayes, Support Vector Machine (SVM), and K-Nearest Neighbor (KNN) algorithms for classification purposes. This study achieves the maximum level of accuracy in decision tree classification, attaining an accuracy rate of 97.74%. Subsequently, the KNN algorithm achieved an accuracy of 77.90%, the Nave Bayes algorithm achieved 64.4%, and the SVM algorithm, which yielded the lowest accuracy value, achieved 59.90%. Following the application of Particle Swarm Optimization (PSO) for optimization, the accuracy of the SVM and KNN algorithms improved to 98.3%. The Decision Tree algorithm achieved a value of 97.77%, while the Naive Bayes technique yielded a value of 69.30%.

The aim of this article is to measure the performance metrics of an accuracy, sensitivity and specificity of the Novel Support Vector Machine (SVM) algorithm for diabetics detection and compared with a K Nearest Neighbour (KNN) algorithm. Materials and Methods: A total of 768 samples are collected from diabetics detection datasets found in kaggle. These samples are divided into a training dataset (n=500) and test dataset (n=268). Results: By comparing the Novel Support Vector Machine with KNN. The SVM has achieved better accuracy and specificity than the KNN and the KNN has better Sensitivity than the SVM algorithm. The output values of accuracy, specificity and sensitivity of the SVM are 79%, 93% and 58%. The output values of accuracy, specificity and sensitivity of the KNN algorithm are 63%, 39% and 100%. The significance value is Pi0.05. The G power is taken as 0.8. Conclusion: The output values of accuracy, specificity and sensitivity of the Novel SVM are 79%, 93% and 58%. The output values of accuracy, specificity and sensitivity of the KNN algorithm are 63%, 39% and 100

Air pollution has become one of the biggest environmental challenges worldwide, and Jakarta, the capital city of Indonesia, is no exception. Jakarta, as one of the most populous cities in the world, faces serious problems in ensuring healthy air quality for its residents. The impact of this air pollution is not only limited to human health, but also damages the environment as a whole, including plants and aquatic ecosystems. In an effort to address this issue, many studies have been conducted to develop prediction models that can provide estimates of air quality levels in Jakarta City. Two modeling models that can be used in this context are Support Vector Machine (SVM) and K-Nearest Neighbors (KNN). This study aims to compare the performance of the SVM algorithm model with the KNN algorithm in the classification of air quality in Jakarta City. Data mining is the art and science of discovering knowledge, insights, and patterns in data based on the CRISP -DM (Cross Industry Standard Process For Data Mining) methodology. The data source in this study is the Jakarta air pollution standard index (ISPU) data obtained on the satudata.jakarta.go.id website. This study compares the accuracy of the Jakarta City air quality classification on the Support vector Machine (SVM) and K-Nearest Neighbor (KNN) algorithms using python. Comparison results are determined by the level of accuracy and score of the confusion matrix. Classification results are presented in the form of a Graphic User Interface with media interface. The comparison of classification algorithms on two models in data mining shows that the Support Vector Machine (SVM) algorithm is superior to K-Nearest Neighbor (KNN). This is evident from the higher accuracy rate in SVM, especially with the use of the Rbf kernel which reaches 97.05%, compared to KNN which has an accuracy of 94.74% with parameters p = 1 and k = 5. In addition, SVM also shows a higher correct prediction value compared to KNN. In a 1-year time span the overall quality may be quite good, with moderate quality at more than equal to 50 to 100. However, control is still needed for the unhealthy category areas.

Rice is the primary food source for the Indonesian population, making it a priority commodity in Indonesia. Rice production plays a significant role in Indonesia's economic development, with high-yield rice varieties being crucial for enhancing national rice output. Ensuring food security requires the selection of superior rice varieties with optimal quality. This study evaluates various high-yield rice varieties, including INPARA, INPARI, INPAGO, and HIPA, based on characteristic data collected in 2023. Machine learning algorithms, increasingly central to data analysis, were applied, leveraging labeled data suitable for supervised learning methods. During the pre-processing stage, it was determined that the data did not meet the linearity assumption. Thus the Support Vector Machine (SVM) algorithm was modified with the Radial Basis Function (RBF) kernel to better handle non-linear data. Additionally, the K-Nearest Neighbor (KNN) algorithm, a traditional method, was used for comparison. The results indicate that SVM with the RBF kernel achieved faster processing times and the accuracy value reaches 96%, nearly 10% higher than the KNN algorithm.

This study compares the K-Nearest Neighbor (KNN) and Support Vector Machine (SVM) algorithms in predicting customer satisfaction at Warung Makan Indomie (Warmindo). The research process consists of four stages, namely: data collection, data processing, model formation, and model evaluation. This study aims to compare the performance of two classification algorithms, namely K-Nearest Neighbor (KNN) and Support Vector Machine (SVM), in predicting customer satisfaction levels based on survey data. The evaluation was carried out using accuracy metrics and classification reports to determine the level of precision, recall, and f1-score of each algorithm. The evaluation results show that both algorithms have the same accuracy of 70%. KNN excels in f1-score in class 2 (0.70), while SVM excels in precision in class 2 (0.79). with an average score of both algorithms being 0.61. These results indicate that both KNN and SVM are feasible to use, depending on the performance priority per class

Purpose: Listening to music has a great impact on people's emotions and would change brain activity. In other words, music-induced emotions are trackable in electrical brain activities. Therefore, Electroencephalography can be a suitable tool to detect these induced emotions. The present study attempted to use electroencephalography in to recognize four types of emotions (happy, relaxing, stressful, and sad) induced in response to listening to music excerpts, using three classifiers.
 Materials and Methods: In this empirical study, electroencephalography signals were collected from 20 participants, as they were listening to pieces of selected music. The collected data were then pre-processed, and 28 linear and nonlinear features for recognizing the aforementioned emotions were extracted. Feature-space components were then reduced through a principal components analysis. Finally, the first ten components of feature-space were used as input for three classifiers based on Neural Network (NN), K-Nearest Neighbors (KNN), and Support Vector Machine (SVM) algorithms to identify the induced emotions.
 Results: The outputs showed that the suggested method was well capable of emotion recognition. Evaluating the music excerpts, on the self-assessment manikin scale, demonstrated that the labeling of the music tracks was accurate. The highest accuracy found among NN, KNN, and SVM algorithms were %84, %84, and %89 for happy emotions, respectively.
 Conclusion: The findings of this study provide useful insights into emotion classification and brain behavior related to induced emotion extraction. Happiness was the most recognizable emotion and the support vector machine had the highest performance among the classifiers. In the end, the outcomes of the proposed method demonstrate that this system is better than the previous research in EEG-based emotion recognition.

Classification model for blast furnace status based on multi-source information

Background: Despite major advances in diagnoses and treatments, cardiovascular disease (CVD) continues to be the leading cause of morbidity and mortality worldwide. To improve and optimize CVD results, AI techniques have the potential to radically revolutionize the way we practice cardiology, especially in imaging and provide with new tools to interpret data and make clinical decisions. Aim: Establishing strategies are necessary to improve the diagnosis and treatment of CVD in the future. Nowadays, artificial intelligence (AI) may have the potential to solve this problem. The application of AI in heart diseases aims to facilitate the detection of radiology patients. Methods: The machine learning algorithms used in this study are K-Nearest Neighbor (KNN), Support Vector Machines (SVM), Naive Bayes, and Decision Tree. In our study, a total of 600 patients, 300 female and 300 male, who were diagnosed with IHD as a result of the findings obtained from the reports of the patients who underwent CAG in the Fırat University Hospital were included in our study. Accuracy, precision, sensitivity, specificity, and F1-score performance values were obtained by the classification. Results: Among the algorithms we have used, KNN had the highest success rate. It was followed by SVM in the second success rate. The success rate of RCA was 83% in KNN, and it was 75% in SVM. While the success rate of LCx in KNN was 76%, it was 68% in SVM. Similarly, the success rate of LAD in KNN was 73%, and it was 71% in SVM. Conclusion: The demand for CAG will be rising in the coming years, owing to an increase in HR. Therefore, new strategies will be sought to reduce the duration of CAG. We consider the application of AI in routine clinical practice. Keywords: Right coronary artery, Left coronary artery, Stenosis, Artificial intelligence

Sentiment analysis has become an important approach in understanding user opinions towards digital applications, especially on review platforms such as the Google Play Store. This study aims to compare the performance of three popular classification algorithms, namely K-Nearest Neighbor (KNN), Support Vector Machine (SVM), and Naive Bayes, in classifying sentiment in Traveloka application reviews. The methods used include collecting user review data from Google Play, preprocessing stages such as tokenization and stopword removal, and applying the three algorithms to the cleaned data. The evaluation was carried out using accuracy, precision, recall, and f1-score metrics. The dataset used consisted of 5000 review data that were evenly divided between positive and negative sentiments. The results showed that the SVM algorithm provided the best performance with an accuracy of 88%, followed by Naive Bayes at 86%, and KNN at 87%. The conclusion of this study states that SVM is more reliable in handling text-based sentiment analysis in the context of mobile application reviews. These findings are expected to be a reference in developing a more accurate sentiment analysis system for business needs and future research.

The aim is to predict movie rating using Support Vector Machine Algorithm and K-Nearest Neighbors Algorithm. An aggregate of 392 examples were gathered from film datasets and these datasets were taken fromkaggle dataset. Two experimental calculations were performed, one with K-Nearest Neighbors algorithm and another with Novel Support Vector Machine algorithm. Sample size of N=5 is taken for both algorithms. The computation processes were executed and verified for exactness. SPSS was used for predicting significance value of the dataset considering G-Power value as 80%. Novel Support Vector Machine calculation was applied and it had accomplished mean accuracy of 91.8% when compared with mean accuracy of 53% of K-Nearest Neighbors algorithm. The outcomes were obtained with a significance value of 0.03 (p<0.05). A unique approach model is affirmed to have higher exactness than K-Nearest Neighbors calculation.

Text mining is a special case of data mining which explore unstructured or semi-structured text documents, to establish valuable patterns and rules that indicate trends and significant features about specific topics. Text mining has been in pattern recognition, predictive studies, sentiment analysis and statistical theories in many areas of research, medicine, financial analysis, social life analysis, and business intelligence. Text mining uses concept of natural language processing and machine learning. Machine learning algorithms have been used and reported to give great results, but their performance of machine learning algorithms is affected by factors such as dataset domain, number of classes, length of the corpus, and feature selection techniques used. Redundant attribute affects the performance of the classification algorithm, but this can be reduced by using different feature selection techniques and dimensionality reduction techniques. Feature selection is a data preprocessing step that chooses a subset of input variable while eliminating features with little or no predictive information. Feature selection techniques are Information gain, Term Frequency, Term Frequency-Inverse document frequency, Mutual Information, and Chi-Square, which can use a filters, wrappers, or embedded approaches. To get the most value from machine learning, pairing the best algorithms with the right tools and processes is necessary. Little research has been done on the effect of feature selection techniques on classification accuracy for pairing of these algorithms with the best feature selection techniques for optimal results. In this research, a text classification experiment was conducted using incident management dataset, where incidents were classified into their resolver groups. Support vector machine (SVM), K-Nearest Neighbors (KNN), Naïve Bayes (NB) and Decision tree (DT) machine learning algorithms were examined. Filtering approach was used on the feature selection techniques, with different ranking indices applied for optimal feature set and classification accuracy results analyzed. The classification accuracy results obtained using TF were, 88% for SVM, 70% for NB, 79% for Decision tree, and KNN had 55%, while Boolean registered 90%, 83%, 82% and 75%, for SVM, NB, DT, and KNN respectively. TF-IDF, had 91%, 83%, 76%, and 56% for SVM, NB, DT, and KNN respectively. The results showed that algorithm performance is affected by feature selection technique applied. SVM performed best, followed by DT, KNN and finally NB. In conclusion, presence of noisy data leads to poor learning performance and increases the computational time. The classifiers performed differently depending on the feature selection technique applied. For optimal results, the classifier that performed best together with the feature selection technique with the best feature subset should be applied for all types of data for accurate classification performance. Keywords: Text Classification, Supervised Machine Learning, Feature Selection DOI : 10.7176/JIEA/9-3-06 Publication date :May 31 st 2019

To investigate the value of a CT-based radiomics model in identification of Crohn's disease (CD) active phase and remission phase. CT images of 101 patients diagnosed with CD were retrospectively collected, which included 60 patients in active phase and 41 patients in remission phase. These patients were randomly divided into training group and test group at a ratio of 7 : 3. First, the lesion areas were manually delineated by the physician. Meanwhile, radiomics features were extracted from each lesion. Next, the features were selected by t-test and the least absolute shrinkage and selection operator regression algorithm. Then, several machine learning models including random forest (RF), extreme gradient boosting (XGBoost), support vector machine (SVM), logistic regression (LR) and K-nearest neighbor (KNN) algorithms were used to construct CD activity classification models respectively. Finally, the soft-voting mechanism was used to integrate algorithms with better effects to perform two classifications of data, and the receiver operating characteristic curves were applied to evaluate the diagnostic value of the models. Both on the training set and the test set, AUC of the five machine learning classification models reached 0.85 or more. The ensemble soft-voting classifier obtained by using the combination of SVM, LR and KNN could better distinguish active CD from CD remission. For the test set, AUC was 0.938, and accuracy, sensitivity, and specificity were 0.903, 0.911, and 0.892, respectively. This study demonstrated that the established radiomics model could objectively and effectively diagnose CD activity. The integrated approach has better diagnostic performance.

According to statistics from the Global Burden of Cancer Study (Globocon) of the World Health Organization (WHO), cancer, particularly breast cancer, is a severe health issue in Indonesia with 68,858 new cases and 22,000 deaths recorded in 2020. Ultrasonography (USG) technology is acknowledged as one of the potentials to support early detection, which is vital in reducing mortality from breast cancer. This study focuses on classifying ultrasound images using the Support Vector Machine (SVM) algorithm, GLCM feature extraction, Min-Max normalization, and Mutual Information with SelectKBest Feature Selection. From several experiments using the SVM algorithm with various combinations of parameter values that have been set and different Tests, namely using a Train/Test Split with a proportion of 80/20 and K-Fold Cross Validation, it shows that the SVM algorithm is capable of classifying ultrasound images of breast cancer. into two categories (Benign Tumor and Malignant Tumor) with the same maximum accuracy of 79% after applying the SMOTE Balancing Data technique or without using the Balancing Data technique. As a result, the Support Vector Machine (SVM) algorithm has the potential to be an effective model for identifying breast cancer ultrasound images, both on data from the original set that has not been balanced and data from the set that has been balanced.