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

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

作者： Chen, Man-Sheng Lai, Pei-Yuan Liao, De-Zhang Wang, Chang-Dong Lai, Jian-Huang Sun Yat-sen University School of Computer Science and Engineering Guangzhou510275 China Guangxi Zhuang Autonomous Region Information Center Guangxi Key Laboratory of Digital Infrastructure Nanning530219 China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou510006 China Ministry of Education Key Laboratory of Machine Intelligence and Advanced Computing Beijing100816 China South China Technology Commercialization Center Guangzhou510006 China Guangdong University of Technology School of Information Engineering Guangzhou510006 China Guangdong Key Laboratory of Information Security Technology Guangzhou510033 China Ministry of Education Beijing100044 China

Due to the wide existence of unlabeled graph-structured data (e.g., molecular structures), the graph-level clustering has recently attracted increasing attention, whose goal is to divide the input graphs into several disjoint groups. However, the existing methods habitually focus on learning the graphs embeddings with different graph reguralizations, and seldom refer to the obvious differences in data distributions of distinct graph-level datasets. How to characteristically consider multiple graph-level datasets in a general well-designed model without prior knowledge is still challenging. In view of this, we propose a novel Graph Prompt Clustering (GPC) method. Within this model, there are two main modules, i.e., graph model pretraining as well as prompt and finetuning. In the graph model pretraining module, the graph model is pretrained by a selected source graph-level dataset with mutual information maximization and self-supervised clustering regularization. In the prompt and finetuning module, the network parameters of the pretrained graph model are frozen, and a groups of learnable prompt vectors assigned to each graph-level representation are trained for adapting different target graph-level datasets with various data distributions. Experimental results across six benchmark datasets demonstrate the impressive generalization capability and effectiveness of GPC compared with the state-of-the-art methods. © 1979-2012 IEEE.

关键词： Graph embeddings

来源：评论

学校读者我要写书评

暂无评论

LESaET: Low-Dimensional Embedding Method for Link Prediction Combining Self-Attention and Enhanced-TuckER

LESaET: Low-Dimensional Embedding Method for Link Prediction...

引用

2024 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2024

作者： Ding, Lichao Zhao, Jing Lu, Kai Hao, Zenghao Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (纸本)9781665410205

Knowledge graphs (KGs) provide a structured representation of the real world through entity-relation triples. However, current KGs are often incomplete, typically containing only a small fraction of all possible facts. This involves inferring missing content from existing information, a task known as link prediction. Existing methods in the field of link prediction struggle with controlling the dimensionality of embedding vectors or suffer from overly complex models. In order to tackle these challenges, we introduce a method in this paper, named Low-Dimensional Embedding Method for Link Prediction Combining Self-Attention and Enhanced-TuckER (LESaET). LESaET leverages both self-attention mechanisms and tensor factorization to learn expressive contextual-enhanced representations of KGs. Specifically, LESaET employs the multi-head self-attention mechanism of Transformer as an encoder to capture the mutual information between entities and relationships, and utilizes Enhanced-TuckER as a decoder, ultimately achieving expressive low-dimensional embeddings for link prediction tasks. LESaET demonstrates competitive performance compared to advanced methods on standard datasets. © 2024 IEEE.

关键词： Prediction models

来源：评论

学校读者我要写书评

暂无评论

An Entity Relation Extraction Framework Based on Large Language Model and Multi-Tasks Iterative Prompt engineering

An Entity Relation Extraction Framework Based on Large Langu...

引用

2024 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2024

作者： Geng, Haibin Shi, Chenglong Jiang, Xuesong Kong, Zan Liu, Song Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China

ISBN: (纸本)9781665410205

