Hilman Ferdinandus Pardede
Indonesian Institute of Sciences

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

Prediction Of Myers-Briggs Type Indicator Personality Using Long Short-Term Memory Mawadatul Maulidah; Hilman Ferdinandus Pardede
Jurnal Elektronika dan Telekomunikasi Vol 21, No 2 (2021)
Publisher : LIPI Press

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.14203/jet.v21.104-111

Abstract

Personality is defined as the mix of features and qualities that make up an individual's particular character, including thoughts, feelings, and behaviors. With the rapid development of technology, personality computing is becoming a popular research field by providing users with personalization. Many researchers have used social media data to automatically predict personality. This research uses a public dataset from Kaggle, namely the Myers-Briggs Personality Type Dataset. The purpose of this study is to predict the accuracy and F1-score values so that the performance for predicting and classifying Myers–Briggs Type Indicator (MBTI) personality can work optimally by using attributes from the MBTI dataset, namely posts and types. Predictive accuracy analysis was carried out using the Long Short-Term Memory (LSTM) algorithm with random oversampling technique with the Imblearn library for MBTI personality type prediction and comparing the performance of the method proposed in this study with other popular machine learning algorithms. Experiments show that the LSTM model using the RMSprop optimizer and learning speed of 10-3 provides higher performance in terms of accuracy while for the F1-score the LSTM model using the RMSprop Optimizer and learning speed of 10-2 gives a higher value than the proposed machine learning algorithm so that the model MBTI dataset using LSTM with random oversampling can help in identifying the MBTI personality type.
Customer Decision Prediction Using Deep Neural Network on Telco Customer Churn Data Hiya Nalatissifa; Hilman Ferdinandus Pardede
Jurnal Elektronika dan Telekomunikasi Vol 21, No 2 (2021)
Publisher : LIPI Press

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.14203/jet.v21.122-127

Abstract

Customer churn is the most important problem in the business world, especially in the telecommunications industry, because it greatly influences company profits. Getting new customers for a company is much more difficult and expensive than retaining existing customers. Machine learning, part of data mining, is a sub-field of artificial intelligence widely used to make predictions, including predicting customer churn. Deep neural network (DNN) has been used for churn prediction, but selecting hyperparameters in modeling requires more time and effort, making the process more challenging for the researcher. Therefore, the purpose of this study is to propose a better architecture for the DNN algorithm by using a hard tuner to obtain more optimal hyperparameters. The tuning hyperparameter used is random search in determining the number of nodes in each hidden layer, dropout, and learning rate. In addition, this study also uses three variations of the number of hidden layers, two variations of the activation function, namely rectified linear unit (ReLu) and Sigmoid, then uses five variations of the optimizer (stochastic gradient descent (SGD), adaptive moment estimation (Adam), adaptive gradient algorithm (Adagrad), Adadelta, and root mean square propagation (RMSprop)). Experiments show that the DNN algorithm using hyperparameter tuning random search produces a performance value of 83.09 % accuracy using three hidden layers, the number of nodes in each hidden layer is [20, 35, 15], using the RMSprop optimizer, dropout 0.1, the learning rate is 0.01, with the fastest tuning time of 21 seconds. Better than modeling using k-nearest neighbor (K-NN), random forest (RF), and decision tree (DT) as comparison algorithms.