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

IEEE Transactions on Artificial Intelligence 2024年第9期5卷 4428-4442页

作者： Hancer, Emrah Xue, Bing Zhang, Mengjie Victoria University of Wellington Center for Data Science and Artificial Intelligence School of Engineering and Computer Science Wellington6140 New Zealand Mehmet Akif Ersoy University Department of Software Engineering Burdur15039 Turkey

Multilabel learning is an emergent topic that addresses the challenge of associating multiple labels with a single instance simultaneously. Multilabel datasets often exhibit high dimensionality with noisy, irrelevant, and redundant features. In recent years, multilabel feature selection (MLFS) has gained prominence as a crucial and emerging machine learning task due to its ability to handle such data effectively. However, existing approaches for MLFS often prioritize top-ranked features based on intrinsic data criteria, disregarding relationships within the feature subset. Additionally, compared with conventional feature selection, multiobjective evolutionary algorithms (MOEAs) have not been widely explored in the context of MLFS. This study aims to address these gaps by proposing a multimodal multiobjective evolutionary algorithm (MMOEA) called MMDE_SICD which incorporates a preelimination scheme, an improved initialization scheme, an exploration scheme inspired by genetic operations and a statistically inspired crowding distance scheme. The results show that the proposed MMDE_SICD algorithm can outperform a variety of MOEAs and MMOEAs as well as conventional MLFS algorithms. Notably, this study is the first of its kind to consider MLFS as a multimodal multiobjective problem. © 2020 IEEE.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Gastrointestinal Diseases Classification Using Deep Transfer Learning and Features Optimization

引用

computers, Materials & Continua 2023年第4期75卷 2227-2245页

作者： Mousa Alhajlah Muhammad Nouman Noor Muhammad Nazir Awais Mahmood Imran Ashraf Tehmina Karamat College of Applied Computer Science King Saud University(Almuzahmiyah Campus)Riyadh11543Saudi Arabia Department of Computer Science HITEC UniversityTaxila47080Pakistan Department of Computer Engineering HITEC UniversityTaxila47080Pakistan Department of Software Engineering Foundation University IslamabadIslamabad44000Pakistan

Gastrointestinal diseases like ulcers, polyps’, and bleeding areincreasing rapidly in the world over the last decade. On average 0.7 millioncases are reported worldwide every year. The main cause of gastrointestinaldiseases is a Helicobacter Pylori (H. Pylori) bacterium that presents in morethan 50% of people around the globe. Many researchers have proposeddifferent methods for gastrointestinal disease using computer vision *** of them focused on the detection process and the rest of themperformed classification. The major challenges that they faced are the similarityof infected and healthy regions that misleads the correct classificationaccuracy. In this work, we proposed a technique based on Mask Recurrent-Convolutional Neural Network (R-CNN) and fine-tuned pre-trainedResNet-50 and ResNet-152 networks for feature extraction. Initially, the region ofinterest is detected using Mask R-CNN which is later utilized for the trainingof fine-tuned models through transfer learning. Features are extracted fromfine-tuned models that are later fused using a serial approach. Moreover, anImproved Ant Colony Optimization (ACO) algorithm has also opted for thebest feature selection from the fused feature vector. The best-selected featuresare finally classified using machine learning techniques. The experimentalprocess was conducted on the publicly available dataset and obtained animproved accuracy of 96.43%. In comparison with state-of-the-art techniques,it is observed that the proposed accuracy is improved.

关键词： Diseases deep learning endoscopy gastrointestinal tract transfer learning

来源：评论

学校读者我要写书评

暂无评论

Review on Image Processing for MRI-Focused Brain Tumor Identification Using Machine Learning 7

Review on Image Processing for MRI-Focused Brain Tumor Ident...

引用

7th Edition Global Conference on Wireless and Optical Technologies, GCWOT 2024

作者： Agha, Dur-E-Shawar Qazi, Farheen Rasheed, Rohail Ali Khan, M. Sadiq Naseem, Muhammad Mubeen, Tauseef Sir Syed University of Engineering & Technology Software Engineering Department Karachi Pakistan Computer Science Department Karachi Pakistan

ISBN: (纸本)9798331534271

