Farica Perdana Putri
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Farica Perdana Putri has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Abdul Q. M. Khaliq
Department of Mathematical Sciences, Middle Tennessee State University, Murfreesboro, USA
1 shared publication Abdulalem Ali
1 shared publication- Bryan Leonardo Supriyatna
Universitas Multimedia Nusantara
1 shared publication D.J. Owen Hoetama
Universitas Multimedia Nusantara
1 shared publication- Davin Ongkadinata
Universitas Multimedia Nusantara
1 shared publication Dennis Gunawan
Informatics Department Universitas, Multimedia Nusantara Tangerang, Indonesia
1 shared publication
Latest Publications
- Open Access
- 4 February 2026
- Published by Elsevier in Results in Engineering
- Vol. 29
Enhancing ReliefF for multi-label text classification via high-order label correlation
- 4 February 2026
- Published by Elsevier in Results in Engineering
- Vol. 29
Open AccessEnhancing ReliefF for multi-label text classification via high-order label correlation
- Open Access
- 1 December 2024
- Published by Institute of Advanced Engineering and Science in International Journal of Informatics and Communication Technology (IJ-ICT)
- Vol. 13 (3) , 344-353
Optimized support vector machine for sentiment analysis of game reviews
The rapid development of games has made game categories diverse, so there are many opinions about games that have been released. Sentiment analysis on game reviews is needed to attract potential players. Sentiment analysis is carried out using the support vector machine (SVM) and particle swarm optimization (PSO) algorithms. SVM training was conducted with a linear kernel, the ‘C’ value parameter was 10 resulting in an accuracy value of 97.28%. The SVM algorithm optimized using the PSO method produces an accuracy of 97.61% using the parameters c1 is 0.2, c2 is 0.5 and w is 0.6. Based on these results, sentiment analysis using PSO-based SVM optimization has been successfully carried out with an increase in accuracy of 0.33%. This game review has a sentiment value from neutral to positive so this game can be recommended to other players.
- 1 December 2024
- Published by Institute of Advanced Engineering and Science in International Journal of Informatics and Communication Technology (IJ-ICT)
- Vol. 13 (3) , 344-353
Open AccessOptimized support vector machine for sentiment analysis of game reviews
The rapid development of games has made game categories diverse, so there are many opinions about games that have been released. Sentiment analysis on game reviews is needed to attract potential players. Sentiment analysis is carried out using the support vector machine (SVM) and particle swarm optimization (PSO) algorithms. SVM training was conducted with a linear kernel, the ‘C’ value parameter was 10 resulting in an accuracy value of 97.28%. The SVM algorithm optimized using the PSO method produces an accuracy of 97.61% using the parameters c1 is 0.2, c2 is 0.5 and w is 0.6. Based on these results, sentiment analysis using PSO-based SVM optimization has been successfully carried out with an increase in accuracy of 0.33%. This game review has a sentiment value from neutral to positive so this game can be recommended to other players.
- Open Access
- 1 December 2022
- Published by Institute of Advanced Engineering and Science in IAES International Journal of Artificial Intelligence (IJ-AI)
- Vol. 11 (4) , 1596-1606
On searching the best mode for forex forecasting: bidirectional long short-term memory default mode is not enough
Presently, the Forex market has become the world’s largest financial market with more than US$5 trillion daily volume. Therefore, it attracts many researchers to learn its traded currency pairs characteristics and predict their future values. Here, we propose simple three layers Bidirectional long short-term memory (Bi-LSTM) networks for Forex forecasting with four different merge modes. Moreover, the proposed model is also compared to the conventional long short-term memory (LSTM) networks with the same architecture. Five major Forex currency pairs, namely AUD/USD, EUR/USD, GBP/USD, USD/CHF, and USD/JPY, with more than ten years of historical records are considered in this study. It is revealed from the experimental results that among four available merge modes, the concatenation mode as the default merge mode in Bi-LSTM networks is actually the less preferred mode for Forex forecasting (Root mean square error 0.30685517, mean absolute error 0.27442235, mean absolute percentage error 0.827108%). Moreover, Bi-LSTM average mode gets the highest R2 score that could achieve 89.579%. Therefore, the proposed three layers Bi-LSTM networks could provide a baseline result for developing a good trading strategy in Forex forecasting.
- 1 December 2022
- Published by Institute of Advanced Engineering and Science in IAES International Journal of Artificial Intelligence (IJ-AI)
- Vol. 11 (4) , 1596-1606
Open AccessOn searching the best mode for forex forecasting: bidirectional long short-term memory default mode is not enough
Presently, the Forex market has become the world’s largest financial market with more than US$5 trillion daily volume. Therefore, it attracts many researchers to learn its traded currency pairs characteristics and predict their future values. Here, we propose simple three layers Bidirectional long short-term memory (Bi-LSTM) networks for Forex forecasting with four different merge modes. Moreover, the proposed model is also compared to the conventional long short-term memory (LSTM) networks with the same architecture. Five major Forex currency pairs, namely AUD/USD, EUR/USD, GBP/USD, USD/CHF, and USD/JPY, with more than ten years of historical records are considered in this study. It is revealed from the experimental results that among four available merge modes, the concatenation mode as the default merge mode in Bi-LSTM networks is actually the less preferred mode for Forex forecasting (Root mean square error 0.30685517, mean absolute error 0.27442235, mean absolute percentage error 0.827108%). Moreover, Bi-LSTM average mode gets the highest R2 score that could achieve 89.579%. Therefore, the proposed three layers Bi-LSTM networks could provide a baseline result for developing a good trading strategy in Forex forecasting.
- Open Access
- 1 June 2020
- Published by Institute of Advanced Engineering and Science in Bulletin of Electrical Engineering and Informatics
- Vol. 9 (3) , 1183-1188
Quality and size assessment of quantized images using K-Means++ clustering
In this paper, an amended K-Means algorithm called K-Means++ is implemented for color quantization. K-Means++ is an improvement to the K-Means algorithm in order to surmount the random selection of the initial centroids. The main advantage of K-Means++ is the centroids chosen are distributed over the data such that it reduces the sum of squared errors (SSE). K-Means++ algorithm is used to analyze the color distribution of an image and create the color palette for transforming to a better quantized image compared to the standard K-Means algorithm. The tests were conducted on several popular true color images with different numbers of K value: 32, 64, 128, and 256. The results show that K-Means++ clustering algorithm yields higher PSNR values and lower file size compared to K-Means algorithm; 2.58% and 1.05%. It is envisaged that this clustering algorithm will benefit in many applications such as document clustering, market segmentation, image compression and image segmentation because it produces accurate and stable results.
- 1 June 2020
- Published by Institute of Advanced Engineering and Science in Bulletin of Electrical Engineering and Informatics
- Vol. 9 (3) , 1183-1188
Open AccessQuality and size assessment of quantized images using K-Means++ clustering
In this paper, an amended K-Means algorithm called K-Means++ is implemented for color quantization. K-Means++ is an improvement to the K-Means algorithm in order to surmount the random selection of the initial centroids. The main advantage of K-Means++ is the centroids chosen are distributed over the data such that it reduces the sum of squared errors (SSE). K-Means++ algorithm is used to analyze the color distribution of an image and create the color palette for transforming to a better quantized image compared to the standard K-Means algorithm. The tests were conducted on several popular true color images with different numbers of K value: 32, 64, 128, and 256. The results show that K-Means++ clustering algorithm yields higher PSNR values and lower file size compared to K-Means algorithm; 2.58% and 1.05%. It is envisaged that this clustering algorithm will benefit in many applications such as document clustering, market segmentation, image compression and image segmentation because it produces accurate and stable results.
- Open Access
- 20 December 2019
- Published by Association for Computing Machinery (ACM)
- p. 468-472
Designing Intelligent Personalized Chatbot for Hotel Services
- 20 December 2019
- Published by Association for Computing Machinery (ACM)
- p. 468-472
Open AccessDesigning Intelligent Personalized Chatbot for Hotel Services
- Open Access
- 19 March 2019
- Published by Universitas Multimedia Nusantara in Ultima Computing : Jurnal Sistem Komputer
- Vol. 10 (2) , 59-64
Algoritma Fisher-Yates Shuffle dan Flood Fill sebagai Maze Generator pada Game Labirin
Maze game is an interesting game and used to spend time. However, in the maze game, the level used forthis game still uses static levels. Static levels make the maze shape stay the same if we play the same level. Thus, players will quickly feel bored because it finds the same complexity. Maze generator is a static level problem solution on the maze game. This research uses Fisher-Yates Shuffle algorithm and Flood Fill algorithm to make maze generator. Fisher-Yates Shuffle algorithm is used for wall position randomization and Flood Fill algorithm to keep the maze results to remain resolved. The results of the application implementation yielded 30 mazes and were tested using the Hamming Distance algorithm, yielding that the result of the maze formed is always different. The average percentage rate difference produced 48% each time the maze was formed. The results of the maze that was formed performed perfect maze checking with the result of 83.33% percentage. Index Terms— Fisher-Yates Shuffle, Flood Fill, MazeGenerator, Hamming Distance
- 19 March 2019
- Published by Universitas Multimedia Nusantara in Ultima Computing : Jurnal Sistem Komputer
- Vol. 10 (2) , 59-64
Open AccessAlgoritma Fisher-Yates Shuffle dan Flood Fill sebagai Maze Generator pada Game Labirin
Maze game is an interesting game and used to spend time. However, in the maze game, the level used forthis game still uses static levels. Static levels make the maze shape stay the same if we play the same level. Thus, players will quickly feel bored because it finds the same complexity. Maze generator is a static level problem solution on the maze game. This research uses Fisher-Yates Shuffle algorithm and Flood Fill algorithm to make maze generator. Fisher-Yates Shuffle algorithm is used for wall position randomization and Flood Fill algorithm to keep the maze results to remain resolved. The results of the application implementation yielded 30 mazes and were tested using the Hamming Distance algorithm, yielding that the result of the maze formed is always different. The average percentage rate difference produced 48% each time the maze was formed. The results of the maze that was formed performed perfect maze checking with the result of 83.33% percentage. Index Terms— Fisher-Yates Shuffle, Flood Fill, MazeGenerator, Hamming Distance
- Open Access
- 1 December 2018
- Published by Science Publishing Corporation in International Journal of Engineering & Technology
- Vol. 7 (4.44) , 198-202
Skew detection based on vertical projection in latin character recognition of text document image
The accuracy of Optical Character Recognition is deeply affected by the skew of the image. Skew detection & correction is one of the steps in OCR preprocessing to detect and correct the skew of document image. This research measures the effect of Combined Vertical Projection skew detection method to the accuracy of OCR. Accuracy of OCR is measured in Character Error Rate, Word Error Rate, and Word Error Rate (Order Independent). This research also measures the computational time needed in Combined Vertical Projection with different iteration. The experiment of Combined Vertical Projection is conducted by using iteration 0.5, 1, and 2 with rotation angle within -10 until 10 degrees. The experiment results show that the use of Combined Vertical Projection could lower the Character Error Rate, Word Error Rate, and Word Error Rate (Order Independent) up to 35.53, 34.51, and 32.74 percent, respectively. Using higher iteration value could lower the computational time but also decrease the accuracy of OCR.
- 1 December 2018
- Published by Science Publishing Corporation in International Journal of Engineering & Technology
- Vol. 7 (4.44) , 198-202
Open AccessSkew detection based on vertical projection in latin character recognition of text document image
The accuracy of Optical Character Recognition is deeply affected by the skew of the image. Skew detection & correction is one of the steps in OCR preprocessing to detect and correct the skew of document image. This research measures the effect of Combined Vertical Projection skew detection method to the accuracy of OCR. Accuracy of OCR is measured in Character Error Rate, Word Error Rate, and Word Error Rate (Order Independent). This research also measures the computational time needed in Combined Vertical Projection with different iteration. The experiment of Combined Vertical Projection is conducted by using iteration 0.5, 1, and 2 with rotation angle within -10 until 10 degrees. The experiment results show that the use of Combined Vertical Projection could lower the Character Error Rate, Word Error Rate, and Word Error Rate (Order Independent) up to 35.53, 34.51, and 32.74 percent, respectively. Using higher iteration value could lower the computational time but also decrease the accuracy of OCR.