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

SSRN 2023年

作者： Sun, Haichao Wang, Guoyin Liu, Qun Guo, Yike Chongqing Key Laboratory of Computational Intelligence Chongqing University of Posts and Telecommunications Chongqing400065 China Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and Telecommunications Chongqing400065 China Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education Chongqing University of Posts and Telecommunications Chongqing400065 China Department of Computer Science and Engineering The Hong Kong University of Science and Technology 999077 Hong Kong School of Computer Engineering and Science Shanghai University Shanghai200444 China

Graph neural networks (GNNs) have gained significant attention and have been applied in various domain tasks. Currently, numerous pooling approaches have been proposed to aggregate node features and obtain node embeddings. However, current GNNs are almost black-box models that typically use a flat or single pooling step to aggregate nodes by only considering the similarity between nodes within the cluster. These approaches ignore the influence of relationships within and between clusters. To address this issue, we propose a novel multi-granular pooling method to aggregate nodes by simultaneously considering density and relationships among nodes and clusters. This method allows to obtain multi-granular node embedding clusters. The clusters in the current layer are built upon the previous layer, and these clusters change from fine to coarse as the number of clusters decreases, which is achieved by using multi-granular pooling (MgrPool for short). Additionally, the node representation of each layer is established through the ratio of node distance within clusters to that of between clusters. Finally, we conduct several experiments on node and graph classification tasks by this pooling approach. The results demonstrate that our GNN-MgrPool model outperforms the state-of-the-art similar algorithms and largely improves the interpretability of the learning process. © 2023, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Fil-Cad: A Fault Detection Method for Iiot Based on Federated Incremental Learning with Class Accuracy Distillation

SSRN

引用

SSRN 2024年

作者： Liu, Yanhua Fang, Wenyu Huang, Wei Wang, Xiaofeng Zhao, Baokang Liu, Ximeng College of Computer and Data Science Fuzhou University Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China College of Computer National University of Defense Technology Changsha410073 China

Fault detection is a research topic attracting much attention in IIoT. However, the continuous accumulation and growth of IIoT data leads to the catastrophic forgetting problem in the fault detection model and data heterogeneity, which creates a bottleneck for the performance and generalization of federated learning in fault detection. To improve the fault detection performance of federated learning models in data incremental scenarios, we propose a federatedincremental-learning-based fault detection method for IIoT, namely FIL-CAD. Firstly, comparing the knowledge distillation, the accuracies of different data classes in the global and local models are chosen as the model lightweight learning features, and the loss function is weighted. Secondly, we introduce the concept of data learning depth. It computes different model weights in the aggregation based on their degrees of data sample learning and model training participation and obtains the global model through weighted aggregation. Additionally, FIL-CAD supports the combination of differential privacy to protect data privacy. The proposed method is compared with four benchmark methods on four datasets, which include CWRU and MFPT bearing datasets. Then, the experimental results show that FIL-CAD performs optimally in accuracy and F1-Score, and the average accuracy is improved by 1.32%-18.52%, demonstrating the superiority of FIL-CAD. © 2024, The Authors. All rights reserved.

关键词： Fault detection

来源：评论

学校读者我要写书评

暂无评论

AVR: Attention based Salient Visual Relationship Detection 14

AVR: Attention based Salient Visual Relationship Detection

引用

14th International Conference on Digital Image Processing, ICDIP 2022

作者： Li, Hualiang Lv, Jianming Xiao, Qinzhe Liu, Yuzhong Wu, Siqi Huang, Xingjie Key Laboratory of Occupational Health and Safety of Guangdong Power Grid Co. Ltd. Electric Power Research Institute of Guangdong Power Grid Co. Ltd. Guangdong Guangzhou China Key Laboratory of Big Data and Intelligent Robot South China University of Technology Ministry of Education Guangdong Guangzhou China School of Computer Science and Engineering South China University of Technology Guangdong Guangzhou China

ISBN: (纸本)9781510657564