Document-level entity relation extraction is an important task in the field of natural language processing, which plays an important role in semantic understanding and knowledge graph construction. However, existing deep neural networks and graph neural networks models are limited by their performance and parameters number, which can not capture global semantics and have poor generalization ability. Furthermore, existing methods employing large language model for entity relation extraction do not establish good relationships among multi-tasks of entity relation extraction task, resulting in more information can not be effectively shared and transmitted between tasks. In addition, previous approaches can not effectively eliminate false entities and relationships. To solve these problems, we propose an entity relation extraction framework based on large language model and multi-tasks iterative prompt engineering. In our model, we design an iterative prompt engineering, which can better establish the relationship among multi-tasks, and ensure every task to obtain the optimal results. Moreover, we design semantic merging, group disambiguation and self-verification modules to eliminate the false entity relations and noise nodes. Additionally, we design summary prompts to provide sufficient global semantics for better text segmentation. Finally, we evaluated our model on wikiann, wikineural, ACE2005, CoNLL2003, CoNLL2004, and SciERC datasets and compared it with other baseline models. © 2024 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

HUSS:A Heuristic Method for Understanding the Semantic Structure of Spreadsheets

引用

data Intelligence 2023年第3期5卷 537-559页

作者： Xindong Wu Hao Chen Chenyang Bu Shengwei Ji Zan Zhang Victor S.Sheng Key Laboratory of Knowledge Engineering with Big Data(the Ministry of Education of China) Hefei University of TechnologyChinaSchool of Computer Science and Information EngineeringHefei University of TechnologyHefeiChina Research Institute of Artificial Intelligence Zhejiang LabHangzhouChina Department of Computer Science Texas Tech UniversityLubbockTX 79409USA

Spreadsheets contain a lot of valuable data and have many practical *** key technology of these practical applications is how to make machines understand the semantic structure of spreadsheets,e.g.,identifying cell function types and discovering relationships between cell *** existing methods for understanding the semantic structure of spreadsheets do not make use of the semantic information of cells.A few studies do,but they ignore the layout structure information of spreadsheets,which affects the performance of cell function classification and the discovery of different relationship types of cell *** this paper,we propose a Heuristic algorithm for Understanding the Semantic Structure of spreadsheets(HUSS).Specifically,for improving the cell function classification,we propose an error correction mechanism(ECM)based on an existing cell function classification model[11]and the layout features of *** improving the table structure analysis,we propose five types of heuristic rules to extract four different types of cell pairs,based on the cell style and spatial location *** experimental results on five real-world datasets demonstrate that HUSS can effectively understand the semantic structure of spreadsheets and outperforms corresponding baselines.

关键词： Spreadsheet semantic structure Information extraction Heuristics Cell function analysis Table structure analysis

来源：评论

学校读者我要写书评

暂无评论

A Cross-Modal Interactive Memory Network Based on Fine-Grained Medical Feature Extraction for Radiology Report Generation

A Cross-Modal Interactive Memory Network Based on Fine-Grain...

引用

2024 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2024

作者： Ma, Xitong Kuang, Yuansen Yuan, Lin Tian, Cheng Zeng, Yijie Liu, Song Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China

ISBN: (纸本)9781665410205

Radiology report generation is an essential task in the medical field, which aims to automate the generation of medical terminology descriptions of radiology images. However, this task currently suffers from several problems: 1) existing methods need to manually build knowledge graphs or templates (consuming time and effort) to introduce medical or prior knowledge to assist in report generation;2) previous models cannot handle the problem of data bias well (anomaly reports and anomaly descriptions make up only a tiny portion of the dataset), causing the models to ignore the learning of anomaly descriptions easily;3) existing approaches cannot robustly supervise the model, resulting in incomplete and inconsistent reports being generated. To address these issues, we propose a cross-modal interactive memory network based on fine-grained medical feature extraction. In our model, we design a cross-modal interactive memory network to automatically store and remember the required medical text knowledge and use this medical knowledge to help generate reports. Furthermore, we design an abnormal medical knowledge enhancement module to enhance the learning of abnormal fine-grained knowledge through the interaction of disease topics and their states to interact with text features. In addition, we design a cross-modal joint semantic loss unit to reduce semantic differences between different features and improve the visual representation ability of the model. We experimented and evaluated our model on MIMIC-CXR and IU-Xray datasets to compare with other baseline models. © 2024 IEEE.

关键词： Radiology

来源：评论

学校读者我要写书评

暂无评论

A Collaborative Heterogeneous Graph Neural Network for Personalized News Recommendation

