cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
-
Contact Email
-
Phone
-
Journal Mail Official
-
Editorial Address
-
Location
Kota yogyakarta,
Daerah istimewa yogyakarta
INDONESIA
International Journal of Advances in Intelligent Informatics
Published by Universitas Ahmad Dahlan
ISSN : 24426571     EISSN : 25483161     DOI : 10.26555
Core Subject : Science,
Computer Science & IT
International journal of advances in intelligent informatics (IJAIN) e-ISSN: 2442-6571 is a peer reviewed open-access journal published three times a year in English-language, provides scientists and engineers throughout the world for the exchange and dissemination of theoretical and practice-oriented papers dealing with advances in intelligent informatics. All the papers are refereed by two international reviewers, accepted papers will be available on line (free access), and no publication fee for authors.
Arjuna Subject : -
Articles 330 Documents
 15   16   17   18   19 
An improved K-Nearest neighbour with grasshopper optimization algorithm for imputation of missing data Nadzurah Zainal Abidin; Amelia Ritahani Ismail
International Journal of Advances in Intelligent Informatics Vol 7, No 3 (2021): November 2021
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26555/ijain.v7i3.696

Abstract

K-nearest neighbors (KNN) has been extensively used as imputation algorithm to substitute missing data with plausible values. One of the successes of KNN imputation is the ability to measure the missing data simulated from its nearest neighbors robustly. However, despite the favorable points, KNN still imposes undesirable circumstances. KNN suffers from high time complexity, choosing the right k, and different functions. Thus, this paper proposes a novel method for imputation of missing data, named KNNGOA, which optimized the KNN imputation technique based on the grasshopper optimization algorithm. Our GOA is designed to find the best value of k and optimize the imputed value from KNN that maximizes the imputation accuracy. Experimental evaluation for different types of datasets collected from UCI, with various rates of missing values ranging from 10%, 30%, and 50%. Our proposed algorithm has achieved promising results from the experiment conducted, which outperformed other methods, especially in terms of accuracy.
A data mining approach for classification of traffic violations types Nor Aqilah Othman; Cik Feresa Mohd Foozy; Aida Mustapha; Salama A Mostafa; Shamala Palaniappan; Shafiza Ariffin Kashinath
International Journal of Advances in Intelligent Informatics Vol 7, No 3 (2021): November 2021
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26555/ijain.v7i3.708

Abstract

Traffic summons, also known as traffic tickets, is a notice issued by a law enforcement official to a motorist, who is a person who drives a car, lorry, or bus, and a person who rides a motorcycle. This study is set to perform a comparative experiment to compare the performance of three classification algorithms (Naive Bayes, Gradient Boosted Trees, and Deep Learning algorithm) in classifying the traffic violation types. The performance of all the three classification models developed in this work is measured and compared. The results show that the Gradient Boosted Trees and Deep Learning algorithm have the best value in accuracy and recall but low precision. Naïve Bayes, on the other hand, has high recall since it is a picky classifier that only performs well in a dataset that is high in precision. This paper’s results could serve as baseline results for investigations related to the classification of traffic violation types. It is also helpful for authorities to strategize and plan ways to reduce traffic violations among road users by studying the most common traffic violation types in an area, whether a citation, a warning, or an ESERO (Electronic Safety Equipment Repair Order).
Cable fault classification in ADSL copper access network using machine learning Nurul Bashirah Ghazali; Dang Fillatina Hashim; Fauziahanim Che Seman; Khalid Isa; Khairun Nidzam Ramli; Zuhairiah Zainal Abidin; Saizalmursidi Md Mustam; Mohammed Al Haek
International Journal of Advances in Intelligent Informatics Vol 7, No 3 (2021): November 2021
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26555/ijain.v7i3.488

Abstract

Asymmetrical Digital Subscriber Line (ADSL) is the technology widely deployed worldwide, but its performance may be limited with respect to its intrinsic. The nature of the copper cable causes it to be more susceptible to signal degradation and faulty line. Common ADSL line faults are short-wired fault, open-wired fault, bridge taps, and uneven pair. However, ADSL technology is still one of the most established networks, and users in the suburban area still depend on the technology to access the internet service. This paper discussed and compared a machine learning algorithm based on Decision Trees (J48), K-Nearest Neighbor, Multi-level Perceptron, Naïve Bayes, Random Forest, and Sequential Minimal Optimization (SMO) for ADSL line impairment that affects the line operation performance concerning their percentage of accuracy. Resulting from classifications done using algorithms as mentioned above, the random forest algorithm gives the highest overall accuracy for the ADSL line impairment dataset. The best algorithm for classifying DSL line impairment is chosen based on the highest accuracy percentage. The accomplishment classification of fault type in the ADSL copper access network project may benefit the telecommunication network provider by remotely assessing the network condition rather than on-site.
An extended approach of weight collective influence graph for detection influence actor Galih Hendro Martono; Azhari Azhari; Khabib Mustofa
International Journal of Advances in Intelligent Informatics Vol 8, No 1 (2022): March 2022
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26555/ijain.v8i1.800

Abstract