Visual relationship detection aims to locate objects in images and recognize the relationships between objects. Traditional methods treat all observed relationships in an image equally, which causes a relatively poor performance in the detection tasks on complex images with abundant visual objects and various relationships. To address this problem, we propose an attention based model, namely AVR, to achieve salient visual relationships based on both local and global context of the relationships. Specifically, AVR recognizes relationships and measures the attention on the relationships in the local context of an input image by fusing the visual features, semantic and spatial information of the relationships. AVR then applies the attention to assign important relationships with larger salient weights for effective information filtering. Furthermore, AVR is integrated with the priori knowledge in the global context of image datasets to improve the precision of relationship prediction, where the context is modeled as a heterogeneous graph to measure the priori probability of relationships based on the random walk algorithm. Comprehensive experiments are conducted to demonstrate the effectiveness of AVR in several real-world image datasets, and the results show that AVR outperforms state-of-the-art visual relationship detection methods significantly by up to 87.5% in terms of recall. © 2022 SPIE.

关键词： Information filtering

来源：评论

学校读者我要写书评

暂无评论

EG-KGR: A knowledge Graph Reasoning Model Based on Enhanced Graph Sample and Aggregate Inductive Learning Algorithm

EG-KGR: A Knowledge Graph Reasoning Model Based on Enhanced ...

引用

International Conference on Tools for Artificial Intelligence (ICTAI)

作者： Yuejia Wu Jian-Tao Zhou Inner Mongolia Key Laboratory of Discipline Inspection and Supervision Big Data Inner Mongolia Engineering Laboratory for Big Data Analysis Technology Ministry of Education Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Inner Mongolia Key Laboratory of Social Computing and Data Processing College of Computer Science Inner Mongolia University National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian Engineering Research Center of Ecological Big Data Hohhot China

knowledge Graph is an important research field that involves the storage and management of knowledge, but the incompleteness and sparsity of knowledge Graphs hinder their application in many fields. knowledge Graph Reasoning aims to alleviate this problem by completing missing paths or identifying wrong paths between entities. Graph Convolution Network (GCN) based methods are one of the state-of-the-art approaches to this work. However, it is difficult to directly generalize to unknown nodes and utilizes valid information from the local neighborhood which results in poor flexibility and extensibility and will loss of important information. This paper presents EG-KGR, a plug-and-play knowledge reasoning model based on enhanced graph sampling and aggregate inductive learning algorithm to relieve the above problems and enhance existing GCN-based methods. Specifically, EG-KGR supports incremental characteristics, uses inductive learning to replace transductive learning, and designs random sampling and local information sampling optimization methods to improve the model's generalization ability, prediction accuracy, and running speed. Extensive experimental results show that our EG-KGR can achieve optimal results.

关键词： Training knowledge engineering Convolution Aggregates Optimization methods knowledge graphs Learning (artificial intelligence)

来源：评论

学校读者我要写书评

暂无评论

Denoi-SpEx+: A Speaker Extraction Network based Speech Dialogue System 17

Denoi-SpEx+: A Speaker Extraction Network based Speech Dialo...

引用

17th IEEE International Conference on e-Business engineering, ICEBE 2021

作者： Hao, Yun Huang, Xiangkang Huang, Huichou Wu, Qingyao School of Software Engineering South China University of Technology Guangzhou China Key Laboratory of Big Data and Intelligent Robot Ministry of Education China Pazhou Lab Guangzhou China University of Hong Kong Hong Kong Hong Kong

ISBN: (纸本)9781665444187

The speech dialogue system has gradually been widely used in daily life. Users can consult and communicate with the system through natural language. However, in practical applications, third-person background sounds and background noise interference in real dialogue scenes will be encountered. The uncertainty and complexity of these background sounds will have a bad impact on the recognition of the system. A good speech enhancement module can help us to separate the target speaker from the original speech. Recently, a solution called SpEx+ was proposed from the time domain, but SpEx+ needs a reference speech to assist in training. This reference speech may have noise in actual applications that will affect performance. Therefore, we propose a Denoi-SpEx+ model. Before the reference speech is input to the network, a speech denoising network is added, so that the quality of speech separation in practical applications can be guaranteed. Experiments show that our model can significantly improve the performance of speech separation model of noisy reference speech. © 2021 IEEE.

关键词： Speech enhancement

来源：评论

学校读者我要写书评

暂无评论

A Semi-supervised Bilingual Lexicon Induction Method for Distant Language Pairs Based on Bidirectional Adversarial Model

A Semi-supervised Bilingual Lexicon Induction Method for Dis...

引用

IEEE International Conference on big knowledge (ICBK)

作者： Wenwu Zhi Yuhong Zhang Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education School of Computer Science and Information Engineering Hefei University of Technology Hefei China

ISBN: (纸本)9781665438599