A Collaborative Heterogeneous Graph Neural Network for Perso...

引用

2024 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2024

作者： Shi, Chenglong Geng, Haibin Jiang, Wenfeng Li, Jinbao Wu, Chao Liu, Song Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China

ISBN: (纸本)9781665410205

Personalized news recommendation is the process of predicting the relevance of news to users and recommending news to user to fulfill their information needs. However, existing news recommendation methods extract semantic information from users and candidate news respectively, ignoring semantic interaction information between users and candidate news. Furthermore, previous models only use same node types for message passing, ignoring different characteristics and topology between different node types. In addition, existing methods learn news representations through text representations, ignoring semantic correlation information between entity relationships and texts. To solve these problems, we propose a personalized news recommendation model named CoHG. In our model, we design a collaborative fusion module to obtain semantic interaction information through interacting user history news with candidate news. Furthermore, we design a heterogeneous gated graph neural network that maps different node types into a same space to extract higher-order information in user graphs for message passing. Moreover, we design an enhanced relevant attention module to enhance semantic correlation information of text content by aggregating text representation and entity representation into a unified representation. Finally, we conducted experiments on MIND and Adressa datasets to compare with other baseline models. © 2024 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Multi-scale fusion clustering algorithm for urban travel features 3

Multi-scale fusion clustering algorithm for urban travel fea...

引用

2023 3rd International Conference on Intelligent Traffic Systems and Smart City, ITSSC 2023

作者： Zhang, Zixiang Zhao, Zhilong Deng, Jiaming Zhao, Yingying Xu, Tao Henan Key Laboratory of Big Data Analysis and Processing Henan University Kaifeng475004 China Key Laboratory of Geographical Information Science Ministry of Education East China Normal University Shanghai200241 China School of Computer and Information Engineering Henan University Kaifeng475004 China International Education College Henan University Zhengzhou450046 China Henan Technology Innovation Center of Spatio-Temporal Big Data Henan University Zhengzhou450046 China Henan Industrial Technology Academy of Spatio-Temporal Big Data Henan University Zhengzhou450046 China

ISBN: (纸本)9781510672963

Urban travel data typically encompass various temporal and spatial scales and features. Nonetheless, existing traffic travel feature analysis often focuses on a single spatial scale, which may overlook crucial information and hinder features at different scales. Consequently, this could reduce the accuracy of travel pattern recognition. To solve this problem, we introduce a multi-scale fusion transformation algorithm. In our approach, we first establish a multi-level taxi travel data grid system. Then, we apply the I-Clique clustering algorithm to perform grid clustering at each level of the system to identify taxi travel feature regions of different scales. Subsequently, a multi-scale fusion pyramid model is constructed utilizing the acquired travel feature regions at various scales. Finally, we determine the transformation relationships between scales in the pyramid model, enabling the identification of travel feature areas across both known and unknown scales. This approach facilitates the recognition of travel features within cities at any scale. Experimental results demonstrate that the multi-scale fusion transformation algorithm enhances our understanding of spatial aggregation patterns and the hierarchical structure of geographical entities, offering a novel approach for multi-scale urban traffic analysis. © 2024 SPIE. All rights reserved.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Research on active defense decision-making method for cloud boundary networks based on reinforcement learning of intelligent agent

引用

High-Confidence Computing 2024年第2期4卷 50-61页

作者： Huan Wang Yunlong Tang Yan Wang Ning Wei Junyi Deng Zhiyan Bin Weilong Li School of Computer Science and Technology Guangxi University of Science and TechnologyLiuzhou 545000China Liuzhou Key Laboratory of Big Data Intelligent Processing and Security Liuzhou 545000China Guangxi Education System Network Security Monitoring Center Liuzhou 545000China Center of Graphics and Information Guangxi ECO-Engineering Vocational&Technical CollegeLiuzhou 545004China

