检索结果-内蒙古大学图书馆

Enhanced Distance-based Weighted K-Nearest Neighbor Algorithm for Data Classification

KSII Transactions on Internet and information systems 2025年第4期19卷 1097-1121页

作者： Amer, Ali A. Ravana, Sri Devi Habeeb, Riyaz Ahamed Ariyaluran Department of Information Systems Faculty of Computer Science & Information Technology Universiti Malaya Malaysia

The k-Nearest Neighbors (kNN) algorithm is one of the most widely used techniques for data classification. However, the imbalanced class is a key problem for its declining performance. Therefore, the kNN algorithm is kept updated to mitigate this problem’s effects. Following the pattern of the literature, our paper proposes a novel weighted kNN that aims to significantly reduce the negative consequences of this problem. An enhanced distance-based weighted KNN, EDWkNN, is developed to improve the overall KNN performance. For the test sample, the number of neighbors (k) is initially determined. Next, normalized weights are computed for these neighbors and assigned a value between 0 and 1. The weights of the nearest and farthest neighbors are 1 and 0, respectively. The weight values of the remaining neighbors range from 0 to 1, with the closest one having a heavier weight and the farthest neighbor having a lower weight value. In extreme circumstances, a few neighbors have equal distance from the test sample, leading to assigning uniform weights to each of these neighbors. Further, the EDWkNN considers both the magnitude of the distance and the proximity of neighbors. Comparing EDWkNN to its state-of-the-art rivals, its simplistic architecture and competitive performance demonstrate its uniqueness. In four experimental phases, a thorough assessment study is conducted utilizing four evaluation metrics (accuracy, precision, recall, and MAE) over forty-four datasets. The findings show that, on average and for individual k values, EDWkNN is substantially promising. Copyright © 2025 KSII.

关键词： Nearest neighbor search

来源：评论

学校读者我要写书评

暂无评论

Revolutionizing online shopping with FITMI: a realistic virtual try-on solution

引用

Neural Computing and Applications 2025年第8期37卷 6125-6144页

作者： Samy, Tassneam M. Asham, Beshoy I. Slim, Salwa O. Abohany, Amr A. Department of Computer Science Faculty of Computers and Artificial Intelligence Helwan University Cairo Egypt Department of Information Systems Faculty of Computers and Information Damanhour University Damanhour Egypt Department of Information Systems Faculty of Computers and Information Kafrelsheikh University Kafrelsheikh Egypt

In today’s digital age, consumers increasingly rely on online shopping for convenience and accessibility. However, a significant drawback of online shopping is the inability to physically try on clothing before purchasing. This limitation often leads to uncertainty regarding fit and style, resulting in customer post-purchase dissatisfaction and higher return rates. Research indicates that online items are three times more likely to be returned than in-store ones, especially during the pandemic. To address this challenge, we propose a virtual try-on method called FITMI, an enhanced Latent Diffusion Textual Inversion model for virtual try-on purposes. The proposed architecture aims to bridge the gap between traditional in-store try-ons and online shopping by offering users a realistic and interactive virtual try-on experience. Although virtual try-on solutions already exist, recent advancements in artificial intelligence have significantly enhanced their capabilities, enabling more sophisticated and realistic virtual try-on experiences than ever before. Building on these advancements, FITMI surpasses ordinary virtual try-ons relying on generative adversarial networks, often producing unrealistic outputs. Instead, FITMI utilizes latent diffusion models to generate high-quality images with detailed textures. As a web application, FITMI facilitates virtual try-ons by seamlessly integrating images of users with garments from catalogs, providing a true-to-life representation of how the items would look. This approach differentiates us from competitors. FITMI is validated using two widely recognized benchmarks: the Dress-Code and Viton-HD datasets. Additionally, FITMI acts as a trusted style advisor, enhancing the shopping experience by recommending complementary items to elevate the chosen garment and suggesting similar options based on user preferences. © The Author(s) 2025.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Advanced Machine Learning Approaches for Breast Cancer Detection with Neutrosophic Sets

引用

Neutrosophic Sets and systems 2025年 81卷 273-284页

作者： Elbehiery, Hussam Fathi, Hanaa Eassa, Mohamed Abdelhafeez, Ahmed Abdellah, Mohamed Refaat Mahmoud, Hadeer Computer Science Department Faculty of Information System and Computer Science October 6 University Giza12585 Egypt College of Information Technology Amman Arab University Amman Jordan Applied Science Research Center Applied Science Private University Amman Jordan The Department of Computer Science College of Information Technology Misr University for Science and Technology Cairo Egypt Department of Artificial Intelligence Faculty of Computers and Artificial Intelligence Modern University for Technology & Information Cairo Egypt

