Robiul Islam
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Robiul Islam has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
Anna Muratova
2 shared publicationsAbu Raihan M. Kamal
Department of CSE, Islamic University of Technology (IUT), Dhaka, Bangladesh
1 shared publication- Alexander Hramov
Plekhanov Russian University of Economics
1 shared publication - Andrey V. Andreev
Research Institute of Applied Artificial Intelligence and Digital Solutions, Plekhanov Russian University of Economics, Moscow, Russia
1 shared publication - Anna Muratova
National Research University Higher School of Economics
1 shared publication - Anwaar Ulhaq
Central Queensland University
1 shared publication
Latest Publications
- Open Access
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 124311-124348
Exploring the Relationship Between Brain Hemisphere States and Frequency Bands Through Classical Machine Learning and Deep Learning Optimization Techniques With Neurofeedback
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 124311-124348
Open AccessExploring the Relationship Between Brain Hemisphere States and Frequency Bands Through Classical Machine Learning and Deep Learning Optimization Techniques With Neurofeedback
- 28 May 2023
- Published by Springer Nature
- p. 277-288
An Analytic Hierarchy Process for Student Motivation
- 28 May 2023
- Published by Springer Nature
- p. 277-288
An Analytic Hierarchy Process for Student Motivation
- Open Access
- 23 November 2022
- Published by Elsevier in Procedia Computer Science
- Vol. 212, 358-367
Explainable machine learning for sequences of demographic statuses
- 23 November 2022
- Published by Elsevier in Procedia Computer Science
- Vol. 212, 358-367
Open AccessExplainable machine learning for sequences of demographic statuses
- Open Access
- 8 August 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (15) , 2819
Explainable Machine Learning Methods for Classification of Brain States during Visual Perception
The aim of this work is to find a good mathematical model for the classification of brain states during visual perception with a focus on the interpretability of the results. To achieve it, we use the deep learning models with different activation functions and optimization methods for their comparison and find the best model for the considered dataset of 31 EEG channels trials. To estimate the influence of different features on the classification process and make the method more interpretable, we use the SHAP library technique. We find that the best optimization method is Adagrad and the worst one is FTRL. In addition, we find that only Adagrad works well for both linear and tangent models. The results could be useful for EEG-based brain–computer interfaces (BCIs) in part for choosing the appropriate machine learning methods and features for the correct training of the BCI intelligent system.
- 8 August 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (15) , 2819
Open AccessExplainable Machine Learning Methods for Classification of Brain States during Visual Perception
The aim of this work is to find a good mathematical model for the classification of brain states during visual perception with a focus on the interpretability of the results. To achieve it, we use the deep learning models with different activation functions and optimization methods for their comparison and find the best model for the considered dataset of 31 EEG channels trials. To estimate the influence of different features on the classification process and make the method more interpretable, we use the SHAP library technique. We find that the best optimization method is Adagrad and the worst one is FTRL. In addition, we find that only Adagrad works well for both linear and tangent models. The results could be useful for EEG-based brain–computer interfaces (BCIs) in part for choosing the appropriate machine learning methods and features for the correct training of the BCI intelligent system.
- Open Access
Evolutionary Algorithm for Graph Coloring Problem
The graph coloring problem (GCP) is one of the most studied NP-HARD problems in computer science. Given a graph , the task is to assign a color to all vertices such that no vertices sharing an edge receive the same color and that the number of used colors, is minimal. Different heuristic, meta-heuristic, machine learning and hybrid solution methods have been applied to obtain the solution. To solve this problem we use mutation of evolutionary algorithm. For this purpose we introduce binary encoding for Graph Coloring Problem. This binary encoding help us for mutation, evaluate, immune system and merge color easily and also reduce coloring dynamically. In the traditional evolutionary algorithm (EA) for graph coloring, k-coloring approach is used and the EA is run repeatedly until the lowest possible is reached. In our paper, we start with the theoretical upper bound of chromatic number, that is, maximum out-degree + 1 and in the process of evolution some of the colors are made unused to dynamically reduce the number of color in every generation. We test few standard DIMACS benchmark and compare resent paper. Maximum results are same as expected chromatic color and few data sets are larger than expected chromatic number
Open AccessEvolutionary Algorithm for Graph Coloring Problem
The graph coloring problem (GCP) is one of the most studied NP-HARD problems in computer science. Given a graph , the task is to assign a color to all vertices such that no vertices sharing an edge receive the same color and that the number of used colors, is minimal. Different heuristic, meta-heuristic, machine learning and hybrid solution methods have been applied to obtain the solution. To solve this problem we use mutation of evolutionary algorithm. For this purpose we introduce binary encoding for Graph Coloring Problem. This binary encoding help us for mutation, evaluate, immune system and merge color easily and also reduce coloring dynamically. In the traditional evolutionary algorithm (EA) for graph coloring, k-coloring approach is used and the EA is run repeatedly until the lowest possible is reached. In our paper, we start with the theoretical upper bound of chromatic number, that is, maximum out-degree + 1 and in the process of evolution some of the colors are made unused to dynamically reduce the number of color in every generation. We test few standard DIMACS benchmark and compare resent paper. Maximum results are same as expected chromatic color and few data sets are larger than expected chromatic number
- 13 September 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 87-91
Interpretable Models and Patterns for EEG data set
In this paper, we are using EEG data to establish a relationship between channel and frequency band in terms of visual activity through the human brain. The idea behind this method is that we are using SHAP as a tool to know how those different components are connected. We find accuracy in between 87–98% for each user for three different observations: (i) All channel, (ii) left channel, (iii) Right channel; and for that basic relationship is established.
- 13 September 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 87-91
Interpretable Models and Patterns for EEG data set
In this paper, we are using EEG data to establish a relationship between channel and frequency band in terms of visual activity through the human brain. The idea behind this method is that we are using SHAP as a tool to know how those different components are connected. We find accuracy in between 87–98% for each user for three different observations: (i) All channel, (ii) left channel, (iii) Right channel; and for that basic relationship is established.
- 5 April 2021
- Published by Springer Nature
- p. 630-642
Comparison of Machine Learning Methods for Life Trajectory Analysis in Demography
- 5 April 2021
- Published by Springer Nature
- p. 630-642
Comparison of Machine Learning Methods for Life Trajectory Analysis in Demography
- 30 January 2021
- Published by Springer Nature in The Visual Computer
- Vol. 38 (3) , 1015-1025
On-air English Capital Alphabet (ECA) recognition using depth information
- 30 January 2021
- Published by Springer Nature in The Visual Computer
- Vol. 38 (3) , 1015-1025
On-air English Capital Alphabet (ECA) recognition using depth information
- Open Access
Searching for Interpretable Demographic Patterns
Nowadays there is a large amount of demographic data which should be analyzed and interpreted. From accumulated demographic data, more useful information can be extracted by applying modern methods of data mining. Two kinds of experiments are considered in this work: 1) generation of additional secondary features from events and evaluation of its influence on accuracy; 2) exploration of features influence on classification result using SHAP (SHapley Additive exPlanations). An algorithm for creating secondary features is proposed and applied to the dataset. The classifications were made by two methods, SVM and neural networks, and the results were evaluated. The impact of events and features on the classification results was evaluated using SHAP; it was demonstrated how to tune model for improving accuracy based on the obtained values. Applying convolutional neural network for sequences of events allowed improve classification accuracy and surpass the previous best result on the studied demographic dataset.
Open AccessSearching for Interpretable Demographic Patterns
Nowadays there is a large amount of demographic data which should be analyzed and interpreted. From accumulated demographic data, more useful information can be extracted by applying modern methods of data mining. Two kinds of experiments are considered in this work: 1) generation of additional secondary features from events and evaluation of its influence on accuracy; 2) exploration of features influence on classification result using SHAP (SHapley Additive exPlanations). An algorithm for creating secondary features is proposed and applied to the dataset. The classifications were made by two methods, SVM and neural networks, and the results were evaluated. The impact of events and features on the classification results was evaluated using SHAP; it was demonstrated how to tune model for improving accuracy based on the obtained values. Applying convolutional neural network for sequences of events allowed improve classification accuracy and surpass the previous best result on the studied demographic dataset.
- 1 February 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
Detecting Depression Using K-Nearest Neighbors (KNN) Classification Technique
Social networks have developed as a promising point for everybody to communicate with their interested friend and share their opinions, photos, and videos. Also, it has been an upcoming research field and has picked an established position globally. In this paper, we considered depression problems among various Facebook users. Already, a number of researchers have studied and applied many techniques to detect depression, but still need to detect accurately from social network data. So, we investigate the possibility to utilize Facebook data and apply KNN (k-nearest neighbors) classification technique for detecting depressive emotions. We do believe that our investigation and approach might be helpful to raise consciousness in online social network users.
- 1 February 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
Detecting Depression Using K-Nearest Neighbors (KNN) Classification Technique
Social networks have developed as a promising point for everybody to communicate with their interested friend and share their opinions, photos, and videos. Also, it has been an upcoming research field and has picked an established position globally. In this paper, we considered depression problems among various Facebook users. Already, a number of researchers have studied and applied many techniques to detect depression, but still need to detect accurately from social network data. So, we investigate the possibility to utilize Facebook data and apply KNN (k-nearest neighbors) classification technique for detecting depressive emotions. We do believe that our investigation and approach might be helpful to raise consciousness in online social network users.