Over the last decade, numerous methods have been developed to detect the influential actors of hate speech in social networks, one of which is the Collective Influence (CI) method. However, this method is associated with unweighted datasets, which makes it inappropriate for social media, significantly using weight datasets. This study proposes a new CI method called the Weighted Collective Influence Graph (WCIG), which uses the weights and neighbor values to detect the influence of hate speech. A total of 49, 992 Indonesian tweets were and extracted from Indonesian Twitter accounts, from January 01 to January 22, 2021. The data collected are also used to compare the results of the proposed WCIG method to determine the influential actors in the dissemination of information. The experiment was carried out two times using parameters ∂=2 and ∂=4. The results showed that the usernames bernacleboy and zack_rockstar are influential actors in the dataset. Furthermore, the time needed to process WCIG calculations on HPC is 34-75 hours because the larger the parameter used, the greater the processing time.
An approach for linguistic multi-attribute decision making based on linguistic many-valued logic Anh Phuong Le; Hoai Nhan Tran; Thi Uyen Thi Nguyen; Dinh Khang Tran
International Journal of Advances in Intelligent Informatics Vol 8, No 1 (2022): March 2022
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26555/ijain.v8i1.820

Abstract

There are various types of multi-attribute decision-making (MADM) problems in our daily lives and decision-making problems under uncertain environments with vague and imprecise information involved. Therefore, linguistic multi-attribute decision-making problems are an important type studied extensively. Besides, it is easier for decision-makers to use linguistic terms to evaluate/choose among alternatives in real life. Based on the theoretical foundation of the Hedge algebra and linguistic many-valued logic, this study aims to address multi-attribute decision-making problems by linguistic valued qualitative aggregation and reasoning method. In this paper, we construct a finite monotonous Hedge algebra for modeling the linguistic information related to MADM problems and use linguistic many-valued logic for deducing the outcome of decision making. Our method computes directly on linguistic terms without numerical approximation. This method takes advantage of linguistic information processing and shows the benefit of Hedge algebra.
Machine learning for the prediction of phenols cytotoxicity Latifa Douali
International Journal of Advances in Intelligent Informatics Vol 8, No 1 (2022): March 2022
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26555/ijain.v8i1.748

Abstract

Quantitative structure-activity relationships (QSAR) are relevant techniques that assist biologists and chemists in accelerating the drug design process and help understanding many biological and chemical mechanisms. Using classical statistical methods may affect the accuracy and the reliability of the developed QSAR models. This work aims to use a machine learning approach to establish a QSAR model for phenols cytotoxicity prediction. This issue concern many chemists and biologists. In this investigation, the dataset is diverse, and the cytotoxicity data are sparse. Multi-component description of the compounds has then been considered. A set of molecular descriptors fed the deep neural network (DNN) and served to train the DNN. The established DNN model was able to predict the cytotoxicity of the phenols at high precision. The correlation coefficient at the fitting stage was higher than other statistical methods reported in the literature or developed in the present work, specifically multiple linear regression (MLR) and shallow artificial neural networks (ANN), and was equal to 0.943. The predictive capability of the model, as estimated by the coefficient of determination on an external predictive dataset, was significantly high and was about 0.739. This finding could help implement many molecular descriptors relevant to describing the compounds, representing the effects governing the phenols' cytotoxicity toward Tetrahymena pyriformis, avoiding overfitting and outlier exclusion.
Prediction of player position for talent identification in association netball: a regression-based approach Nur Hazwani Jasni; Aida Mustapha; Siti Solehah Tenah; Salama A Mostafa; Nazim Razali
International Journal of Advances in Intelligent Informatics Vol 8, No 1 (2022): March 2022
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26555/ijain.v8i1.707

Abstract

Among the challenges in industrial revolutions, 4.0 is managing organizations’ talents, especially to ensure the right person for the position can be selected. This study is set to introduce a predictive approach for talent identification in the sport of netball using individual player qualities in terms of physical fitness, mental capacity, and technical skills. A data mining approach is proposed using three data mining algorithms, which are Decision Tree (DT), Neural Network (NN), and Linear Regressions (LR). All the models are then compared based on the Relative Absolute Error (RAE), Mean Absolute Error (MAE), Relative Square Error (RSE), Root Mean Square Error (RMSE), Coefficient of Determination (R2), and Relative Square Error (RSE). The findings are presented and discussed in light of early talent spotting and selection. Generally, LR has the best performance in terms of MAE and RMSE as it has the lowest values among the three models.
Portfolio optimization based on self-organizing maps clustering and genetics algorithm Fajri Farid; Dedi Rosadi
International Journal of Advances in Intelligent Informatics Vol 8, No 1 (2022): March 2022
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26555/ijain.v8i1.587

Abstract

