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

21st International Learning and Technology Conference, L and T 2024

作者： Jaman, Layan Alsharabi, Reem Elkafrawy, Passent M. Effat University Effat College of Engineering Energy and Technology Research Center Computer Science Department Jeddah Saudi Arabia

ISBN: (纸本)9798350393569

The rapid advancements in artificial intelligence (AI) have primarily focused on the process of learning from data to acquire knowledge for smart systems. However, the concept of machine unlearning has emerged as a transformative paradigm shift in the field of AI, due to the amount of false information that have been learned over the past. Machine unlearning refers to the ability of AI systems to reverse or discard previously acquired knowledge or patterns, enabling them to adapt and refine their understanding in response to changing circumstances or new insights. This paper explores the concept of machine unlearning, its implications, methods, challenges, and potential applications. The paper begins by providing an overview of the traditional learning-based approaches in AI and the limitations they impose on system adaptability and agility. It then delves into the concept of machine unlearning, discussing various techniques and algorithms employed to remove or modify learned knowledge from AI models or datasets. © 2024 IEEE.

关键词： Adaptive algorithms

来源：评论

学校读者我要写书评

暂无评论

Enhanced Emotion Recognition Using a Hybrid Autoencoder-LSTM Model Optimized with a Hybrid ACO-WOA Algorithm for Hyperparameter Tuning

引用

International Journal of Advanced computer science and Applications 2025年第4期16卷 861-876页

作者： Waiker, Vinod Ramesh, Janjhyam Venkata Naga Bala, Ms Kiran Krishnaiah, V.V. Jaya Rama Jackulin, T. Muniyandy, Elangovan Shahin, Osama R. Datta Meghe Institute of Management Studies Maharashtra Nagpur India Department of CSE Graphic Era Hill University Dehradun248002 India Department of CSE Graphic Era Deemed To Be University Uttarakhand Dehradun248002 India Department of Computer Science College of Engineering and Computer Science Jazan University Jazan Saudi Arabia Department of Computer Science and Engineering Koneru Lakshmaiah Education Foundation Andhra Pradesh Vaddeswaram India Department of CSE Panimalar Engineering College Tamil Nadu Chennai India Department of Biosciences-Saveetha School of Engineering Saveetha Institute of Medical and Technical Sciences Chennai602 105 India Applied Science Research Center Applied Science Private University Amman Jordan Department of Computer Science College of Computer and Information Sciences Jouf University Saudi Arabia Physics and Mathematics Department Faculty of Engineering Helwan University Helwan Egypt

Emotion recognition is vital in the human computer interaction because it improves interaction. Therefore, this paper proposes an improved method for emotion recognition regarding the Hybrid Autoencoder-Long Short-Term Memory (LSTM) model and the newly developed hybrid approach of the Ant Colony Optimization (ACO) and Whale Optimization Algorithm (WOA) for hyperparameters tuning. In this case, Autoencoder can reduce input data dimensionality for input data and find the features relevant for the model’s work. In addition, LSTM is able to work with temporal structures of sequential inputs like speech and videos. The contribution of this research lies in the novel combination method of ACO-WOA which aims at tweaking hyperparameters of Autoencoder-LSTM model. Global aspect of ACO and WOA thereby improve the search efficiency and the accuracy of the proposed emotion recognition system and its generalization capacity. In context with the benchmark dataset for the experimentations of emotion recognition, it has established the efficiency of the proposed model in terms of the conventional methods. Recall rates in recognitive intended various emotions and different modalities were also higher in the hybrid Autoencoder-LSTM model. The optimization algorithms like the ACO-WOA also supported in reducing the computational cost which arose due to hyperparameters tuning. The implementation of this paper is done through Python Software. This implementation shows a high accuracy of 94.12% and 95.94% for audio datasets and image datasets respectively when compared with other deep learning models of Conv LSTM and VGG16. Therefore, the research shows that the presented hybrid approach can be a useful solution for successfully employing emotion recognition for enhancing the creation of the empathetic AI systems and for improving user interactions within various fields including healthcare, entertainment, and customer support. © (2025), (science and Information Organization). All rights