Breast Cancer (BC) remains a significant health challenge for women and is one of the leading causes of mortality worldwide. Accurate diagnosis is critical for successful therapy and increased survival rates. Recent advances in medical imaging and computational technologies have enabled more precise methods of detecting and evaluating breast cancer. Accurate analysis and diagnosis utilizing medical imaging have developed as essential research topics, providing important help in clinical decision-making for various illnesses, including breast cancer. Machine learning (ML) can accurately predict breast cancer. But the breast cancer data has vague and uncertainty information. So, the neutrosophic sets (NSs) are used in this study to deal with uncertainty data. We convert the original dataset into neutrosophic data with three components such as truth, indeterminacy, and falsity values. Then we applied four ML models with N-data such as logistic regression, gradient boosting (GB), k-nearest neighbor (KNN), and support vector machines (SVM), to improve diagnostic accuracy. Then we compared the ML models with and without using N-data. The results show the logistic regression has higher accuracy with 98.6% with the N-data and 95.80% without N-data. So, the NSs can improve the accuracy of ML models. © 2025, University of New Mexico. All rights reserved.

关键词： Lung cancer

来源：评论

学校读者我要写书评

暂无评论

DP-ARTS: Dynamic Prioritization for Adaptive Resource Allocation and Task Scheduling in Cloud Computing

IAENG International Journal of Computer Science

引用

IAENG International Journal of computer science 2025年第3期52卷 793-807页

作者： BEN ALLA, Hicham BEN ALLA, Said EZZATI, Abdellah Computer Science Mathematics and Computer Science Department Science and Technical Faculty Hassan 1 University Settat Morocco Embedded Systems and Computer Science National School of Applied Sciences of Berrechid Hassan 1 University Settat Morocco

Efficient task scheduling and resource allocation are essential for optimizing performance in cloud computing environments. The presence of priority constraints necessitates advanced solutions capable of addressing the increased complexity in the task scheduling process and resource allocation management. In this paper, we propose a novel approach, Dynamic Prioritization and Adaptive Resource Allocation and Task Scheduling (DP-ARTS), to tackle these challenges by integrating dynamic task prioritization with adaptive resource allocation and scheduling strategies. Our approach introduces a scoring mechanism to prioritize tasks based on deadlines, resource requirements, and other critical characteristics. Furthermore, we utilize K-means clustering to group Virtual Machines (VMs) according to their capabilities, facilitating more efficient task-to-VM mapping. Through simulations conducted with real-world workload traces in the CloudSim toolkit, DP-ARTS demonstrates superior performance in reducing makespan and energy consumption, while also improving resource utilization and load balancing compared to existing solutions. © (2025), (International Association of Engineers). All rights reserved.

关键词： K-means clustering

来源：评论

学校读者我要写书评

暂无评论

Single-Valued Neutrosophic Graph with Heptapartitioend Structure

引用

Neutrosophic Sets and systems 2025年 80卷 728-748页

作者： Fathi, Hanaa Myvizhi, M. Abdelhafeez, Ahmed Abdellah, Mohamed Refaat Eassa, Mohamed Sawah, Mohamed S. Elbehiery, Hussam College of Information Technology Amman Arab University Amman Jordan KPR Institute of Engineering and Technology Tamilnadu Coimbatore India Computer Science Department Faculty of Information System and Computer Science October 6 University Giza12585 Egypt Applied Science Research Center Applied Science Private University Amman Jordan The Department of Computer Science College of Information Technology Misr University for Science and Technology Cairo Egypt Department of Computer Science Faculty of Information Technology Ajloun National University P.O.43 Ajloun26810 Jordan

This study applies single-valued neutrosophic sets, which extend the frameworks of fuzzy and intuitionistic fuzzy sets, to graph theory. We introduce a new category of graphs called Single-Valued Heptapartitioned Neutrosophic Graphs (SVHNG) and investigate their characteristics through comprehensive proofs and illustrative examples. © 2025, University of New Mexico. All rights reserved.

关键词： Heptapartitioend Neutrosophic Set Neutrosophic Graph Neutrosophic Sets SVHN-Graph

来源：评论

学校读者我要写书评

暂无评论

Enhanced MADM Strategy with Heptapartitioned Neutrosophic Distance Metrics

引用

Neutrosophic Sets and systems 2025年 78卷 74-96页

