Kadyrov, Shirali
Unknown Affiliation

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

Found 3 Documents
Search

2D face recognition using PCA and triplet similarity embedding Bazatbekov, Bek; Turan, Cemil; Kadyrov, Shirali; Aitimov, Askhat
Bulletin of Electrical Engineering and Informatics Vol 12, No 1: February 2023
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/eei.v12i1.4162

Abstract

The aim of this study is to propose a new robust face recognition algorithm by combining principal component analysis (PCA), Triplet Similarity Embedding based technique and Projection as a similarity metric at the different stages of the recognition processes. The main idea is to use PCA for feature extraction and dimensionality reduction, then train the triplet similarity embedding to accommodate changes in the facial poses, and finally use orthogonal projection as a similarity metric for classification. We use the open source ORL dataset to conduct the experiments to find the recognition rates of the proposed algorithm and compare them to the performance of one of the very well-known machine learning algorithms k-Nearest Neighbor classifier. Our experimental results show that the proposed model outperforms the kNN. Moreover, when the training set is smaller than the test set, the performance contribution of triplet similarity embedding during the learning phase becomes more visible compared to without it
A novel recommender system for adapting single machine problems to distributed systems within MapReduce Orynbekova, Kamila; Kadyrov, Shirali; Bogdanchikov, Andrey; Oktamov, Saidakmal
Bulletin of Electrical Engineering and Informatics Vol 14, No 1: February 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/eei.v14i1.8370

Abstract

This research introduces a novel recommender system for adapting single-machine problems to distributed systems within the MapReduce (MR) framework, integrating knowledge and text-based approaches. Categorizing common problems by five MR categories, the study develops and tests a tutorial with promising results. Expanding the dataset, machine learning models recommend solutions for distributed systems. Results demonstrate the logistic regression model's effectiveness, with a hybrid approach showing adaptability. The study contributes to advancing the adaptation of single-machine problems to distributed systems MR, presenting a novel framework for tailored recommendations, thereby enhancing scalability and efficiency in data processing workflows. Additionally, it fosters innovation in distributed computing paradigms.
Route splitting and adaptive mutation in genetic algorithms for the capacitated vehicle routing problem Kadyrov, Shirali; Turan, Cemil
Bulletin of Electrical Engineering and Informatics Vol 14, No 6: December 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/eei.v14i6.9204

Abstract

The capacitated vehicle routing problem (CVRP), where vehicle capacity constraints limit the load carried per route for multiple vehicles, is addressed using an optimized genetic algorithm (GA) framework. This work focuses on finding the best configuration of GA by systematically evaluating 12 distinct GA variants, differing in adaptive mutation rates and route-splitting strategies. The framework integrates adaptive mutation rates and novel route-splitting approaches—greedy, dynamic programming (DP), and heuristic—to enhance computational efficiency and solution quality. Experiments on six CVRP instances of varying complexity, encompassing differences in problem size, vehicle capacity, and geographical distribution, demonstrate the heuristic approach’s effectiveness. It achieves solutions within 2%–5% of the optimal cost of DP while being 3–4 times faster. Adaptive techniques reduce costs by up to 20% compared to standard GAs and heuristics. The framework’s scalability is evident in large-scale instances such as the 200-customer case, where the heuristic method balances cost (414.17) and computation time (0.003 seconds). The developed software is openly available at GitHub, providing a robust tool for addressing practical logistics challenges.