Bilingual lexicon induction (BLI) can transfer knowledgefrom well- to under- resourced language, and has been widelyapplied to various NLP tasks. Recent work on BLI is projection-based that learns a mapping to connect source and target embedding spaces, with the isomorphism assumption. Unfortunately, the isomorphism assumption doesn't hold gener-ally, especially in typologically distant language pairs. Moreover, without supervised signals guiding, the training will further com-plicates BLI, making the performance of unsupervised methods unsatisfactory. To broke the restrict of isomorphism, we propose a semi-supervised method for distant BLI tasks, named A Semi-supervised Bilingual Lexicon Induction method in Latent Space based on Bidirectional Adversarial Model. First, two latent spaces are learned by two autoencoders for source and target domain independently to weaken the constraint of isomorphism in the embedding spaces. Then we add a few pairs of dictionary to learn the initial mapping to connect the Latent Space. Last, based on initial mapping, Cycle-Consistency is combined with Distance constraint constraint to maintain the geometry structure of both embedding spaces stable in the learning of bi-direction mapping based on adversarial model. By conducting extensive experiments, our method gets state-of-the-art results on most language pairs, especially with significant improvements on distant language pairs.

关键词： Training Geometry Dictionaries Conferences Bidirectional control Task analysis

来源：评论

学校读者我要写书评

暂无评论

Deformable registration framework for glioma images with absent correspondence based on auxiliary-image-aided intensity-consistency constraint

Deformable registration framework for glioma images with abs...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Kun Tang Lihui Wang Menglong Yang Jingwen Xu Xinyu Cheng Jian Zhang Yuemin Zhu Hongjiang Wei Key Laboratory of Intelligent Medical Image Analysis and Precise Diagnosis of Guizhou Province Engineering Research Center of Text Computing & Cognitive Intelligence Ministry of Education State Key Laboratory of Public Big Data College of Computer Science and Technology Guiyang China INSA Lyon CNRS Inserm Univ Lyon Lyon France School of Biomedical Engineering Shanghai Jiao Tong University Shanghai China

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

Considering the tumor aggressive nature and the significant changes in anatomical structure, aligning the preoperative and follow up scans of glioma patients remains a challenge due to the presence of regions with absent correspondence. To address this challenge, this work proposed a novel bidirectional unsupervised deformable image registration framework for image pairs with missing correspondence based on an auxiliary-image-aided intensity-consistency constraint (ICC) strategy. Specifically, for any fixed and moving image pairs, we introduced an auxiliary image and warped it directly to fixed/moving image or warped it twice through a transition of moving/fixed image. By comparing the difference between these warped images, the weighting maps to identify and exclude regions with absent correspondence between fixed and moving image pairs can be generated. To verify the effectiveness of the proposed framework, we combined it with several deep learning-based registration models and tested it on BraTS-Reg challenge dataset, the results demonstrated that the proposed ICC strategy can improve the registration performance for all the models, with the improvement of average target registration error (TRE) and success rate (SR) being up to 44.9% and 66.7%, respectively. Comparing against the best existing forward-backward consistency strategy for dealing with missing correspondence registration, our auxiliary-image-aided ICC strategy can also decrease average TRE by 2.9%, demonstrating the superiority of the proposed framework. The present work is not limited to the glioma images, it can be used to address the registration problems for any image pairs with absent correspondence or inconsistent intensity.

关键词： Image registration Pathology Deformation Magnetic resonance imaging Anatomical structure Bioinformatics Tumors Biomedical imaging

来源：评论

学校读者我要写书评

暂无评论

Study on Lix54-Tbp Extraction for Li/Na Separation and its Kinetics and Thermodynamics

SSRN

引用

SSRN 2024年

作者： Ma, Yu Ma, Liwen Xi, Xiaoli Nie, Zuoren Collaborative Innovation Center of Capital Resource-Recycling Material Technology College of Materials Science and Engineering Beijing University of Technology Beijing100124 China Key Laboratory of Advanced Functional Materials Ministry of Education Beijing University of Technology Beijing100124 China National Engineering Laboratory for Industrial Big-data Application Technology Beijing University of Technology Beijing100124 China