关键词： Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

Adventures in data analysis: a systematic review of Deep Learning techniques for pattern recognition in cyber-physical-social systems

引用

Multimedia Tools and Applications 2024年第8期83卷 22909-22973页

作者： Amiri, Zahra Heidari, Arash Navimipour, Nima Jafari Unal, Mehmet Mousavi, Ali Department of Computer Engineering Tabriz Branch Islamic Azad University Tabriz Iran Department of Software Engineering Haliç University Istanbul34060 Turkey Department of Computer Engineering Kadir Has Universitesi Istanbul Turkey Future Technology Research Center National Yunlin University of Science and Technology Douliou64002 Taiwan Department of Computer Engineering Nisantasi Universitesi Istanbul Turkey Islamic Azad University Sanandaj Branch Sanandaj Iran

Machine Learning (ML) and Deep Learning (DL) have achieved high success in many textual, auditory, medical imaging, and visual recognition patterns. Concerning the importance of ML/DL in recognizing patterns due to its high accuracy, many researchers argued for many solutions for improving pattern recognition performance using ML/DL methods. Due to the importance of the required intelligent pattern recognition of machines needed in image processing and the outstanding role of big data in generating state-of-the-art modern and classical approaches to pattern recognition, we conducted a thorough Systematic Literature Review (SLR) about DL approaches for big data pattern recognition. Therefore, we have discussed different research issues and possible paths in which the abovementioned techniques might help materialize the pattern recognition notion. Similarly, we have classified 60 of the most cutting-edge articles put forward pattern recognition issues into ten categories based on the DL/ML method used: Convolutional Neural Network (CNN), Recurrent Neural Network (RNN), Generative Adversarial Network (GAN), Autoencoder (AE), Ensemble Learning (EL), Reinforcement Learning (RL), Random Forest (RF), Multilayer Perception (MLP), Long-Short Term Memory (LSTM), and hybrid methods. SLR method has been used to investigate each one in terms of influential properties such as the main idea, advantages, disadvantages, strategies, simulation environment, datasets, and security issues. The results indicate most of the articles were published in 2021. Moreover, some important parameters such as accuracy, adaptability, fault tolerance, security, scalability, and flexibility were involved in these investigations. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2023.

关键词： Pattern recognition

来源：评论

学校读者我要写书评

暂无评论

Maximizing Resource Efficiency in Cloud Data centers through Knowledge-Based Flower Pollination Algorithm (KB-FPA)

引用

computers, Materials & Continua 2024年第6期79卷 3757-3782页

作者： Nidhika Chauhan Navneet Kaur Kamaljit Singh Saini Sahil Verma Kavita Ruba Abu Khurma Pedro A.Castillo University Institute of Computing Department Chandigarh UniversityPunjab140413India Department of Computer Science and Engineering Chandigarh UniversityPunjab140413India Universidade Federal do Piauí TeresinaPiauí64049-550Brazil MEU Research Unit Faculty of Information TechnologyMiddle East UniversityAmman11831Jordan Applied Science Research Center Applied Science Private UniversityAmman11931Jordan Department of Computer Engineering Automatics and RoboticsUniversity of GranadaGranada18071Spain

Cloud computing is a dynamic and rapidly evolving field,where the demand for resources fluctuates *** paper delves into the imperative need for adaptability in the allocation of resources to applications and services within cloud computing *** motivation stems from the pressing issue of accommodating fluctuating levels of user demand *** adhering to the proposed resource allocation method,we aim to achieve a substantial reduction in energy *** reduction hinges on the precise and efficient allocation of resources to the tasks that require those most,aligning with the broader goal of sustainable and eco-friendly cloud computing *** enhance the resource allocation process,we introduce a novel knowledge-based optimization *** this study,we rigorously evaluate its efficacy by comparing it to existing algorithms,including the Flower Pollination Algorithm(FPA),Spark Lion Whale Optimization(SLWO),and Firefly *** findings reveal that our proposed algorithm,Knowledge Based Flower Pollination Algorithm(KB-FPA),consistently outperforms these conventional methods in both resource allocation efficiency and energy consumption *** paper underscores the profound significance of resource allocation in the realm of cloud *** addressing the critical issue of adaptability and energy efficiency,it lays the groundwork for a more sustainable future in cloud computing *** contribution to the field lies in the introduction of a new resource allocation strategy,offering the potential for significantly improved efficiency and sustainability within cloud computing infrastructures.