The cloud boundary network environment is characterized by a passive defense strategy,discrete defense actions,and delayed defense feedback in the face of network attacks,ignoring the influence of the external environment on defense decisions,thus resulting in poor defense ***,this paper proposes a cloud boundary network active defense model and decision method based on the reinforcement learning of intelligent agent,designs the network structure of the intelligent agent attack and defense game,and depicts the attack and defense game process of cloud boundary network;constructs the observation space and action space of reinforcement learning of intelligent agent in the non-complete information environment,and portrays the interaction process between intelligent agent and environment;establishes the reward mechanism based on the attack and defense gain,and encourage intelligent agents to learn more effective defense *** designed active defense decision intelligent agent based on deep reinforcement learning can solve the problems of border dynamics,interaction lag,and control dispersion in the defense decision process of cloud boundary networks,and improve the autonomy and continuity of defense decisions.

关键词： Active defense decision-making Cloud boundary network security Intelligent agent reinforcement learning Offensive and defensive game

来源：评论

学校读者我要写书评

暂无评论

Anatomical Prior Guided Spatial Contrastive Learning for Few-Shot Medical Image Segmentation 24

Anatomical Prior Guided Spatial Contrastive Learning for Few...

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： Huang, Wendong Hu, Jinwu Bi, Xiuli Xiao, Bin Chongqing Key Laboratory of Image Cognition Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education Chongqing University of Post and Telecommunications Chongqing China Pazhou Lab School of Software Engineering South China University of Technology Guangzhou China

ISBN: (纸本)9798400706868

Few-shot semantic segmentation has considerable potential for low-data scenarios, especially for medical images that require expert-level dense annotations. Existing few-shot medical image segmentation methods strive to deal with the task by means of prototype learning. However, this scheme relies on support prototypes to guide the segmentation of query images, ignoring the rich anatomical prior knowledge in medical images, which hinders effective feature enhancement for medical images. In this paper, we propose an anatomical prior guided spatial contrastive learning, called APSCL, which exploits anatomical prior knowledge derived from medical images to construct contrastive learning from a spatial perspective for few-shot medical image segmentation. The new framework forces the model to learn the features in line with the embedded anatomical representations. Besides, to fully exploit the guidance information of the support samples, we design a mutual guidance decoder to predict the label of each pixel in the query image. Furthermore, our APSCL can be trained end-to-end in the form of episodic training. Comprehensive experiments on three challenging medical image datasets, i.e., CHAOS-T2, MS-CMRSeg, and Synapse, prove that our method significantly surpasses state-of-the-art few-shot medical segmentation methods, with a mean improvement of 3.61%, 2.30%, and 6.38% on the Dice score, respectively. © 2024 ACM.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Multi-scale cyclical similarity prototype refinement for few-shot breast ultrasound image segmentation 17

Multi-scale cyclical similarity prototype refinement for few...

引用

17th IEEE International Conference on Signal Processing, ICSP 2024

作者： Ou, Yingfeng Yang, Xing Zhang, Jian Jian, Caiqing Wang, Lihui College of Computer Science and Technology Guizhou University Key Laboratory of Intelligent Medical Image Analysis and Precise Diagnosis of Guizhou Province State Key Laboratory of Public Big Data Engineering Research Center of Text Computing Ministry of Education Guiyang China

ISBN: (纸本)9798350387384

Few-shot learning based methods can address the reliance on large-scale labeled samples in current breast tumor segmentation. However, previous methods typically rely on a few support samples to extract abstract, coarse-grained semantic prototypes, without considering the interaction between support and query data. In this study, we aim to provide each query image with relevant and information-rich support information. By integrating the difficult point selection module and the multi-scale cyclical prototype refinement module, we progressively refine coarse-grained support prototypes into more informative, fine-grained class prototypes, thereby better matching the highly variable breast ultrasound query data. Experiments on two datasets demonstrate that our proposed multi-scale cyclical similarity prototype refinement network (CSPRNet) achieves remarkable improvements compared to previous state-of-the-art methods. Specifically, using ResNet50 as the backbone, we achieve 57.93%/57.92% and 57.58%/59.24% mIoU for 1-shot and 5-shot segmentation, respectively, on public and private datasets, outperforming the suboptimal method by 8.18%/2.55% and 2.77%/4.48%. © 2024 IEEE.

关键词： Ultrasonic imaging

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：