作者： Eassa, Mohamed Myvizhi, M. Elkholy, Mohamed Abdelhafeez, Ahmed Elbehiery, Hussam Computer Science Department Faculty of Information System and Computer Science October 6 University Giza12585 Egypt Applied Science Research Center Applied Science Private University Amman Jordan Department of Mathematics KPR Institute of Engineering and Technology Tamilnadu Coimbatore India Faculty of Computer Science& Engineering Alamein International University Egypt

In this work, a novel methodological approach to multi-attribute decision-making problems is developed and the notion of Heptapartitioned Neutrosophic Set Distance Measures (HNSDM) is introduced. By averaging the Penta-Partitioned Neutrosophic Distance Measures under particular conditional criteria, the suggested technique ranks the options. Additionally, we explore the fundamental characteristics of HNSDM and provide several illustrative theorems. The Heptapartitioned Neutrosophic Set Distance Measures are formulated based on the Hepta Neutrosophic Set. Lastly, a practical numerical example is provided to illustrate the efficacy of the suggested methodology. © 2025, University of New Mexico. All rights reserved.

关键词： Heptapartitioned Neutrosophic set Heptapartitioned Neutrosophic set and MADM strategy Heptapartitioned set Neutrosophic sine distance measure

来源：评论

学校读者我要写书评

暂无评论

A decentralized and privacy-preserving framework for electronic health records using blockchain

引用

Alexandria Engineering Journal 2025年 126卷 196-203页

作者： Alahmari, Saad Alshardan, Amal Al-Wesabi, Fahd N. Sorour, Shaymaa Alghushairy, Omar Alsini, Raed Khadidos, Alaa O. Duhayyim, Mesfer Al Department of Computer Science Applied College Northern Border University Arar Saudi Arabia Department of Information Systems College of Computer and Information Sciences Princess Nourah bint Abdulrahman University P.O. Box 84428 Riyadh11671 Saudi Arabia Department of Computer Science Applied College at Mahayil King Khalid University Saudi Arabia Department of Management Information Systems College of Business Administration King Faisal University Al-Ahsa31982 Saudi Arabia Department of Information Systems and Technology College of Computer Science and Engineering University of Jeddah Jeddah21589 Saudi Arabia Department of Information Systems Faculty of Computing and Information Technology King Abdulaziz University Jeddah Saudi Arabia Department of Computer Science College of Computer Engineering and Sciences Prince Sattam bin Abdulaziz University Al-Kharj16273 Saudi Arabia

As healthcare services have become increasingly digitized, Electronic Health Records (EHRs) have become widely adopted, providing seamless data exchange among providers. Conventional EHRs, however, are extremely vulnerable to cyber threats because patients' sensitive data is centralized and transmitted electronically. The paper proposes a decentralized, privacy-preserving framework for managing EHRs on blockchains in order to address these security and privacy concerns. Using cryptographic techniques, such as homomorphic encryption and zero-knowledge proofs, the proposed system enhances security and ensures data integrity. Additionally, the model facilitates scalable, efficient, and secure access to patient records through the integration of cloud-based storage and blockchain. Using smart contracts, we also ensure compliance with healthcare regulations by regulating access control and authentication. As a result of performance evaluations, the proposed approach is demonstrated to be feasible, and the advantages it offers in terms of security, privacy, and efficiency are highlighted. © 2025 The Authors

关键词： Electronic health record

来源：评论

学校读者我要写书评

暂无评论

An Adaptive Vehicle Location Prediction Using Machine Learning: A Case Study of Campus Shuttle Bus

引用

IEEE Access 2025年 13卷 78290-78302页

作者： Nandy, Tarak Kolandaisamy, Raenu Noor, Rafidah Md Bhattacharyya, Sananda UCSI University Institute of Computer Science and Digital Innovation Kuala Lumpur56000 Malaysia Universiti Malaya Faculty of Computer Science and Information Technology Department of Computer Systems and Technology Kuala Lumpur50603 Malaysia Faculty of Computer Science and Information Technology Kuala Lumpur50603 Malaysia Maldives Business School Department of Information Technology Male20175 Maldives

Vehicle location prediction and the use of vehicle location tracking are increasingly important topics of discussion among connected vehicle researchers. Location tracking for mobile users is essential due to the correlated services and to improve the quality of service;however, it is challenging. On the other hand, the stateless predictive model is unsuitable due to less accuracy and mismatch pattern analysis. This paper proposed a vehicle location prediction model using machine learning based on a case study of a campus shuttle bus scenario. Firstly, this paper comprehensively analyzes the recent research on vehicle location prediction models and provides a complete taxonomy. The proposed model uses the Support Vector Regression (SVR) based vehicle location predictive model in the implementation phase. In addition, a significant time-series predictive model, ARIMA, is configured and tested. Moreover, the seasonal ARIMA model is experimented with to predict the location of a mobile vehicle. The whole experiment is performed on a real dataset based on the university shuttle bus service. The results of the experiments, analysis, and discussions on the proposed model show the accuracy and effectiveness of their use on others. As a result, seasonal ARIMA outperformed ARIMA and SVR infractions. © 2013 IEEE.