关键词： Cloud computing resource allocation energy consumption optimization algorithm flower pollination algorithm

来源：评论

学校读者我要写书评

暂无评论

Personality-based and trust-aware products recommendation in social networks

引用

Applied Intelligence 2023年第1期53卷 879-903页

作者： Vatani, Nasim Rahmani, Amir Masoud Javadi, Hamid Haj Seyyed Department of Computer Engineering Science and Research Branch Islamic Azad University Tehran Iran Future Technology Research Center National Yunlin University of Science and Technology 123 University Road Section 3 Yunlin Douliou64002 Taiwan Department of Mathematics and Computer Science Shahed University Tehran Iran

In recent years, with the development of technology, the shopping approach of people has moved towards pervasive online social shopping. As a result, how to create a recommendation algorithm that offers products based on the personal and different needs and tastes of people on social networks is a significant research issue. This article proposes a personality-based and trust-aware probabilistic product recommendation algorithm in social networks. We present a dynamic method for determining how similar people in social networks are. For this purpose, we consider the personality-based features of recommendation attributes of products in social networks. Then, the level of trust of products and types of correlations among the products is considered to create a probabilistic matrix of product recommendation. Moreover, for solving the cold start problem of products, we consider qualitative aspects of products while exploiting personality-based user behavior regarding their purchases. At last, the empirical experiments are conducted to analyze the impact of the algorithm’s different influence factors using the Amazon dataset. Moreover, the results of comprehensive experiments adopted to verify the proposed personalized recommendation algorithm’s effectiveness show that the proposed algorithm has the appropriate effectiveness and the higher accuracy. © 2022, The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature.

关键词： Behavioral research

来源：评论

学校读者我要写书评

暂无评论

A Scalable Algorithm for Fair Influence Maximization with Unbiased Estimator

引用

IEEE Transactions on Knowledge and Data engineering 2025年第7期37卷 3881-3895页

作者： Rui, Xiaobin Wang, Zhixiao Peng, Hao Chen, Wei Yu, Philip S. China University of Mining and Technology School of Computer Science Jiangsu Xuzhou221116 China Mine Digitization Engineering Research Center of the Ministry of Education Jiangsu Xuzhou221116 China Beihang University School of Cyber Science and Technology Beijing100191 China Theory Center of Microsoft Research Asia Beijing100080 China University of Illinois at Chicago Department of Computer Science ChicagoIL60607 United States

This paper studies the fair influence maximization problem with efficient algorithms. In particular, given a graph G, a community structure C consisting of disjoint communities, and a budget k, the problem asks to select a seed set S (||S|| = k) that maximizes the influence spread while narrowing the influence gap between different communities. This problem derives from some significant social scenarios, such as health interventions (e.g. suicide/HIV prevention) where individuals from racial minorities or LGBTQ communities may be disproportionately excluded from the benefits of the intervention. To depict the concept of fairness in the context of influence maximization, researchers have proposed various notions of fairness, where the welfare fairness notion that better balances fairness level and influence spread has shown promising effectiveness. However, the lack of efficient algorithms for optimizing the objective function under welfare fairness restricts its application to networks of only a few hundred nodes. In this paper, we modify the objective function of welfare fairness to maximize the exponentially weighted sum and the logarithmically weighted sum over all communities' influenced fractions (utility). To achieve efficient algorithms with theoretical guarantees, we first introduce two unbiased estimators: one for the fractional power of the arithmetic mean and the other for the logarithm of the arithmetic mean. Then, by adapting the Reverse Influence Sampling (RIS) approach, we convert the optimization problem to a weighted maximum coverage problem. We also analyze the number of reverse reachable sets needed to approximate the fair influence at a high probability. Finally, we present an efficient algorithm that guarantees 1 - 1/e - ϵ (positive objective function) or 1 + 1/e + ϵ (negative objective function) approximation for any small ϵ > 0. Experiments demonstrate that our proposed algorithm could efficiently handle large-scale networks with good performa

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Multi-trial Vector-based Whale Optimization Algorithm

