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

6th Global Conference on Wireless and Optical Technologies, GCWOT 2023

作者： Aamir, Muhammad Bazai, Sibghatullah Bhatti, Uzair Aslam Dayo, Zaheer Ahmed Liu, Jing Zhang, Kun Huanggang Normal Univeristy College of Computer Science Huanggang China Balochistan University of Information Technology Engineering and Management Sciences Department of Computer Engineering Quetta Pakistan Hainan University School of Information and Communication Engineering Haikou China Zhejiang Lab Research Center for Healthcare Data Science Hangzhou China

ISBN: (纸本)9798350333718

With the continuous development of information technology and medical data information, more and more clinicians recognize artificial intelligence or will completely change medical practice by using advanced machine learning methods. The potential of using machine learning and predictive analysis to customize specific treatments for individuals is currently under research. Machine learning can learn a large number of medical data and explore the dependencies in data concentration, forming a corresponding medical model that can quickly and accurately predict new data, which is conducive to the early diagnosis of diseases and assisted clinical decisions. Clinical medicine faces the status quo of the relative shortage of medical resources and the identification and rapid diagnosis and treatment of critically ill emergency patients. In the era of big data, clinical demand is driven by clinical needs, and intelligent medical care provided by machines is the key to tackling the aforementioned issues. © 2023 IEEE.

关键词： Patient treatment

来源：评论

学校读者我要写书评

暂无评论

Generalizing Personalized Federated Graph Augmentation via Min-max Adversarial Learning 25

Generalizing Personalized Federated Graph Augmentation via M...

引用

Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and data Mining V.1

作者： Liang Zhang Tao Long Yang Liu Lei Zhang Laizhong Cui Qingjiang Shi Shenzhen Research Institute of Big Data Shenzhen Guangdong China College of Computer Science and Software Engineering Shenzhen University Shenzhen Guangdong China Data Science Research Center Dukekunshan University Kunshan Jiangsu China School of Software Engineering Tongji University Yangpu Shanghai China

ISBN: (纸本)9798400712456

Federated learning (FL) enables the training of a global machine learning model among multiple local clients in a collaborative fashion without directly sharing the details of their data. Due to this advantage, it has been utilized in a wide range of applications where privacy is a critical concern and has attracted great attention for graph representation learning (GRL). Despite the offered advances, there still exist two major challenges in the FL for GRL across distributed graph data, including heterogeneity and complementarity. In order to tackle these challenges, a novel personalized federated graph augmentation (PFGA) framework is proposed in this work. Unlike existing techniques, it utilizes generative models as bridges to enable information sharing among clients, thereby facilitating the collaborative training of GRL models. Instead of directly using the generative model trained on each client individually, we aggregate them into the globally generative model to gain a global view of the entire graph, which effectively alleviates the heterogeneity and complementarity issues simultaneously. We formulate the training of the generative and GRL models as a min-max adversarial learning problem and theoretically prove the convergence. Furthermore, the effectiveness of the method is demonstrated using experimental results on six real-world datasets.

关键词： federated learning

来源：评论

学校读者我要写书评

暂无评论

Breaking Barriers in Physical-World Adversarial Examples: Improving Robustness and Transferability via Robust Feature 39

Breaking Barriers in Physical-World Adversarial Examples: Im...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Wang, Yichen Chou, Yuxuan Zhou, Ziqi Zhang, Hangtao Wan, Wei Hu, Shengshan Li, Minghui National Engineering Research Center for Big Data Technology and System China Services Computing Technology and System Lab China Cluster and Grid Computing Lab China Hubei Engineering Research Center on Big Data Security China Hubei Key Laboratory of Distributed System Security China School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Computer Science and Technology Huazhong University of Science and Technology China School of Software Engineering Huazhong University of Science and Technology China

ISBN: (纸本)157735897X