Today, image processing plays a significant role in early disease detection, allowing doctors to treat conditions like breast, lung, and brain malignancies. A brain tumor is a serious condition that can be fatal. Brain tumor diagnosis is the most important task for early therapy, and automatic visual classification might be extremely important. It is essential to classify brain cancers in order to assess the tumor's and determine the best course of treatment for each class. To find brain tumors, numerous imaging modalities are used. However, MRI is frequently utilized since it produces superior images and uses no ionizing radiation. This research aims to provide a review of different Machine Learning (ML) techniques for detection and classification of brain tumor. Also, different feature extraction techniques are analyzed and their benefits are discussed. This review is conducted by different research papers which helps new researchers to start immediately a literature review and knowing different machine learning techniques their advantages and disadvantages to classify brain tumor through MRI. Also, they know the accuracy of each algorithm which leads them to directly target the problem not implementing the existing techniques. © 2024 IEEE.

关键词： Lung cancer

来源：评论

学校读者我要写书评

暂无评论

Framework for Agent-Based Multistage Application Partitioning Algorithm in Mobile Cloud Computing

引用

SN computer science 2024年第4期5卷 330页

作者： Kanwal, Asia Amjad, Tehmina Ashraf, Humaira Department of Computer Science and Software Engineering International Islamic University H10 Islamabad 44000 Pakistan

The idea of computational offloading is quickly catching on in the world of mobile cloud computing (MCC). Today’s applications have heavy demands on power and computing resources, creating issues with energy consumption, storage capacity, and mobile device performance. Mobile devices may efficiently offload their calculations to cloud servers using the offloading paradigm and then get the processed results back onto the device. The investigation relates to identifying the specific application components that should be offloaded and run remotely and which parts are supposed to be treated locally. The applications need to be partitioned to differentiate between remote and local codes. In this paper, an agent-based multistage graph partitioning (ABMP) scheme is proposed. The framework of the scheme is based on three-tier architecture that includes mobile, cloudlet, and cloud for the execution of application tasks. The main goal is to provide an efficient partitioning and offloading scheme in the mobile cloud computing area. The results show that incorporating both agent-based multistage graph partitioning and offloading algorithms yields superior performance as compared to previous methods in terms of reducing execution costs and conserving battery life for mobile devices. © The Author(s) 2024.

关键词： Agent-based partitioning Application partitioning Edge computing Mobile cloud computing Multistage graph partitioning Ready time partitioning offloading

来源：评论

学校读者我要写书评

暂无评论

Loop Subgraph-Level Greedy Mapping Algorithm for Grid Coarse-Grained Reconfigurable Array

引用

Tsinghua science and Technology 2023年第2期28卷 330-343页

作者： Naijin Chen Fei Cheng Chenghao Han Jianhui Jiang Xiaoqing Wen School of Computer and Information Science Anhui Polytechnic UniversityWuhu 241000China School of Software Engineering Tongji UniversityShanghai 201804China Department of Computer Science and Networks Kyushu Institute of TechnologyFukuoka 820-8502Japan

To solve the problem of grid coarse-grained reconfigurable array task mapping under multiple constraints,we propose a Loop Subgraph-Level Greedy Mapping(LSLGM)algorithm using parallelism and processing element *** the constraint of a reconfigurable array,the LSLGM algorithm schedules node from a ready queue to the current reconfigurable cell array *** mapping a node,its successor’s indegree value will be dynamically *** its successor’s indegree is zero,it will be directly scheduled to the ready queue;otherwise,the predecessor must be dynamically *** the predecessor cannot be mapped,it will be scheduled to a blocking *** dynamically adjust the ready node scheduling order,the scheduling function is constructed by exploiting factors,such as node number,node level,and node *** with the loop subgraph-level mapping algorithm,experimental results show that the total cycles of the LSLGM algorithm decreases by an average of 33.0%(PEA44)and 33.9%(PEA_(7×7)).Compared with the epimorphism map algorithm,the total cycles of the LSLGM algorithm decrease by an average of 38.1%(PEA_(4×4))and 39.0%(PEA_(7×7)).The feasibility of LSLGM is verified.

关键词： Grid Coarse-Grained Reconfigurable Array(GCGRA) mapping loop subgraph scheduling

来源：评论

学校读者我要写书评

暂无评论

DNA Computing with Water Strider Based Vector Quantization for Data Storage Systems

引用

computers, Materials & Continua 2023年第3期74卷 6429-6444页