关键词： Prediction models

来源：评论

学校读者我要写书评

暂无评论

Rüppell’s fox optimizer: A novel meta-heuristic approach for solving global optimization problems

引用

Cluster Computing 2025年第5期28卷 1-77页

作者： Braik, Malik Al-Hiary, Heba Computer Science Department Prince Abdullah bin Ghazi Faculty of Information and Communication Technology Al-Balqa Applied University Salt Jordan

A new swarm-based, nature-inspired meta-heuristic method, called Rüppell’s Fox Optimizer (RFO), is designed and examined in this study to address global optimization problems. RFO takes inspiration from the natural and intelligent communal foraging practices of Rüppell’s foxes, both during the day and at night. The optimizer mathematically simulates a variety of chief foraging activities of Rüppell’s foxes using their acute eyesight, hearing, and scent to hunt, to accommodate both exploration and exploitation aspects throughout the optimization action. The RFO algorithm simulates the rotating eyes’ feature of Rüppell’s foxes to a field of view of about 260°, as well as the feature of rotating their ears to a field of hearing of about 150°. Further, a cognitive component, ρ, is designed to oversee the evolution from global search to local search as well as the equilibrium between exploration and exploitation within the search domain. Based on Rüppell’s foxes’ foraging qualities, RFO reveals a variety of foraging habits. The dynamic patterns and activities of Rüppell’s foxes were mathematically mimicked in this study to create an efficient global optimizer, which when applied to optimization problems, ultimately yields feasible solutions. The performance level of RFO was thoroughly examined through a comparison with 12 other algorithms using three challenging test sets: Congress on Evolutionary Computation 2017 (CEC 2017) group with 29 test functions of various dimensions, the Congress on Evolutionary Computation 2019 (CEC 2019) with 10 test functions, and CEC 2020 set with 10 test functions. Using mean rank of Friedman’s test, RFO outperformed other comparative algorithms by 31.25%, 34.04%, 32.36%, and 55.13% on the 10-, 30-, 50-, and 100-dimensional CEC 2017 test set, respectively, 57.11% on the CEC 2019 test suite with 10 dimensions, 48.59%,and 51.68% on the 10- and 20-dimensional CEC 2020 set, respectively. The applicability of RFO is thoroughly examined on 6 clas

关键词： Heuristic methods

来源：评论

学校读者我要写书评

暂无评论

Dynamic Resource Utilization Prediction Model for Cloud Datacenter

引用

IAENG International Journal of applied Mathematics 2025年第2期55卷 307-331页

作者： Bliedy, Doaa Khafagy, Mohamed H. Badry, Rasha M. Department of Information Systems Faculty of Computers and Artificial Intelligence Fayoum University Egypt Department of Computer Science Faculty of Computers and Artificial Intelligence Fayoum University Egypt

Much research has been done on predicting resource utilization in the cloud to avoid over- and under-provisioning resources. Most existing systems focus on estimating the utilization of one or two resources at most, including memory, CPU, storage, network, or servers dedicated to cloud applications;they do not consider the correlation between resources. A maximum of one or two machine learning algorithms is employed for prediction purposes. Additionally, traditional prediction methods in the cloud provide a one-dimensional output. Most current solutions predict resources, such as memory and CPU utilization, as a single output. Unfortunately, a one-dimensional output in resource provision and usage cannot capture the relationship between the application requirements of different resources, such as CPU, memory, CPU cores, disk, and network;this results in incomplete and inaccurate information and prediction results. Efficient resource allocation and management require predicting several parameters using multivariate state variables. This study presents a multi-resource utilization prediction model that uses several machine learning approaches, such as support vector regression, random forests, MLP regression, neural networks (NN) using Adam and SGD optimizers, and decision tree regression. The prediction model is based on univariate and multivariate time series. Google cluster trace data is used to evaluate the work. Four experiments are executed on the dataset, seeking to predict the resources for different time series interval periods. The various algorithms’ mean absolute errors (MAE), root mean square error, mean absolute percentage error and R-squared are compared to determine which technique achieves the lowest error rate. The experimental results have shown that the prediction model yields better accuracy than previous research. © (2024), (International Association of Engineers). All rights reserved.

关键词： Prediction models

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：