Golam Saklain
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Golam Saklain has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Fei Deng
College of Information Engineering, Kunming University, Kunming, Yunnan, China
4 shared publications - Liqing Zhang
College of Information Engineering, Kunming University, Kunming, Yunnan, China
2 shared publications - Xiaoan Liu
College of Information Engineering, Kunming University, Kunming, Yunnan, China
2 shared publications - Xisong Miao
College of Information Engineering, Kunming University, Kunming, Yunnan, China
2 shared publications - Yitao Duan
College of Information Engineering, Kunming University, Kunming, Yunnan, China
2 shared publications - Boyang Wang
Faculty of Natural, Mathematical & Engineering Sciences, King’s College London, London WC2R 2LS, UK
1 shared publication
Latest Publications
- Open Access
- 18 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 144-151
Binary Image Classification Using KNN Optimized with Mahalanobis Distance
- 18 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 144-151
Open AccessBinary Image Classification Using KNN Optimized with Mahalanobis Distance
- Open Access
- 18 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 324-330
A redundancy data discrimination method based on inverse matrix about student mark
- 18 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 324-330
Open AccessA redundancy data discrimination method based on inverse matrix about student mark
- Open Access
- 13 September 2024
- Published by Association for Computing Machinery (ACM)
- p. 231-236
A Network Intrusion Detection Method for Training Dataset Generation Based on KNN
In this paper, for overcoming the difficulty of training dataset about two random method and manual method, the K-Nearest Neighbor (KNN) method is used to detect the network intrusion. Through adjusting K-value from part dataset and overall dataset, it can be calculated that the accuracy rate of random method is higher than of manual method for network intrusion detection by KNN. Finally, based on CICIDS2017 dataset, the experiments can verity the effectiveness of the proposed method.
- 13 September 2024
- Published by Association for Computing Machinery (ACM)
- p. 231-236
Open AccessA Network Intrusion Detection Method for Training Dataset Generation Based on KNN
In this paper, for overcoming the difficulty of training dataset about two random method and manual method, the K-Nearest Neighbor (KNN) method is used to detect the network intrusion. Through adjusting K-value from part dataset and overall dataset, it can be calculated that the accuracy rate of random method is higher than of manual method for network intrusion detection by KNN. Finally, based on CICIDS2017 dataset, the experiments can verity the effectiveness of the proposed method.
- Open Access
- 12 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 35-40
A Novel Method on Convolutional Classification for Unifying Multimodal
For the current multimodal classification, there is the drawback that can not cope the any combination of modalities. So, this paper proposes a novel unified convolutional classification model for overcoming the disadvantage. We propose the Giant Multi-Scale Dilation Block (GMSDB) for enhancing Spatial Attention Block, including Large Separable Kernel Attention (LSKA) and Multiscale Swelling Attention Block (MSAB), For LSKA, GMSDB can obtain a larger sensory field via an ultra large kernel, and decompose the 2D convolutional kernel of the deep convolutional layer into cascaded horizontal 1D and vertical 1D kernels, which effectively converts the long text and video data into an ultra large vector matrix representation. For MSDA, with multi-head design, the channels of the feature map can be divided into n different heads, and Sliding Window Expansion of Attention (SWDA) can be performed through different dilation rates at different heads. Based on the above model, the semantic information at various scales within the attended sensory field can be aggregated, and the redundancy of the self-attention mechanism can be reduced effectively. In this way, the long-range dependence problem is successfully solved and the ability on adapting to inputs of different scales from different modes is effectively improved.
- 12 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 35-40
Open AccessA Novel Method on Convolutional Classification for Unifying Multimodal
For the current multimodal classification, there is the drawback that can not cope the any combination of modalities. So, this paper proposes a novel unified convolutional classification model for overcoming the disadvantage. We propose the Giant Multi-Scale Dilation Block (GMSDB) for enhancing Spatial Attention Block, including Large Separable Kernel Attention (LSKA) and Multiscale Swelling Attention Block (MSAB), For LSKA, GMSDB can obtain a larger sensory field via an ultra large kernel, and decompose the 2D convolutional kernel of the deep convolutional layer into cascaded horizontal 1D and vertical 1D kernels, which effectively converts the long text and video data into an ultra large vector matrix representation. For MSDA, with multi-head design, the channels of the feature map can be divided into n different heads, and Sliding Window Expansion of Attention (SWDA) can be performed through different dilation rates at different heads. Based on the above model, the semantic information at various scales within the attended sensory field can be aggregated, and the redundancy of the self-attention mechanism can be reduced effectively. In this way, the long-range dependence problem is successfully solved and the ability on adapting to inputs of different scales from different modes is effectively improved.
- Open Access
- 13 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 130426-130438
A Novel Fuzzy Time Series Method Based on Dynamic Ridge Polynomial Neural Network With Penalty Term and Fuzzy Clustering Analysis
Due to the limitations of traditional time series models in handling semantic values and small-scale data, the concept of fuzzy time series forecasting has been introduced in academia. This model performs exceptionally well on fuzzy datasets, prompting many researchers to delve into this field. The general process of fuzzy time series analysis consists of the following stages: (1) domain partitioning; (2) formation of fuzzy sets for fuzzifying data; (3) extraction of fuzzy relationships; and (4) forecasting and defuzzification. Domain partitioning and the extraction of fuzzy relationships have always been crucial components of fuzzy time series forecasting. Until now, neural networks have been less commonly applied in the step of determining fuzzy relationships. Some researchers have attempted to utilize the Pi-Sigma neural network for the determination of fuzzy relationships. However, due to the fixed network structure that Pi-Sigma neural networks cannot adapt to changes over time, it has been indicated that it is not a universal approximator. Its performance in handling complex dynamic time series has not been satisfactory. In this paper, we utilize Fuzzy C-Means Clustering (FCM) to partition the domain into unequal-length intervals and employ a high-order dynamic neural network known as Dynamic Ridge Polynomial Neural Network (DRPNN). This network can start with a small basic structure and gradually increase its structural complexity as learning progresses until it achieves the required task accuracy, which demonstrates superior performance in handling complex time series data. During the training process, we employ a novel gradient descent training algorithm with penalty terms. We conducted tests on this algorithm using nine real-world datasets and performed Friedman and Bonferroni-Dunn tests to ensure that the proposed algorithm exhibits statistical performance superiority compared to other methods in the literature. The results indicate that our algorithm outperforms those from other studies.
- 13 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 130426-130438
Open AccessA Novel Fuzzy Time Series Method Based on Dynamic Ridge Polynomial Neural Network With Penalty Term and Fuzzy Clustering Analysis
Due to the limitations of traditional time series models in handling semantic values and small-scale data, the concept of fuzzy time series forecasting has been introduced in academia. This model performs exceptionally well on fuzzy datasets, prompting many researchers to delve into this field. The general process of fuzzy time series analysis consists of the following stages: (1) domain partitioning; (2) formation of fuzzy sets for fuzzifying data; (3) extraction of fuzzy relationships; and (4) forecasting and defuzzification. Domain partitioning and the extraction of fuzzy relationships have always been crucial components of fuzzy time series forecasting. Until now, neural networks have been less commonly applied in the step of determining fuzzy relationships. Some researchers have attempted to utilize the Pi-Sigma neural network for the determination of fuzzy relationships. However, due to the fixed network structure that Pi-Sigma neural networks cannot adapt to changes over time, it has been indicated that it is not a universal approximator. Its performance in handling complex dynamic time series has not been satisfactory. In this paper, we utilize Fuzzy C-Means Clustering (FCM) to partition the domain into unequal-length intervals and employ a high-order dynamic neural network known as Dynamic Ridge Polynomial Neural Network (DRPNN). This network can start with a small basic structure and gradually increase its structural complexity as learning progresses until it achieves the required task accuracy, which demonstrates superior performance in handling complex time series data. During the training process, we employ a novel gradient descent training algorithm with penalty terms. We conducted tests on this algorithm using nine real-world datasets and performed Friedman and Bonferroni-Dunn tests to ensure that the proposed algorithm exhibits statistical performance superiority compared to other methods in the literature. The results indicate that our algorithm outperforms those from other studies.