作者： A.Arokiaraj Jovith S.Rama Sree Gudikandhula Narasimha Rao K.Vijaya Kumar Woong Cho Gyanendra Prasad Joshi Sung Won Kim Department of Networking and Communications College of Engineering and TechnologySRM Institute of Science and TechnologyKattankulathur603203India Department of Computer Science Engineering Aditya Engineering CollegeSurampalemAndhra Pradesh533437India Department of Computer Science and Engineering Vignan’s Institute of Information TechnologyVisakhapatnam530049India Department of Computer Science and Engineering Vignan’s Institute of Engineering for WomenVisakhapatnam530049India Department of Software Convergence Daegu Catholic UniversityGyeongsan38430Korea Department of Computer Science and Engineering Sejong UniversitySeoul05006Korea Department of Information and Communication Engineering Yeungnam UniversityGyeongsan-siGyeongbuk-do38541Korea

The exponential growth of data necessitates an effective data storage scheme,which helps to effectively manage the large quantity of *** accomplish this,Deoxyribonucleic Acid(DNA)digital data storage process can be employed,which encodes and decodes binary data to and from synthesized strands of *** quantization(VQ)is a commonly employed scheme for image compression and the optimal codebook generation is an effective process to reach maximum compression *** article introduces a newDNAComputingwithWater StriderAlgorithm based Vector Quantization(DNAC-WSAVQ)technique for Data Storage *** proposed DNAC-WSAVQ technique enables encoding data using DNA computing and then compresses it for effective data ***,the DNAC-WSAVQ model initially performsDNA encoding on the input images to generate a binary encoded *** addition,aWater Strider algorithm with Linde-Buzo-Gray(WSA-LBG)model is applied for the compression process and thereby storage area can be considerably *** order to generate optimal codebook for LBG,the WSA is applied to *** performance validation of the DNAC-WSAVQ model is carried out and the results are inspected under several *** comparative study highlighted the improved outcomes of the DNAC-WSAVQ model over the existing methods.

关键词： DNA computing data storage image compression vector quantization ws algorithm space saving

来源：评论

学校读者我要写书评

暂无评论

Adaptive Resource Planning for AI Workloads with Variable Real-Time Tasks

引用

computers, Materials & Continua 2023年第3期74卷 6823-6833页

作者： Sunhwa Annie Nam Kyungwoon Cho Hyokyung Bahn Department of Computer Science and Engineering Ewha UniversitySeoul03760Korea Embedded Software Research Center Ewha UniversitySeoul03760Korea

AI(Artificial Intelligence)workloads are proliferating in modernreal-time *** the tasks of AI workloads fluctuate over time,resourceplanning policies used for traditional fixed real-time tasks should be *** particular,it is difficult to immediately handle changes inreal-time tasks without violating the deadline *** cope with thissituation,this paper analyzes the task situations of AI workloads and findsthe following two ***,resource planning for AI workloadsis a complicated search problem that requires much time for ***,although the task set of an AI workload may change over time,thepossible combinations of the task sets are known in *** on theseobservations,this paper proposes a new resource planning scheme for AIworkloads that supports the re-planning of *** of generatingresource plans on the fly,the proposed scheme pre-determines resourceplans for various combinations of ***,in any case,the workload isimmediately executed according to the resource plan ***,the proposed scheme maintains an optimized CPU(Central Processing Unit)and memory resource plan using genetic algorithms and applies it as soonas the workload *** proposed scheme is implemented in the opensourcesimulator SimRTS for the validation of its *** show that the proposed scheme reduces the energy consumptionof CPU and memory by 45.5%on average without deadline misses.

关键词： Resource planning artificial intelligence real-time system task scheduling optimization problem genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年第5期6卷 1360-1372页

作者： Wang, Shuyue Liu, Zhunga Zhang, Zuowei Bennamoun, Mohammed Northwestern Polytechnical University School of Automation Shaanxi Xi’an710072 China The University of Western Australia Department of Computer Science and Software Engineering PerthWA6009 Australia