In this modern era, gaining additional income is necessary to fulfill daily needs since inflation is unavoidable. Investing in stocks can give passive income to help people deal with the increasing prices of necessities. However, selecting stocks and constructing a portfolio is the major problem in investing. This research will illustrate the stock selection method and the optimization method for optimizing the portfolio. Stock selection is carried out by clustering using Self-organizing Maps (SOM). Clustering will show the best stocks formed for a portfolio to be optimized. The best stocks that have the best performance are selected from each cluster for the portfolio. The best performance of the stock can be determined using the Sharpe Ratio. Optimization will be carried out using a Genetic Algorithm. The optimization is carried out using software R i386 3.6.1. The optimization results are then compared to the Markowitz Theory to show which method is better. The expected return on the portfolio generated using Genetic Algorithm and Markowitz Theory are 3.348458 and 3.347559975, respectively. While, the value of the Sharpe Ratio is 0.1393076 and 0.13929785, respectively. Based on the results, the best performance of the portfolio is the portfolio produced using Genetic Algorithm with the greater value of the Sharpe Ratio. Furthermore, the Genetics Algorithm optimization is more optimal than the Markowitz Theory.
The mortality modeling of covid-19 patients using a combined time series model and evolutionary algorithm Imam Tahyudin; Rizki Wahyudi; Wiga Maulana; Hidetaka Nambo
International Journal of Advances in Intelligent Informatics Vol 8, No 1 (2022): March 2022
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26555/ijain.v8i1.669

Abstract

COVID-19 pandemics for as long as two years ago since 2019 gives many insights into various aspects, including scientific development. One of them is the fundamental research of computer science. This research aimed to construct the best model of COVID-19 patients’ mortality and obtain less prediction errors. We performed the combination methods of time series, SARIMA, and Evolutionary algorithm, PARCD, to predict male patients who died because of COVID-19 in the USA, containing 1.008 data. So, this research proposed that SARIMA-PARCD has a powerful combination for addressing the complex problem in a dataset. The prediction error of SARIMA-PARCD was compared with other methods, i.e., SARIMA, LSTM, and the combination of SARIMA-LSTM. The result showed that the SARIMA-PARCD has the smallest MSE value of 0.0049. Therefore, the proposed method is competitive to implement in other cases with similar characteristics. This combination is robust for solving linear and non-linear problems.
Rayleigh quotient with bolzano booster for faster convergence of dominant eigenvalues M Zainal Arifin; Ahmad Naim Che Pee; Sarni Suhaila Rahim; Aji Prasetya Wibawa
International Journal of Advances in Intelligent Informatics Vol 8, No 1 (2022): March 2022
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26555/ijain.v8i1.718

Abstract

Computation ranking algorithms are widely used in several informatics fields. One of them is the PageRank algorithm, recognized as the most popular search engine globally. Many researchers have improvised the ranking algorithm in order to get better results. Recent research using Rayleigh Quotient to speed up PageRank can guarantee the convergence of the dominant eigenvalues as a key value for stopping computation. Bolzano's method has a convergence character on a linear function by dividing an interval into two intervals for better convergence. This research aims to implant the Bolzano algorithm into Rayleigh for faster computation. This research produces an algorithm that has been tested and validated by mathematicians, which shows an optimization speed of a maximum 7.08% compared to the sole Rayleigh approach. Analysis of computation results using statistics software shows that the degree of the curve of the new algorithm, which is Rayleigh with Bolzano booster (RB), is positive and more significant than the original method. In other words, the linear function will always be faster in the subsequent computation than the previous method.

Page 17 of 33 | Total Record : 330

 15   16   17   18   19 

Filter by Year

2015 2026


Reset
Filter By Issues
All Issue Vol 12, No 1 (2026): February 2026 Vol 11, No 4 (2025): November 2025 Vol 11, No 3 (2025): August 2025 Vol 11, No 2 (2025): May 2025 Vol 11, No 1 (2025): February 2025 Vol 10, No 3 (2024): August 2024 Vol 10, No 2 (2024): May 2024 Vol 10, No 1 (2024): February 2024 Vol 9, No 3 (2023): November 2023 Vol 9, No 2 (2023): July 2023 Vol 9, No 1 (2023): March 2023 Vol 8, No 3 (2022): November 2022 Vol 8, No 2 (2022): July 2022 Vol 8, No 1 (2022): March 2022 Vol 7, No 3 (2021): November 2021 Vol 7, No 3 (2021): November 2021 (Issue in Progress) Vol 7, No 2 (2021): July 2021 (Issue in Progess) Vol 7, No 2 (2021): July 2021 Vol 7, No 1 (2021): March 2021 Vol 6, No 3 (2020): November 2020 Vol 6, No 2 (2020): July 2020 Vol 6, No 1 (2020): March 2020 Vol 5, No 3 (2019): November 2019 Vol 5, No 2 (2019): July 2019 Vol 5, No 1 (2019): March 2019 Vol 4, No 3 (2018): November 2018 Vol 4, No 2 (2018): July 2018 Vol 4, No 1 (2018): March 2018 Vol 3, No 3 (2017): November 2017 Vol 3, No 2 (2017): July 2017 Vol 3, No 1 (2017): March 2017 Vol 2, No 3 (2016): November 2016 Vol 2, No 2 (2016): July 2016 Vol 2, No 1 (2016): March 2016 Vol 1, No 3 (2015): November 2015 Vol 1, No 2 (2015): July 2015 Vol 1, No 1 (2015): March 2015 More Issue