引用

Journal of Bionic engineering 2024年第3期21卷 1465-1495页

作者： Mohammad H.Nadimi-Shahraki Hajar Farhanginasab Shokooh Taghian Ali Safaa Sadiq Seyedali Mirjalili Faculty of Computer Engineering Najafabad BranchIslamic Azad UniversityNajafabad***Iran Big Data Research Center Najafabad BranchIslamic Azad UniversityNajafabad***Iran Department of Computer Science Nottingham Trent UniversityNottinghamNG118NSUK Centre for Artificial Intelligence Research and Optimisation Torrens UniversityBrisbane4006Australia

The Whale Optimization Algorithm(WOA)is a swarm intelligence metaheuristic inspired by the bubble-net hunting tactic of humpback *** spite of its popularity due to simplicity,ease of implementation,and a limited number of parameters,WOA’s search strategy can adversely affect the convergence and equilibrium between exploration and exploitation in complex *** address this limitation,we propose a new algorithm called Multi-trial Vector-based Whale Optimization Algorithm(MTV-WOA)that incorporates a Balancing Strategy-based Trial-vector Producer(BS_TVP),a Local Strategy-based Trial-vector Producer(LS_TVP),and a Global Strategy-based Trial-vector Producer(GS_TVP)to address real-world optimization problems of varied degrees of ***-WOA has the potential to enhance exploitation and exploration,reduce the probability of being stranded in local optima,and preserve the equilibrium between exploration and *** the purpose of evaluating the proposed algorithm's performance,it is compared to eight metaheuristic algorithms utilizing CEC 2018 test ***,MTV-WOA is compared with well-stablished,recent,and WOA variant *** experimental results demonstrate that MTV-WOA surpasses comparative algorithms in terms of the accuracy of the solutions and convergence ***,we conducted the Friedman test to assess the gained results statistically and observed that MTV-WOA significantly outperforms comparative ***,we solved five engineering design problems to demonstrate the practicality of *** results indicate that the proposed MTV-WOA can efficiently address the complexities of engineering challenges and provide superior solutions that are superior to those of other algorithms.

关键词： Swarm intelligence algorithms Metaheuristic algorithms Optimization engineering design problems Whale optimization algorithm

来源：评论

学校读者我要写书评

暂无评论

Detecting Double Mixed Compressed Images Based on Quaternion Convolutional Neural Network

引用

Chinese Journal of Electronics 2024年第3期33卷 657-671页

作者： Hao WANG Jinwei WANG Xuelong HU Bingtao HU Qilin YIN Xiangyang LUO Bin MA Jinsheng SUN Department of Automation Nanjing University of Science and Technology Engineering Research Center of Digital Forensics Ministry of Education Department of Computer and Software Nanjing University of Information Science and Technology School of Management Nanjing University of Posts and Telecommunications Department of Computer Science and Engineering Guangdong Province Key Laboratory of Information Security Technology Sun Yat-sen University State Key Laboratory of Mathematical Engineering and Advanced Computing Qilu University of Technology

Detection of color images that have undergone double compression is a critical aspect of digital image *** the existence of various methods capable of detecting double Joint Photographic Experts Group(JPEG) compression,they are unable to address the issue of mixed double compression resulting from the use of different compression *** particular,the implementation of Joint Photographic Experts Group 2000(JPEG2000)as the secondary compression standard can result in a decline or complete loss of performance in existing *** tackle this challenge of JPEG+JPEG2000 compression,a detection method based on quaternion convolutional neural networks(QCNN) is *** QCNN processes the data as a quaternion,transforming the components of a traditional convolutional neural network(CNN) into a quaternion *** relationships between the color channels of the image are preserved,and the utilization of color information is ***,the method includes a feature conversion module that converts the extracted features into quaternion statistical features,thereby amplifying the evidence of double *** results indicate that the proposed QCNN-based method improves,on average,by 27% compared to existing methods in the detection of JPEG+JPEG2000 compression.