To improve the Li+ recovery efficiency and the Li/Na separation of low-grade lepidolite, a Lix54-TBP extractant system with sec-octyl alcohol as dehalogenation and sulfonated kerosene as diluent was proposed. In a high Na+ and low Li+ solution, the primary extraction efficiency of Li+ reached 98.29% with Li/Na separation coefficient of 5606.25 under the optimal extraction conditions and the stripping efficiency was 99.75%. The kinetic equation of the extraction was obtained as R(Li) = 9.397 × 10-7 × [Li+]0.7882·[Lix54]0.2337·[TBP]0.2999. The thermodynamic parameters were calculated as ΔH=-2.41kJ/mol, ΔG=-1.129kJ/mol, ΔS=3.778J/mol and Ea =19.73kJ/mol, indicated that the extraction reaction was exothermic, spontaneous and probably mixed controlled by diffusion and chemical reaction. The reaction mechanism was ion exchange reaction, and extractants had a higher selectivity for Li+ than Na+ during the extraction process. This study provides an important technical reference for the efficient separation and recovery of Li from low-grade lepidolite, which is helpful for the utilization of strategic mineral resources. © 2024, The Authors. All rights reserved.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

Research on Multi-AGVs dynamic scheduling based on deep reinforcement learning

Research on Multi-AGVs dynamic scheduling based on deep rein...

引用

IEEE International Conference on e-Business engineering (ICEBE)

作者： Zhuorui Qin Xiaoqian Wu Yimin Zheng Qingyao Wu School of Software Engineering South China University of Technology Guangzhou China Key Laboratory of Big Data and Intelligent Robot Ministry of Education Shenzhen Bangqi Technology Intelligent Development Co. Ltd Shenzhen China Pazhou Lab Guangzhou China

Driven by the latest advances in industrial artificial intelligence, automatic guided vehicles (AGVs) have been widely used for material handling in flexible workshops. In the pursuit of agile and flexible production transportation planning, the ability to handle unpredictable and dynamic events is becoming increasingly important. In order to achieve this real-time dynamic control, this study proposes a distributed multi-agent architecture to solve the dynamic Multi-AGVs scheduling problem. Double Deep Q-Network algorithm is used to train the scheduling agent, capture the relationship between production transportation operation information and scheduling goals, and make real-time scheduling decisions for flexible jobs with constant arrival intervals. Specialized state, action, and reward representations are proposed to handle variable specifications of dynamic scheduling problems. The performance of this method under different scene scales was verified through simulation studies. Numerical results show that compared with existing traditional heuristic scheduling strategies, this method not only has superior performance, but also its advantages persist even if the manufacturing system job scale changes.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SpreadFGL: Edge-Client Collaborative Federated Graph Learning with Adaptive Neighbor Generation

SpreadFGL: Edge-Client Collaborative Federated Graph Learnin...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Luying Zhong Yueyang Pi Zheyi Chen Zhengxin Yu Wang Miao Xing Chen Geyong Min College of Computer and Data Science Fuzhou University China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University China Engineering Research Center of Big Data Intelligence Ministry of Education China School of Computing and Communications University of Lancaster UK School of Engineering Computing and Mathematics University of Plymouth UK Department of Computer Science University of Exeter UK

ISBN: (数字)9798350383508

ISBN: (纸本)9798350383515

Federated Graph Learning (FGL) has garnered widespread attention by enabling collaborative training on multiple clients for semi-supervised classification tasks. However, most existing FGL studies do not well consider the missing inter-client topology information in real-world scenarios, causing insufficient feature aggregation of multi-hop neighbor clients during model training. Moreover, the classic FGL commonly adopts the FedAvg but neglects the high training costs when the number of clients expands, resulting in the overload of a single edge server. To address these important challenges, we propose a novel FGL framework, named SpreadFGL, to promote the information flow in edge-client collaboration and extract more generalized potential relationships between clients. In SpreadFGL, an adaptive graph imputation generator incorporated with a versatile assessor is first designed to exploit the potential links between subgraphs, without sharing raw data. Next, a new negative sampling mechanism is developed to make SpreadFGL concentrate on more refined information in downstream tasks. To facilitate load balancing at the edge layer, SpreadFGL follows a distributed training manner that enables fast model convergence. Using real-world testbed and benchmark graph datasets, extensive experiments demonstrate the effectiveness of the proposed SpreadFGL. The results show that SpreadFGL achieves higher accuracy and faster convergence against state-of-the-art algorithms.

关键词： Training Accuracy Collaboration Benchmark testing Imputation Generators Topology

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：