As deep neural networks (DNNs) are widely applied in the physical world, many researches are focusing on physical-world adversarial examples (PAEs), which introduce perturbations to inputs and cause the model's incorrect outputs. However, existing PAEs face two challenges: unsatisfactory attack performance (i.e., poor transferability and insufficient robustness to environment conditions), and difficulty in balancing attack effectiveness with stealthiness, where better attack effectiveness often makes PAEs more perceptible. In this paper, we explore a novel perturbation-based method to overcome the challenges. For the first challenge, we introduce a strategy Deceptive RF injection based on robust features (RFs) that are predictive, robust to perturbations, and consistent across different models. Specifically, it improves the transferability and robustness of PAEs by covering RFs of other classes onto the predictive features in clean images. For the second challenge, we introduce another strategy Adversarial Semantic Pattern Minimization, which removes most perturbations and retains only essential adversarial patterns in AEs. Based on the two strategies, we design our method Robust Feature Coverage Attack (RFCoA), comprising Robust Feature Disentanglement and Adversarial Feature Fusion. In the first stage, we extract target class RFs in feature space. In the second stage, we use attention-based feature fusion to overlay these RFs onto predictive features of clean images and remove unnecessary perturbations. Experiments show our method's superior transferability, robustness, and stealthiness compared to existing state-of-the-art methods. Additionally, our method's effectiveness can extend to Large Vision-Language Models (LVLMs), indicating its potential applicability to more complex tasks. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

AI-Driven Sentiment Analysis for Music Composition 18th

AI-Driven Sentiment Analysis for Music Composition

引用

18th EAI International Conference on Tools for Design, Implementation and Verification of Emerging Information Technologies, TRIDENTCOM 2023

作者： Wang, Qinyuan Qu, Youyang Cheng, Haibo Yu, Yonghao Wang, Xiaodong Gu, Bruce Sydney Conservatorium of Music University of Sydney Sydney Australia Jinan China Faculty of Data Science City University of Macau China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China School of Engineering Design and Construction Melbourne Polytechnic Melbourne Australia

ISBN: (纸本)9783031513985

In the realm of music composition, sentiment plays a pivotal role in connecting compositions with their audience, evoking emotions and memories. With the rapid evolution of artificial intelligence (AI), there exists a burgeoning interest in utilizing AI for sentiment analysis in various domains, including textual data, social media, and film. This paper delves into the novel application of AI-driven sentiment analysis specifically tailored for music composition. Leveraging diverse music datasets across multiple genres and eras, we introduce an innovative methodology that breaks down music into foundational features such as melody, rhythm, timbre, and harmony. Through the application of advanced AI techniques, including neural networks and Long Short-Term Memory (LSTM) models, we aim to accurately map these features to a wide spectrum of sentiments. Our results showcase not only the potential accuracy and precision of our chosen models but also the richness of music compositions they can produce, underscoring the viability of AI in enhancing the emotional depth of musical works. The implications of this research stretch from aiding composers in creating more resonant pieces to the potential therapeutic applications of AI-composed music, tailored to specific emotional needs. © 2024, ICST Institute for computer sciences, Social Informatics and Telecommunications engineering.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

Pre-Training and Fine-Tuning for Efficient Routing in Opportunistic Networks

Pre-Training and Fine-Tuning for Efficient Routing in Opport...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Jia Hao Xiaorui Wu Winston K. G. Seah Feng Zhang Gang Xu Ministry of Education College of Computer Science Engineering Research Center of Ecological Big Data Inner Mongolia University Hohhot China School of Engineering & Computer Science Victoria University of Wellington Wellington New Zealand School of Computer and Information Technology Shanxi University Taiyuan China

ISBN: (数字)9781665410205

ISBN: (纸本)9781665410212

In opportunistic networks, it is a challenge to find the best relay node instead of blindly selecting from among available nodes to forward messages and effectively transmit them to their destinations. By comparing the similarity between nodes, the next hop node that is most similar to the destination node is found in time. Existing node similarity-based opportunistic networks routing algorithms only calculate similarity between nodes according to nodes' properties that can be directly obtained from the network, such as the historical meeting record between nodes, etc. However, this superficial similarity calculation is obviously inadequate to describe the inherent dynamic nature of opportunistic networks at both spatial and temporal levels, and ignores the salient movement characteristics of nodes, resulting in poor routing performance. Therefore, this paper proposes an opportunistic network routing strategy based on pre-training and fine-tuning (PTFT) model. Firstly, an autoencoder is added to the graph neural network model to encode node movement behavior. Then, a pre-training graph neural network model in large scale opportunistic network scenarios is applied to learn potential features of nodes through fine-tuning. Finally, we calculate the similarity between nodes based on the node potential feature, thereby assisting the nodes to achieve an efficient routing decision. The simulation results show that our PTFT-based algorithm not only has superior performance compared to traditional routing algorithms, but also faster learning speed than other machine learning-based routing algorithms.

关键词： Representation learning Machine learning algorithms Simulation Heuristic algorithms Autoencoders Routing Feature extraction Graph neural networks Relays Cybernetics

来源：评论

学校读者我要写书评