Multimodal domain adaptation (MMDA) aims to transfer knowledge across different domains that contain multimodal data. Current methods typically assume that both the source and target domains have paired multimodal data with the same modalities, allowing for direct knowledge transfer between corresponding types of data. However, in certain applications, the source domain benefits from advanced sensors and equipment, capturing more modalities than those available in the target domain. As a result, the information from the source modalities may not strongly align with that of the target modalities. This weak correlation hinders the effective utilization of all source data for the target domain. To address this challenge, we propose a weakly correlated multimodal domain adaptation (WCMMDA) method for pattern classification. WCMMDA is designed to acquire the modality-independent and category-related knowledge from the source domain, enabling the full utilization of available source modalities for effective knowledge transfer. Specifically, modality-invariant features are first extracted from the multimodal data to bridge the heterogeneity gap within each domain. Subsequently, domain-invariant features are further learned from these modality-invariant features to align the feature distributions across the source and target domains. A source-specific classifier is employed here, which predicts pseudo-labels for the target data and enables the feature extractor to explore category-related information in source features. Finally, a target-specific classifier is trained using the pseudolabeled target data, where highly reliable pseudolabels are selected based on confidence to improve classification performance. Extensive experiments are performed on the real-world multimodal datasets to demonstrate the superiority of WCMMDA. © 2020 IEEE.

关键词： Labeled data

来源：评论

学校读者我要写书评

暂无评论

Characterization of Memory Access in Deep Learning and Its Implications in Memory Management

引用

computers, Materials & Continua 2023年第7期76卷 607-629页

作者： Jeongha Lee Hyokyung Bahn Institute of Artificial Intelligence and Software Ewha UniversitySeoul03760Korea Department of Computer Science and Engineering Ewha UniversitySeoul03760Korea

Due to the recent trend of software intelligence in the Fourth Industrial Revolution,deep learning has become a mainstream workload for modern computer *** the data size of deep learning increasingly grows,managing the limited memory capacity efficiently for deep learning workloads becomes *** this paper,we analyze memory accesses in deep learning workloads and find out some unique characteristics differentiated from traditional ***,when comparing instruction and data accesses,data access accounts for 96%–99%of total memory accesses in deep learning workloads,which is quite different from traditional ***,when comparing read and write accesses,write access dominates,accounting for 64%–80%of total memory ***,although write access makes up the majority of memory accesses,it shows a low access bias of 0.3 in the Zipf ***,in predicting re-access,recency is important in read access,but frequency provides more accurate information in write *** on these observations,we introduce a Non-Volatile Random Access Memory(NVRAM)-accelerated memory architecture for deep learning workloads,and present a new memory management policy for this *** considering the memory access characteristics of deep learning workloads,the proposed policy improves memory performance by 64.3%on average compared to the CLOCK policy.

关键词： Memory access deep learning machine learning memory access memory management CLOCK

来源：评论

学校读者我要写书评

暂无评论

Defect Detection Model Using Time Series Data Augmentation and Transformation

引用

computers, Materials & Continua 2024年第2期78卷 1713-1730页

作者： Gyu-Il Kim Hyun Yoo Han-Jin Cho Kyungyong Chung Department of Computer Science Kyonggi UniversitySuwon-si16227Korea Contents Convergence Software Research Institue Kyonggi UniversitySuwon-si16227Korea Department of Energy IT Engineering Far East UniversityEumsung-gun27601Korea Division of AI Computer Science and Engineering Kyonggi UniversitySuwon-si16227Korea

Time-series data provide important information in many fields,and their processing and analysis have been the focus of much ***,detecting anomalies is very difficult due to data imbalance,temporal dependence,and ***,methodologies for data augmentation and conversion of time series data into images for analysis have been *** paper proposes a fault detection model that uses time series data augmentation and transformation to address the problems of data imbalance,temporal dependence,and robustness to *** method of data augmentation is set as the addition of *** involves adding Gaussian noise,with the noise level set to 0.002,to maximize the generalization performance of the *** addition,we use the Markov Transition Field(MTF)method to effectively visualize the dynamic transitions of the data while converting the time series data into *** enables the identification of patterns in time series data and assists in capturing the sequential dependencies of the *** anomaly detection,the PatchCore model is applied to show excellent performance,and the detected anomaly areas are represented as heat *** allows for the detection of anomalies,and by applying an anomaly map to the original image,it is possible to capture the areas where anomalies *** performance evaluation shows that both F1-score and Accuracy are high when time series data is converted to ***,when processed as images rather than as time series data,there was a significant reduction in both the size of the data and the training *** proposed method can provide an important springboard for research in the field of anomaly detection using time series ***,it helps solve problems such as analyzing complex patterns in data lightweight.

关键词： Defect detection time series deep learning data augmentation data transformation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：