International Journal of Intelligent Systems and Applications @ijisa
Journal articles - International Journal of Intelligent Systems and Applications
All articles: 1264
Scientific article
In recent years, the mining research over data stream has been prominent as they can be applied in many alternative areas in the real worlds. In [20], a framework for mining frequent itemsets over a data stream is proposed by the use of weighted slide window model. Two algorithms of single pass (WSW) and the WSW-Imp (improving one) using weighted sliding model were proposed in there to solve the data stream problems. The disadvantage of these algorithms is that they have to seek all data stream many times and generate a large set of candidates. In this paper, we have proposed a process of mining frequent itemsets with weights over a data stream. Based on the downward closure property and FP-Growth method [8,9] an alternative algorithm called WSWFP-stream has been proposed. This algorithm is proved working more efficiently regarding to computing time and memory aspects.
Free
An Efficient Method of Steganography using Matrix Approach
Scientific article
A large number of the world business is going on using “INTERNET” and the data over the internet which is vulnerable for attacks from the hackers. Thus, uses of highly efficient methods are required for sensitive data transmission over the internet to ensure data security. One of the solutions to data security is to use an efficient method of steganography. The goal of steganography is to hide messages inside other ‘harmless’ messages in a way that does not allow any enemy to even detect that there is a second message present. Steganography can be used with a large number of file formats most commonly used in the digital world of today. The different file formats popularly used are .bmp, .gif, .txt etc. Thus the techniques of steganography are going to play a very important part in the future of data security and privacy on open systems such as the Internet. This paper presents an efficient method for hiding data into an image and send to the destination in a safe manner. This technique does not need any key for embedding and extracting data. Also, it allows hiding four bits in a block of size 5×5 with minimal distortion. The proposed algorithm ensures security and safety of the hidden information. The experimental results presented in this paper show the efficacy of the proposed method.
Free
An EfficientNetB3 Approach for Retinal Disease Classification with XAI and Online Interface
Scientific article
In real-world clinical settings, the growing number of patients and the shortage of experienced ophthalmologists make early and accurate diagnosis of retinal diseases increasingly challenging. Cataracts, diabetic retinopathy, and glaucoma are some of the most common causes of lifelong blindness around the world. This is why there is a need for automated diagnostic systems that can accurately diagnose and interpret clinical data. The major goal of this work is to find out if a deep learning architecture based on EfficientNetB3 and Explainable Artificial Intelligence (XAI) can accurately classify multiple types of retinal diseases while still being clear to doctors. The proposed system categorizes retinal fundus images into four groups: cataract, diabetic retinopathy, glaucoma, and normal. The dataset consisted of a balanced and publicly accessible collection of 4,217 retinal fundus pictures, processed using standard preprocessing techniques to enhance their generalizability. We chose EfficientNetB3 as the main architecture since it is better at extracting features, and we compared it to the standard convolutional neural network baselines to show how useful it is. The suggested model was 97% accurate in classifying better than Residual Network 50 (ResNet50) is 91% and Visual Geometry Group 16 (VGG 16) is 87%. The high precision, recall, and F1-scores (0.94 – 1.00), the Cohen’s kappa of 0.95, and the low logarithmic loss of 0.10 all point to reliable predictions. The receiver operating characteristic analysis yielded an AUC of 1.00 across all illness categories. Gradient-weighted Class Activation Mapping (Grad-CAM) was utilized to address the interpretability deficit in deep learning-based medical systems and to pinpoint clinically significant retinal regions that influence model predictions. The results indicate that employing XAI alongside EfficientNetB3 enhances both diagnostic precision and interpretability, hence validating its suitability as a transparent decision-support system for the automated screening of retinal disorders.
Free
Scientific article
Automated, i.e. machine vision based fabric defect inspection systems have been drawing plenty of attention of the researchers in order to replace manual inspection. Two difficult problems are mainly posed by automated fabric defect inspection systems. They are defect detection and defect classification. Counterpropagation neural network (CPN) is a robust classifier and very promising for defect classification. In general, works reported to date have claimed varying level of successes in detection and classification of different types of defects through CPN; but in particular, no claimed has been made for successful application of CPN for fabric defects detection and classification. In those published works, no investigation has been reported regarding to the variation of major performance parameters of NN based classifiers such as learning time and classification accuracy based on network topology and training parameters. As a result, application engineer has little or no guidance to take design decisions for reaching to optimum structure of NN based defect classifiers in general and CPN based in particular. Our work focuses on empirical investigation of interrelationship between design parameters and performance of CPN based classifier for fabric defect classification. It is believed that such work will be laying the ground to empower application engineers to decide about optimum values of design parameters for realizing most appropriate CPN based classifier.
Free
Scientific article
This research paper propose experimental support to secure Round Trip Engineering and use of security performance flexibility trusted operating systems for the designing of secure web applications. In this research paper, for security concern, we suggest use of trusted operating systems as a platform to run these web applications. In this regard, a number of trusted operating systems like Argus, Trusted Solaris, and Virtual Vault have been developed by various companies to handle the increasing need of security. For improving the performance of same web applications, we observe that all security checks in a Trusted Operating System are not necessary. As per our suggestion, various unnecessary security checks can be skipped by administrator, so that system performance of these web applications can improve. These unnecessary security checks, system calls and operations can be easily identified at the time of requirement elicitation and Requirement Engineering. For example, as we know, the popular web servers deal with public information. In this web application, the need for security checks during reads from disk seems like a waste of CPU cycles. On the other hand the real security need for servers seems to be of the write accesses. This research paper aims to support the efficiency of object-oriented class-based programming and object oriented modeling in secure software development.
Free
An Enhanced Adaptive B-spline Smoothing Approach for UAV Path Planning
Scientific article
This paper presents an Enhanced Adaptive B-Spline Smoothing approach for UAV path planning in complex three-dimensional environments. By leveraging the inherent local control and smoothness properties of cubic B-Splines, the proposed method integrates an adaptive knot selection mechanism—optimized via a genetic algorithm—with curvature-aware control point refinement to generate dynamically feasible and smooth flight paths. Simulation studies in a cluttered 3D airspace show that the proposed technique reduces path length and lowers maximum curvature compared to uniform and chord-length-based B-Spline strategies. Despite a moderate computational overhead, the results demonstrate smoother, more stable flight trajectories that adhere to aerodynamic constraints and ensure safe obstacle avoidance. This approach is particularly valuable for near-real-time missions, where flight stability, rapid re-planning, and energy efficiency are paramount. Results emphasize the potential of the proposed method for improving UAV navigation in various applications—such as urban logistics, infrastructure inspection, and search-and-rescue—by providing better maneuverability, reduced energy consumption, and increased operational safety to the UAV agents.
Free
An Enhanced Adaptive k-Nearest Neighbor Classifier Using Simulated Annealing
Scientific article
The k-Nearest Neighbor classifier is a non-complex and widely applied data classification algorithm which does well in real-world applications. The overall classification accuracy of the k-Nearest Neighbor algorithm largely depends on the choice of the number of nearest neighbors(k). The use of a constant k value does not always yield the best solutions especially for real-world datasets with an irregular class and density distribution of data points as it totally ignores the class and density distribution of a test point’s k-environment or neighborhood. A resolution to this problem is to dynamically choose k for each test instance to be classified. However, given a large dataset, it becomes very tasking to maximize the k-Nearest Neighbor performance by tuning k. This work proposes the use of Simulated Annealing, a metaheuristic search algorithm, to select optimal k, thus eliminating the prospect of an exhaustive search for optimal k. The results obtained in four different classification tasks demonstrate a significant improvement in the computational efficiency against the k-Nearest Neighbor methods that perform exhaustive search for k, as accurate nearest neighbors are returned faster for k-Nearest Neighbor classification, thus reducing the computation time.
Free
Scientific article
Data Structures and Algorithms (DSA) is a widely explored domain in the world of computer science. With it being a crucial topic during an interview for a software engineer, it is a topic not to take lightly. There are various platforms available to understand a particular DSA, several programming problems, and its implementation. Hacckerank, LeetCode, GeeksForGeeks (GFG), and Codeforces are popular platforms that offer a vast collection of programming problems to enhance skills. However, with the huge content of DSA available, it is challenging for users to identify which one among all to focus on after going through the required domain. This work aims to use a Content-based filtering (CBF) recommendation engine to suggest users programming-based questions related to different DSAs such as arrays, linked lists, trees, graphs, etc. The recommendations are generated using the concept of Natural Language Processing (NLP). The data set consists of approximately 500 problems. Each problem is represented by the features such as problem statement, related topics, level of difficulty, and platform link. Standard measures like cosine similarity, accuracy, precision, and F1-score are used to determine the proportion of correctly recommended problems. The percentages indicate how well the system performed regarding that evaluation. The result shows that CBF achieves an accuracy of 83 %, a precision of 83 %, a recall of 80%, and an F1-score of 80%. This recommendation system is deployed on a web application that provides a suitable user interface allowing the user to interact with other features. With this, a whole E-learning application is built to aid potential software engineers and computer science students. In the future, two more recommendation systems, Collaborative Filtering (CF) and Hybrid systems, can be implemented to make a comparison and decide which is most suitable for the given problem statement.
Free
An Evolving Cascade System Based on a Set of Neo - Fuzzy Nodes
Scientific article
Neo-fuzzy elements are used as nodes for an evolving cascade system. The proposed system can tune both its parameters and architecture in an online mode. It can be used for solving a wide range of Data Mining tasks (namely time series forecasting). The evolving cascade system with neo-fuzzy nodes can process rather large data sets with high speed and effectiveness.
Free
An Expert GIS-Based ANP-OWA Decision Making Framework for Tourism Development Site Selection
Scientific article
The selection of a tourism development site involves a complex array of decision criteria that may have interdependence relationships within and between them. In the process of finding the optimum location that meet desired conditions, the analyst is challenged by the tedious manipulation of spatial data and the management of multiple decision-making criteria. This paper presents a novel decision making framework in which expert systems (ES), and geographic information systems–based multicriteria evaluation techniques (Analytical Network Process and fuzzy quantifiers-guided ordered weighted averaging operators (GIS-based ANP-OWA)) are integrated systematically to facilitate the selection of suitable sites for building new tourism facilities. First, ES is used for recommending the proper site selection criteria and their interdependence relationships. Then, the GIS-based ANP-OWA is used to perform the spatial data analysis necessary to generate a wide range of possible candidate sites’ scenarios taking into accounts both the interdependence relationships between sitting criteria and the level of risk the decision-makers wish to assume in their multicriteria evaluation. A typical case study is presented to demonstrate the application of the proposed decision making framework.
Free
An Exploratory Study on Simulated Annealing for Feature Selection in Learning-to-rank
Scientific article
Learning-to-rank is an applied domain of supervised machine learning. As feature selection has been found to be effective for improving the accuracy of learning models in general, it is intriguing to investigate this process for learning-to-rank domain. In this study, we investigate the use of a popular meta-heuristic approach called simulated annealing for this task. Under the general framework of simulated annealing, we explore various neighborhood selection strategies and temperature cooling schemes. We further introduce a new hyper-parameter called the progress parameter that can effectively be used to traverse the search space. Our algorithms are evaluated on five publicly benchmark datasets of learning-to-rank. For a better validation, we also compare the simulated annealing-based feature selection algorithm with another effective meta-heuristic algorithm, namely local beam search. Extensive experimental results show the efficacy of our proposed models.
Free
An Extended Neo-Fuzzy Neuron and its Adaptive Learning Algorithm
Scientific article
A modification of the neo-fuzzy neuron is proposed (an extended neo-fuzzy neuron (ENFN)) that is characterized by improved approximating properties. An adaptive learning algorithm is proposed that has both tracking and smoothing properties and solves prediction, filtering and smoothing tasks of non-stationary “noisy” stochastic and chaotic signals. An ENFN distinctive feature is its computational simplicity compared to other artificial neural networks and neuro-fuzzy systems.
Free
Scientific article
Image segmentation is a basic work in the field of image analysis and computer vision. Thresholding is one of the simplest methods of image segmentation. In general, thresholding approaches based on 1-D histogram do not make use of any space adjacent information of the image, thus it is often ruined by noise; thus, thresholding methods based on 2-D histogram are put forward. These methods have better segmentation performance, but heavy computation is required with these methods. In the paper, to improve the running efficiency of thresholding methods based 2D histogram, ant colony optimization algorithm combined with genetic algorithm are employed to speed up these methods, which view 2-D histogram based thresholding as a kind of optimization problem. The proposed method has been conducted on some images. Experiments results display that the proposed approach is able to achieve improved search performance which is an efficient method and suitable for real time applications.
Free
An Improved Sampling Dijkstra Approach for Robot Navigation and Path Planning
Scientific article
The task of path planning is extremely investigated in mobile robotics to determine a suitable path for the robot from the source point to the target point. The intended path should satisfy purposes such as collision-free, shortest-path, or power-saving. In the case of a mobile robot, many constraints should be considered during the selection of path planning algorithms such as static or dynamic environment and holonomic or non-holonomic robot. There is a pool of path-planning algorithms in the literature. However, Dijkstra is still one of the effective algorithms due to its simplicity and capabilities to compute single-source shortest-path to every position in the workspace. Researchers propose several versions of the Dijkstra algorithm, especially in mobile robotics. In this paper, we propose an improved approach based on the Dijkstra algorithm with a simple sampling method to sample the workspace to avoid an exhaustive search of the Dijkstra algorithm which consumes time and resources. The goal is to identify the same optimal shortest path resulting from the Dijkstra algorithm with minimum time and number of turns i.e., a smoothed path. The simulation results show that the proposed method improves the Dijkstra algorithm with respect to the running time and the number of turns of the mobile robot and outperforms the RRT algorithm concerning the path length.
Free
An Initilization Method for Subspace Clustering Algorithm
Scientific article
Soft subspace clustering is an important part and research hotspot in clustering research. Clustering in high dimensional space is especially difficult due to the sparse distribution of the data and the curse of dimensionality. By analyzing limitations of the existing algorithms, the concept of subspace difference and an improved initialization method are proposed. Based on these, a new objective function is given by taking into account the compactness of the subspace clusters and subspace difference of the clusters. And a subspace clustering algorithm based on k-means is presented. Theoretical analysis and experimental results demonstrate that the proposed algorithm significantly improves the accuracy.
Free
An Innovative System for Daily Thunderstorm Event Prediction using Deep Learning
Scientific article
Thunderstorms are weather disturbances that can cause lightning, stormy winds, dense clouds, tornadoes, and heavy rain. Thunderstorms can cause extensive damage to people's lives, property, and economies, as well as livestock and national infrastructure. Early warning of thunderstorms can save people's lives and property. Previous thunderstorm prediction research did not develop a system for daily thunderstorm prediction with high accuracy for Bangladeshi citizens by assessing a wide range of meteorological variables. To address this issue, this work develops a daily high accuracy based localized thunderstorm event prediction system that analyzes various meteorological factors, dates, and specific location information. This dataset was analyzed using a variety of machine learning models, including traditional statistical models like ARMA, ARIMA, and SARIMA, as well as XGBoost ensemble methods and some deep learning models such as ANN, LSTM, and GRU. The results show that advanced neural network models, particularly GRU and LSTM, outperform others in terms of RMSE, R2, MAE, and MAPE. The GRU model outperformed all other schemes, with an RMSE of 0.794, R2 of 0.998, MAE of 0.476, and MAPE of 3.544%. The mobile application provides users with accurate, localized thunderstorm forecasts, allowing for better safety, event planning, and environmental preparedness. User feedback-based mobile app assessment confirms that more than 55% of users are highly satisfied with the thunderstorm assistance app’s features and usefulness.
Free
An Intelligent Alarm Based Visual Eye Tracking Algorithm for Cheating Free Examination System
Scientific article
A modern and well established education system is a backbone of any nation’s success. High reputation in international platform can only be achieved when best and deserving students represent your country and earn reputation on their ability and dedication. For this purpose an education system must be a cheating free system so that non-deserving students should not get the positions which they don’t deserve. This research aims to develop such a system which can be used in exam halls to avoid the cheating based on student’s eye movement. The algorithm detects the human from the scene followed by the face detection and recognition. The next phase involves eye detection followed by eye's movement tracking to analyze and decide about whether the student is involved in cheating or not. The system can be used on a large scale in educational institutions as well as in corporate sector wherever exams have been conducted.
Free
An Intelligent Approach of Regulating Electric-Fan Adapting to Temperature and Relative Humidity
Scientific article
In our daily lives, we enjoy the service of thousands of devices and systems that have made our lives easier and more comfortable. Electric fan is one of the most popular and used systems in developing countries like Bangladesh for its cost effectiveness and low power consumption. In the era of twenty-first century we expect all of our living and working systems will be intelligent when it will provide the service. We have developed a fuzzy inference system that effectively and intelligently controls the rotating speed of an electric fan according to the temperature of environment and its relative humidity. We used experimental data and verified the experimental data with different mathematical procedure to ensure that our result is well enough. We designed a simulation system to test the result but it can be easily implemented on hardware level, since fuzzy logic toolbox provides such facility.
Free
An Intelligent Ensemble Classification Method For Spam Diagnosis in Social Networks
Scientific article
In recent years, the destructive behavior of social networks spammers has seriously threatened the information security of ordinary users. To reduce this threat, many researchers have extracted the behavioral characteristics of spam and obtained good results based on machine learning algorithms to identify them. However, most of these studies use a single classification technique that often works differently for different spam data. In this paper, an intelligent ensemble classification method for social networks spam detection is introduced. The proposed heterogeneous ensemble learning framework is based on stack generalization and uses an evolutionary algorithm to improve the modeling process and reduce complexity. In particular, particle swarm optimization has been used as an evolutionary algorithm to optimize model parameters to reduce model complexity. These parameters include a subset of effective features and a subset of the most appropriate single classification techniques. The SPAM E-mail dataset used in this article contains the correct and effective features in spam prediction. Experimental results show that the proposed algorithm effectively improves the detection rate of spam and performs better than the methods used.
Free
An Introduction to the Theory of Imprecise Soft Sets
Scientific article
This paper aims to introduce the theory of imprecise soft sets which is a hybrid model of soft sets and imprecise sets. It has been established that two independent laws of randomness are necessary and sufficient to define a law of fuzziness. Further, in case of fuzzy sets, the set theoretic axioms of exclusion and contradiction are not satisfied. Accordingly, the theory of imprecise sets has been developed where these mistakes arising in the literature of fuzzy sets are absent. Our work is an endeavor to combine imprecise sets with soft sets resulting in imprecise soft sets. We have put forward a matrix representation of imprecise soft sets. Finally we have studied the notion of similarity of two imprecise soft sets and put forward an application of similarity in a decision problem.
Free