暂无评论

Can Language Models Serve as Temporal Knowledge Bases?

Can Language Models Serve as Temporal Knowledge Bases?

引用

2022 Findings of the Association for Computational Linguistics: EMNLP 2022

作者： Zhao, Ruilin Zhao, Feng Xu, Guandong Zhang, Sixiao Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China Data Science and Machine Intelligence Lab University of Technology Sydney Sydney Australia

Recent progress regarding the use of language models (LMs) as knowledge bases (KBs) has shown that language models can act as structured knowledge bases for storing relational facts. However, most existing works only considered the LM-as-KB paradigm in a static setting, which ignores the analysis of temporal dynamics of world knowledge. Furthermore, a basic function of KBs, i.e., the ability to store conflicting information (i.e., 1-N, N-1 and N-M relations), is underexplored. In this paper, we formulate two practical requirements for treating LMs as temporal KBs: (i) the capacity to store temporally-scoped knowledge that contains conflicting information and (ii) the ability to use stored knowledge for temporally-scoped knowledge queries. We introduce a new dataset called LAMA-TK which is aimed at probing temporally-scoped knowledge, and investigate the two above requirements to explore the LM-as-KB paradigm in the temporal domain. On the one hand, experiments show that LMs can memorize millions of temporally-scoped facts with relatively high accuracy and transfer stored knowledge to temporal knowledge queries, thereby expanding the LM-as-KB paradigm to the temporal domain. On the other hand, we show that memorizing conflicting information, which has been neglected by previous works, is still challenging for LMs and hinders the memorization of other unrelated one-to-one relationships. © 2022 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Incentive Mechanism of Selfish Nodes Based on Energy Optimization and Game Theory

Incentive Mechanism of Selfish Nodes Based on Energy Optimiz...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： XiangJia Dong Yuan Cheng Winston K. G. Seah Feng Zhang Gang Xu Engineering Research Center of Ecological Big Data Ministry of Education College of Computer Science Inner Mongolia University Hohhot China School of Engineering & Computer Science Victoria University of Wellington Wellington New Zealand School of Computer and Information Technology Shanxi University Taiyuan China

ISBN: (数字)9781665410205

ISBN: (纸本)9781665410212

With the proliferation of mobile intelligent terminals, opportunistic networks have attracted widespread attention as a complementary technology to multi-network convergence. Different from traditional wireless networks, message delivery in opportunistic networks does not rely on a fixed infrastructure, but rather storing messages in a cache and utilizing the movement and encounters of nodes to relay messages. However, in practical application scenarios, nodes have limited storage space and energy and will easily exhibit selfishness. An increase in the number of selfish nodes will drastically degrade the performance of the network. To solve the problem of significant network performance degradation when the number of selfish nodes is high, this paper proposes an Incentive mechanism of Selfish nodes based on Energy optimization and Game Theory (ISEGT). The mechanism abstracts the process of forwarding messages by nodes into a bargaining game process, and selectively forwards messages based on nodes' remaining energy and other circumstances. The experimental results show that the ISEGT mechanism can motivate selfish nodes to actively participate in message forwarding, which improves the success rate of message delivery and the survival rate of nodes, and optimizes the overall performance of the network.

关键词： Degradation Wireless networks Games Network security Delays Game theory Relays Optimization Cybernetics Energy storage

来源：评论

学校读者我要写书评

暂无评论

Finding the Missing data: A BERT-inspired Approach Against Package Loss in Wireless Sensing

arXiv

引用

arXiv 2024年

作者： Zhao, Zijian Chen, Tingwei Meng, Fanyi Li, Hang Li, Xiaoyang Zhu, Guangxu Shenzhen Research Institute of Big Data China School of Computer Science and Engineering Sun Yat-sen University China School of Science and Engineering The Chinese University of Hong Kong Shenzhen China

Despite the development of various deep learning methods for Wi-Fi sensing, package loss often results in noncontinuous estimation of the Channel State Information (CSI), which negatively impacts the performance of the learning models. To overcome this challenge, we propose a deep learning model based on Bidirectional Encoder Representations from Transformers (BERT) for CSI recovery, named CSI-BERT. CSI-BERT can be trained in an self-supervised manner on the target dataset without the need for additional data. Furthermore, unlike traditional interpolation methods that focus on one subcarrier at a time, CSI-BERT captures the sequential relationships across different subcarriers. Experimental results demonstrate that CSIBERT achieves lower error rates and faster speed compared to traditional interpolation methods, even when facing with high loss rates. Moreover, by harnessing the recovered CSI obtained from CSI-BERT, other deep learning models like Residual Network and Recurrent Neural Network can achieve an average increase in accuracy of approximately 15% in Wi-Fi sensing tasks. The collected dataset WiGesture and code for our model are publicly available at https://***/RS2002/CSI-BERT. Copyright © 2024, The Authors. All rights reserved.

