Computer Science

Melanoma Skin Cancer and Nevus Mole Classification using Intensity Value Estimation with Convolutional Neural Network

N. I. Md. Ashafuddula — 2023-10-01

Melanoma skin cancer is one of the most dangerous and life-threatening cancer. Exposure to ultraviolet rays may damage the skin cell's DNA, which causes melanoma skin cancer. However, it is difficult to detect and classify melanoma and nevus mole at the immature stages. In this work, an automatic deep learning system is developed based on the intensity value estimation with a convolutional neural network model (CNN) to detect and classify melanoma and nevus mole more accurately. Since intensity levels are the most distinctive features for object or region of interest identification, the high-intensity pixel values are selected from the extracted lesion images. Incorporating those high-intensity features into the CNN improves the overall performance than the state-of-the-art methods for detecting melanoma skin cancer. To evaluate the system, we used 5-fold cross-validation. Experimental results show that a superior percentage of accuracy (92.58%), Sensitivity (93.76%), Specificity (91.56%), and Precision (90.68%) are achieved.

Hybrid Variable Neighborhood Search for Solving School Bus-Driver Problem with Resource Constraints

Ha-Bang Ban — 2023-10-01

The School Bus-Driver Problem with Resource Constraints (SBDP-RC) is an optimization problem with many practical applications. In the problem, the number of vehicles is prepared to pick a number of pupils, in which the total resource of all vehicles is less than a predefined value. The aim is to find a tour minimizing the sum of pupils’ waiting times. The problem is NP-hard in the general case. In many cases, reaching a feasible solution becomes an NP-hard problem. To solve the large-sized problem, a metaheuristic approach is a suitable approach. The first phase creates an initial solution by the construction heuristic based on Insertion Heuristic. After that, the post phase improves the solution by the General Variable Neighborhood Search (GVNS) with Random Neighborhood Search combined with Shaking Technique. The hybridization ensures the balance between exploitation and exploration. Therefore, the proposed algorithm can escape from local optimal solutions. The proposed metaheuristic algorithm is tested on a benchmark to show the efficiency of the algorithm. The results show that the algorithm receives good feasible solutions fast. Additionally, in many cases, better solutions can be found in comparison with the previous metaheuristic algorithms.

A Survey on Multi-Objective Based Parameter Optimization for Deep Learning

Mrittika Chakraborty — 2023-10-01

Deep learning models form one of the most powerful machine learning models for the extraction of important features. Most of the designs of deep neural models, i.e., the initialization of parameters, are still manually tuned. Hence, obtaining a model with high performance is exceedingly time-consuming and occasionally impossible. Optimizing the parameters of the deep networks, therefore, requires improved optimization algorithms with high convergence rates. The single objective-based optimization methods generally used are mostly time-consuming and do not guarantee optimum performance in all
cases. Mathematical optimization problems containing multiple objective functions that must be optimized simultaneously fall under the category of multi-objective optimization sometimes referred to as Pareto optimization. Multi-objective optimization problems form one of the alternatives yet useful options for parameter optimization. However, this domain is a bit less explored. In this survey, we focus on exploring the effectiveness of multi-objective optimization strategies for parameter optimization in conjunction with deep neural networks. The case studies used in this study focus on how the two
methods are combined to provide valuable insights into the generation of predictions and analysis in multiple applications.

A Nature Inspired Hybrid Partitional Clustering Method Based on Grey Wolf Optimization and JAYA Algorithm

GYANARANJAN SHIAL — 2023-10-01

This paper presents a hybrid meta-heuristic algorithm using Grey Wolf optimization (GWO) and JAYA algorithm for data clustering. The idea is use exploitative capability of JAYA algorithm in the explorative phase of GWO to form compact clusters. Here, instead of using one best and one worst solution for generating offspring, three best wolfs and three worst omega wolfs of the population are used. So, the best wolfs and worst omega wolfs assist in moving the new solutions towards the best solutions and simultaneously helps in staying away from the worst solutions. This enhances the chances of reaching the near optimal solutions. The superiority of the proposed method is compared with five promising algorithms, namely GWO, Sine-Cosine Algorithm (SCA), Particle Swarm Optimization (PSO), JAYA and K-means algorithms. The result obtained from the Duncan’s multiple range test and Nemenyi hypothesis based statistical test confirms the superiority and robustness of our proposed method.

Database Replication for Disconnected Operations with Quasi Real-Time Synchronization

Rafal Mucha — 2023-10-01

Database replication is a way to improve system throughput or achieve high availability. In most cases, using an active-active replica architecture is efficient and easy to deploy. Such a system has CP properties (from the CAP theorem: Consistency, Availability and network Partition tolerance). Creating an AP (available and partition tolerant) system requires using multi-primary replication. This approach, because of many difficulties in implementation, is not widely used. However, deployment of CCDB (experiment conditions and calibration database) needs to be an AP system in two locations. This necessity became an inspiration to examine the state-of-the-art in this field and to test the available solutions. The tests performed evaluate the performance of the chosen replication tools: Bucardo and EDB Replication Server. They show that the tested tools can be successfully used for continuous synchronization of two independent database instances.

Finding Playing Styles of Badminton Players Using Firefly Algorithm Based Clustering Algorithms

Anuradha Ariyaratne — 2023-10-01

Cluster analysis can be defined as applying clustering algorithms with the goal of finding hidden patterns or groupings in a dataset. Different clustering methods provide different solutions for the same dataset. Traditional clustering algorithms are popular, but handling big data sets is beyond the ability of such methods. We propose three big data clustering methods, based on the Firefly Algorithm (FA). Three different fitness functions were defined on FA using inter cluster distance, intra cluster distance, silhouette value and Calinski-Harabasz Index. The algorithms find the most appropriate cluster centers for a given data set. The algorithms were tested with four popular synthetic data sets and later applied on two badminton data sets to identify different playing styles of players based on physical characteristics. The results specify that the firefly algorithm could generate better clustering results with high accuracy. The algorithms cluster the players to find the most suitable playing strategy for a given player where expert knowledge is needed in labeling the clusters. Comparisons with a PSO based clustering algorithm (APSO) and traditional algorithms point out that the proposed firefly variants work similarly as the APSO method and surpass the performance of traditional algorithms.