Search
359 articles for “Algorithm Performance”
-
Advancements in K-Means Clustering: Boosting Algorithm Performance through Innovations
Abstract: K-Means clustering is a widely used unsupervised learning algorithm for partitioning a dataset into distinct clusters. Despite its popularity and simplicity, K-Means has several limitations, such as sensitivity to initial centroids, convergence to local minima, and inefficiency with large datasets. This paper reviews recent advancements aimed at addressing these challenges and enhancing the performance of the K-Means algorithm. Innovations include improved initialization methods, such as K-Means++, which significantly reduce the …
Published in International Journal of Solid State Innovations & Research · Vol. 3, Issue 1, 2025 · pp. 30–37 Read article
-
Traversal Speed Comparison of BFS and DFS in Balanced and Skewed Binary Trees
Abstract: In this paper, we provide an analysis of how well both breadth-first search (BFS) and depth-first search (DFS) algorithms perform while wandering through two kinds of binary trees: balanced and skewed. The research was motivated by the practical application of storing files and directories in a certain type of parent-child relationship through the use of hierarchical file systems (e.g., windows explorer). The result of measuring how fast and versatilely these …
Published in International Journal of Data Structure Studies · Vol. 4, Issue 2, 2026 Read article
-
Data Compression for Backbone Network
Abstract: This article involves the application of data compression techniques to improve the efficiency and performance of the core infrastructure of modern digital networks. This approach focuses on reducing the size of transmitted data without compromising its quality, aiming to enhance network throughput, reduce latency, and minimize energy consumption. The study also considers practical implementation challenges and trade-offs to optimize resource utilization in backbone networks. We delve into various compression methods, …
Published in Journal of Multimedia Technology & Recent Advancements · Vol. 11, Issue 1, 2024 · pp. 30–40 Read article
-
Algorithmic Strategies for Complex Data Handling: Optimizing Data Structures for Enhanced Computational Performance
Abstract: We live in an age of big data and processing very large often complicated datasets can be crucial to efficient algorithmic performance. This paper discusses different algorithmic techniques when working with difficult data and how to arrange your information structures correctly for better functionality in large-scale methods. It checks the impact of different algorithms like sorting, searching, and hashing in boosting its processing speed as well as memory use. This …
Published in International Journal of Data Structure Studies · Vol. 2, Issue 2, 2024 · pp. 1–10 Read article
-
Learning Data Structures: Key to Good Programming
Abstract: Data structures are the most crucial feature of good programming and are needed to solve hard computational problems. This model makes use of two different recurrent neural network architectures, specifically long short-term memory (LSTM), and gated recurrent unit (GRU) networks. It explains how selecting and using the correct data structures may speed up computations, optimize memory, and scale code. How data structures and algorithms relate and how to think about …
Published in International Journal of Data Structure Studies · Vol. 4, Issue 1, 2026 · pp. 29–39 Read article
-
Firefly Algorithm–Based Optimization of Processing Parameters for Enhanced Performance of Polymer Composite Materials
Abstract: Polymer composite materials are extensively used in aerospace, automotive, and oil & gas applications due to their high strength-to-weight ratio and design flexibility. However, achieving optimal mechanical and thermal performance strongly depends on precise control of processing parameters such as curing temperature, energy consumption, and material utilization. Conventional trial-and-error approaches often lead to excessive energy usage, non-uniform curing, and sub-optimal composite properties. To address these challenges, this paper proposes an …
Published in Journal of Polymer & Composites · Vol. 14, Issue 1, 2026 · pp. 90–107 Read article
-
Performance Analysis of Machine Learning Algorithms For Disease Prediction
Abstract: In this 21st century, where Digitization makes humans measure, record, analyze and to manipulate the huge amount of data as per the requirement, prediction of the decease based on Machine Learning models will be representing one of the good applications of the efficient data handling. An Automatic Decease Prediction system based on the symptoms would be the great boon for the medical practitioners. The Supervised Machine Learning models, such as …
Published in Research & Reviews: A Journal of Bioinformatics · Vol. 11, Issue 3, 2024 · pp. 9–18 Read article
-
Comparative Analysis of Supervised Learning Algorithms
Abstract: Supervised learning is a fundamental and widely used branch of machine learning in which models are trained on labeled datasets, meaning that each input is associated with a known output. Supervised learning algorithms develop predictive capability by understanding the mapping between input variables and corresponding output labels, enabling them to accurately forecast outcomes for previously unseen data. Due to this capability, supervised learning has found extensive applications across diverse domains …
Published in Journal of Computer Technology & Applications · Vol. 17, Issue 1, 2026 · pp. 25–30 Read article
-
Crop Disease Prediction by Machine Learning
Abstract: The classification of Crop can be classified into several methods. The data set of crop leaf illnesses, notably Bacterial Leaf Blight disease (BLB), a crop leaf disease with significant outbreaks throughout Thailand, and Brown Spot Crop disease (BSR), is classified employing image classification in this study. Additionally, image processing technology is used for identifying different types of crop leaf disease. These algorithms include the Random Forest, Decision Tree, Gradient Boost, …
Published in Trends in Machine design · Vol. 11, Issue 2, 2024 · pp. 21–25 Read article
-
Deadlock Controlling Algorithms for Distributed Database Systems
Abstract: When the demand for a system resource exceeds the system's capacity, deadlock – an operating system problem – results. The problem of deadlock frequently causes a distributed database's performance to lag. This research critically examined two types of deadlock problems that have an impact on a distributed database's performance. Transaction control and transaction location deadlock difficulties were the specific challenges that the article specifically addressed. In this paper, deadlock prevention …
Published in International Journal of Algorithms Design and Analysis Review · Vol. 1, Issue 2, 2023 · pp. 10–17 Read article
-
Exploring AI-Driven Student Performance Analysis as a Dimension of an AI-Powered Assessment and Feedback System: A Comprehensive Review
Abstract: The rapid proliferation of artificial intelligence (AI) in educational technology has heralded a paradigmatic transformation in assessment methodologies, transitioning from static, summative evaluations to dynamic, data-driven systems that emphasize continuous formative feedback. This comprehensive review interrogates AI-driven student performance analysis as a cardinal dimension of AI-powered assessment and feedback systems (AI-PAFS), synthesizing findings from forty-five rigorously curated open-access empirical studies published between 2015 and 2024. Employing a methodological lens, the …
Published in Current Trends in Information Technology · Vol. 16, Issue 1, 2025 · pp. 24–31 Read article
-
Using Machine Learning for Key phrase Extraction in Digital Libraries
Abstract: Machine learning has revolutionized various aspects of information retrieval, including key phrase extraction in digital libraries. Key phrase extraction is crucial for summarizing and categorizing vast amounts of textual data, enabling efficient search and retrieval processes. This study explores the application of machine learning techniques for automatic key phrase extraction in digital libraries. We review various supervised and unsupervised learning algorithms, including deep learning models, that are employed to identify …
Published in International Journal of Cheminformatics · Vol. 1, Issue 2, 2023 · pp. 8–13 Read article
-
Advancements in Intrusion Detection: Tackling Imbalanced Network Traffic with Machine Learning and Deep Learning Techniques
Abstract: Malicious cyberattacks can frequently hide enormous amounts of typical data in unbalanced network traffic. It is very stealthy and obfuscating in cyberspace, which makes it challenging for Network Intrusion Detection Systems (NIDS) to guarantee the precision and promptness of detection. This essay investigates. Machine learning and deep learning are utilized for intrusion detection in imbalanced network traffic. It offers a novel method for addressing the problem of class imbalance termed …
Published in Recent Trends in Electronics Communication Systems · Vol. 11, Issue 2, 2024 · pp. 18–24 Read article
-
Blind Image Quality Assessment using NSS Approach in the DCT Domain
Abstract: We have develop an efficient model for improving image quality using IQA and NSS based on blind image Quality Assessment. This algorithm does computation for the parameters which user expect at output. The certain extracted features approach depends on a simple Bayesian inference model to dipict image quality scores. The project features are based on statistic scenes of discrete cosine transform for images. The resultant parameters of the model are …
Published in Recent Trends in Electronics Communication Systems Read article
-
Asymptotic Notations: A Review
Abstract: Asymptotic notations play a fundamental role in assessing the efficiency and performance of algorithms, particularly as input sizes grow larger. This paper delves into three key asymptotic notations: Big O, Theta, and Omega, which are essential for understanding the upper, average, and lower bounds of an algorithm’s runtime. Big O notation specifically helps in determining the worst-case scenario of an algorithm’s growth rate, providing an upper bound on time or …
Published in Journal of Computer Technology & Applications · Vol. 15, Issue 3, 2024 · pp. 17–33 Read article
-
Heart Disease AI-based Prediction: A Comparative Analysis
Abstract: The present investigation looks at how well various machine learning algorithms predict cardiac disease. Since heart disease is one of the major causes of death worldwide, early detection and precise diagnosis are essential for managing and treating the condition. Our goal is to enhance diagnostic processes and improve patient outcomes by leveraging machine learning techniques. Six widely-used machine learning algorithms are evaluated in this research paper. These algorithms were selected …
Published in Trends in Mechanical Engineering & Technology · Vol. 14, Issue 2, 2024 · pp. 21–29 Read article
-
Performance, Combustion and Emission analysis of Sunflower oil based Biodiesel using Non-Dominated Sorting Genetic Algorithm-II
Abstract: Biodiesel is used as alternate fuel of I. C. Engines for so many years. It is obtained from various edible and non-edible oils including waste cooking oils through trans-esterification process in the presence of catalyst. The suitable amount of biodiesel mix with commercial diesel can be used to run the compression ignition engines. The optimum combination of engine input parameters is the challenging task as required by the design engineer …
Published in International Journal of Energy and Thermal Applications · Vol. 1, Issue 1, 2023 · pp. 1–6 Read article
-
An Optimised CPU Scheduling Algorithm with Adaptive Time Quantum Approach
Abstract: CPU scheduling is an essential mechanism implemented by the operating system to determine the execution of multiple processes by the CPU. The primary objective of the scheduling algorithms is to optimize the systems’ performance efficiently. The performance of a CPU scheduling algorithm depends on various factors and can be evaluated on various criteria like average turnaround time, average waiting time, throughput, fairness etc. This paper aims to present an optimal …
Published in Journal of Operating Systems Development & Trends Read article
-
Application of B-trees for Design of Optimal Page Replacement Technique in Modern Operating Systems
Abstract: Algorithms related to replacing the memory pages in operating systems are critical components of modern operating systems that manage virtual memory efficiently. Current algorithms such as LRU (Least Recently Used), Clock algorithms as well as FIFO (First-In-First-Out), often struggle with the increasing demands of contemporary applications and larger memory hierarchies. This research work proposes a novel approach utilizing B-tree data structures to design an optimal page replacement technique. The proposed …
Published in International Journal of Data Structure Studies · Vol. 3, Issue 2, 2025 · pp. 23–30 Read article
-
A Hybrid Algorithm for Processor Scheduling Using Game Theory Variants
Abstract: This study proposes a novel hybrid algorithm for processor scheduling in modern operating systems, integrating the strengths of traditional scheduling methods with game theory variants. Traditional schedulers often struggle to adapt to dynamic workload changes, leading to suboptimal performance. Our hybrid approach addresses this by treating processes as "players" in a game, where the "payoff" is CPU time. A base scheduler (e.g., Weighted Fair Queuing, Earliest Deadline First) provides a …
Published in Journal of Operating Systems Development & Trends · Vol. 12, Issue 1, 2025 · pp. 48–56 Read article