关键词： Wi-Fi

来源：评论

学校读者我要写书评

暂无评论

WAGE: Weight-Sharing Attribute-Missing Graph Autoencoder

引用

IEEE Transactions on Pattern Analysis and Machine Intelligence 2025年第7期47卷 5760-5777页

作者： Wenxuan Tu Sihang Zhou Xinwang Liu Zhiping Cai Yawei Zhao Yue Liu Kunlun He School of Computer Science and Technology Hainan University Haikou China School of Intelligence Science and Technology National University of Defense Technology Changsha China School of Computer National University of Defense Technology Changsha China Medical Big Data Research Center Chinese PLA General Hospital Beijing China

Attribute-missing graph learning, a common yet challenging problem, has recently attracted considerable attention. Existing efforts have at least one of the following limitations: 1) lack a noise filtering and information enhancing scheme, resulting in less comprehensive data completion; 2) isolate the node attribute and graph structure encoding processes, introducing more parameters and failing to take full advantage of the two types of information; and 3) impose overly strict distribution assumptions on the latent variables, leading to biased or less discriminative node representations. To tackle the issues, based on the idea of introducing intimate information interaction between the two information sources, we propose W eight-sharing A ttribute-missing G raph auto E ncoder (WAGE) to boost the expressive capacity of node representations for high-quality missing attribute reconstruction. Specifically, three strategies have been conducted. Firstly, we entangle the attribute embedding and structure embedding by introducing a weight-sharing architecture to share the parameters learned by both processes, which allows the network training to benefit from more abundant and diverse information. Secondly, we introduce a $K$ -nearest neighbor-based dual non-local learning mechanism to improve the quality of data imputation by revealing unobserved high-confidence connections while filtering unreliable ones. Thirdly, we manually mask the connections on multiple adjacency matrices and force the structure-oriented embedding sub-network to recover the actual adjacency matrix, thus enforcing the resulting network to be able to selectively exploit more high-order discriminative features for data completion. Extensive experiments on six benchmark datasets demonstrate the effectiveness and superiority of WAGE against state-of-the-art competitors.

关键词： Imputation Learning systems Representation learning Training Topology Graph neural networks Filtering Encoding Autoencoders Feature extraction

来源：评论

学校读者我要写书评

暂无评论

A Fine-Grained Anomaly Detection Method Fusing Isolation Forest and Knowledge Graph Reasoning 19th

A Fine-Grained Anomaly Detection Method Fusing Isolation For...

引用

19th International Conference on Web Information Systems and Applications, WISA 2022

作者： Xu, Jie Zhou, Jiantao College of Computer Science Engineering Research Center of Ecological Big Data Ministry of Education National and Local Joint Engineering Research Center of Mongolian Intelligent Information Processing Technology Inner Mongolia Cloud Computing and Service Software Engineering Laboratory Inner Mongolia Social Computing and Data Processing Key Laboratory Inner Mongolia Discipline Inspection and Supervision Big Data Key Laboratory Inner Mongolia Big Data Analysis Technology Engineering Laboratory Inner Mongolia University Hohhot China

ISBN: (纸本)9783031203084

Anomaly detection aims to find outliers data that do not conform to expected behaviors in a specific scenario, which is indispensable and critical in current safety environments related studies. However, when performing outlier detection on a large-scale multidimensional dataset, most of the traditional methods make no distinctions between classes of outliers and lack the reasoning ability and the explainability of the analysis results, which leads to the low accuracy of global outlier detection and the inability to effectively identify local outliers. In this paper, we propose a fine-grained anomaly detection method which well utilizes isolation forest and knowledge graph reasoning tactics. First, a better extracting data feature method and a more reasonable weighted strategy are used to find global outliers based on the traditional isolation forest algorithm, and then we construct a custom rule base according to the in-depth research and analysis of global abnormal data, and at last the ontology knowledge is reasoned based on such rule base to achieve the detection of local outliers. Through analysis of extensive experiment results, our method could effectively discover more abnormal data without big loss of time costs, has strong generalization, and correspondingly improves the performance for abnormal detection. © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：