关键词： Color image forensics JPEG JPEG2000 Mixed double compression Quaternion convolutional neural network

来源：评论

学校读者我要写书评

暂无评论

Ghost Module Based Residual Mixture of Self-Attention and Convolution for Online Signature Verification

引用

computers, Materials & Continua 2024年第4期79卷 695-712页

作者： Fangjun Luan Xuewen Mu Shuai Yuan Department of Computer Technology School of Computer Science and EngineeringShenyang Jianzhu UniversityShenyang110168China Liaoning Province Big Data Management and Analysis Laboratory of Urban Construction Shenyang Jianzhu UniversityShenyang110168China Shenyang Branch of National Special Computer Engineering Technology Research Center Shenyang Jianzhu UniversityShenyang110168China

Online Signature Verification (OSV), as a personal identification technology, is widely used in various ***, it faces challenges, such as incomplete feature extraction, low accuracy, and computational heaviness. Toaddress these issues, we propose a novel approach for online signature verification, using a one-dimensionalGhost-ACmix Residual Network (1D-ACGRNet), which is a Ghost-ACmix Residual Network that combines convolutionwith a self-attention mechanism and performs improvement by using Ghost method. The Ghost-ACmix Residualstructure is introduced to leverage both self-attention and convolution mechanisms for capturing global featureinformation and extracting local information, effectively complementing whole and local signature features andmitigating the problem of insufficient feature extraction. Then, the Ghost-based Convolution and Self-Attention(ACG) block is proposed to simplify the common parts between convolution and self-attention using the Ghostmodule and employ feature transformation to obtain intermediate features, thus reducing computational ***, feature selection is performed using the random forestmethod, and the data is dimensionally reducedusing Principal Component Analysis (PCA). Finally, tests are implemented on the MCYT-100 datasets and theSVC-2004 Task2 datasets, and the equal error rates (EERs) for small-sample training using five genuine andforged signatures are 3.07% and 4.17%, respectively. The EERs for training with ten genuine and forged signaturesare 0.91% and 2.12% on the respective datasets. The experimental results illustrate that the proposed approacheffectively enhances the accuracy of online signature verification.

关键词： Online signature verification feature selection ACG block ghost-ACmix residual structure

来源：评论

学校读者我要写书评

暂无评论

Drawing Order Diagrams Through Two-Dimension Extension

引用

Journal of Graph Algorithms and Applications 2023年第9期27卷 783-802页

作者： Dürrschnabel, Dominik Hanika, Tom Stumme, Gerd Knowledge & Data Engineering Group Research Center for Information System Design & Department of Electrical Engineering and Computer Science University of Kassel Germany Institute of Computer Science University of Hildesheim Germany Berlin School of Library and Information Science Humboldt-Universität zu Berlin Germany

Ordinal real-world data such as concept hierarchies, ontologies, genealogies, or task dependencies in scheduling often has the property to not only contain pairwise comparable, but also incomparable elements. Order diagrams provide an important tool for understanding and thus discovering knowledge in such data. Easily readable drawings of such order diagrams are hard to come by, even for small ordered sets. Many attempts were made to transfer classical graph drawing approaches to order diagrams. Although these methods produce satisfying results for some ordered sets, they unfortunately perform poorly in general. In this work, we present the novel algorithm DimDraw to decompose an ordered set (e.g., a concept hierarchy) in linear orders and to produce a corresponding order diagram. This algorithm is based on a relation between the dimension of an ordered set and the bipartiteness of its transitive incompatibility graph. To evaluate the quality of the algorithm, a user study was conducted where generated drawings were compared with ones from state-of-the-art drawing algorithms. © 2023 Brown University. All rights reserved.

关键词： Set theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：