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

IEEE International Conference on Big knowledge (ICBK)

作者： Zewen Deng Zan Zhang Bingbing Dong Xiulin Zheng Xindong Wu Key Laboratory of Knowledge Engineering With Big Data (the Ministry of Education of China) School of Computer Science and Information Engineering Hefei University of Technology Hefei China

ISBN: (数字)9798331508821

ISBN: (纸本)9798331508838

Multi-modal entity alignment (MMEA) aims to identify equivalent entities across different multi-modal knowledge graphs. In these graphs, entities are enriched with information from various modalities, such as text, images, and numerical data, making the alignment task both challenging and crucial for improving knowledge graph quality. Current MMEA algorithms typically encode entity information separately for each modality using corresponding encoders, and then integrate these representations through various modal fusion strategies. However, these methods often fail to fully exploit the multi-modal information of entities. To address this issue, we propose a feature-enhanced multi-modal entity alignment transformer (FEMEAT). FEMEAT enhances entity attribute information by incorporating modal distribution data, which captures the inherent distribution of different modalities for each entity. This inclusion allows the model to have a richer understanding of entity characteristics across modalities. Additionally, FEMEAT utilizes an Optical Character Recognition (OCR) model to extract and incorporate textual information from images. By integrating this text extracted from images, the model can better utilize the visual modality, enhancing its ability to understand and process multi-modal information. Furthermore, FEMEAT employs a multi-head cross-modal attention (MHCA) mechanism for modal fusion to achieve comprehensive multi-modal entity representation. This mechanism enables the model to attend to different modalities simultaneously and learn a detailed representation of entities by considering the interactions between modalities. The multi-head cross-modal attention mechanism facilitates a nuanced understanding and integration of multi-modal data. Experimental results demonstrate that our model achieves state-of-the-art (SOTA) performance across various training scenarios. The code and datasets used in this study can be accessed at https://***/zewenD/FEMEAT.

关键词： Training Visualization Attention mechanisms Optical character recognition Noise knowledge graphs Transformers Robustness Numerical models data mining

来源：评论

学校读者我要写书评

暂无评论

High Dynamic Collaborative Team Query via Multi-Fuzzy-Constrained Graph Pattern Matching

High Dynamic Collaborative Team Query via Multi-Fuzzy-Constr...

引用

IEEE International Conference on Cloud Computing and Big data Analysis (ICCCBDA)

作者： Tao Hu Zan Zhang Chenyang Bu Lei Li Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) School of Computer Science and Information Engineering Hefei University of Technology Hefei China

ISBN: (数字)9798350373554

ISBN: (纸本)9798350373561

Graph pattern matching is a technique widely used in various fields such as protein structure analysis, social group querying, and expert localization. This technique involves finding matching subgraphs in large social networks that align with the patterns specified in the pattern graph. In this paper, we focus on a specific sub-problem in social group querying, known as the cooperative team query, which arises from practical applications, where the nodes in the pattern graph and the data graph represent team member entities, while the edges represent their social relationships. We note that the requirements of many teams in the real world are dynamic, necessitating iterative computation for graph pattern matching using traditional methods. To address this challenge in highly dynamic systems, we propose a graph pattern matching method based on core pattern graph matching cache. This approach involves extracting the core pattern graph, and comprising core team members based on the characteristics of cooperative teams. The core graph-based matching cache enables the second half of the algorithm to operate on an order-of-magnitude smaller graph, significantly improving efficiency. Additionally, the multi-threaded approach fully leverages hardware resources, synchronizing multiple matching result of the core pattern graph to reduce matching time. Experimental results on three real social network datasets demonstrate that our proposed algorithm, Core Pattern Graph Matching Cache-based Multi-threaded Exploration (CCMTE), significantly outperforms existing methods in terms of efficiency.

关键词： Proteins Location awareness Social networking (online) Social groups Heuristic algorithms knowledge graphs Hardware

来源：评论

学校读者我要写书评

暂无评论

Switchable Online knowledge Distillation

arXiv

引用

arXiv 2022年

作者： Qian, Biao Wang, Yang Yin, Hongzhi Hong, Richang Wang, Meng Key Laboratory of Knowledge Engineering with Big Data Ministry of Education School of Computer Science and Information Engineering Hefei University of Technology China The University of Queensland

Online knowledge Distillation (OKD) improves the involved models by reciprocally exploiting the difference between teacher and student. Several crucial bottlenecks over the gap between them — e.g., Why and when does a large gap harm the performance, especially for student? How to quantify the gap between teacher and student? — have received limited formal study. In this paper, we propose Switchable Online knowledge Distillation (SwitOKD), to answer these questions. Instead of focusing on the accuracy gap at test phase by the existing arts, the core idea of SwitOKD is to adaptively calibrate the gap at training phase, namely distillation gap, via a switching strategy between two modes — expert mode (pause the teacher while keep the student learning) and learning mode (restart the teacher). To possess an appropriate distillation gap, we further devise an adaptive switching threshold, which provides a formal criterion as to when to switch to learning mode or expert mode, and thus improves the student’s performance. Meanwhile, the teacher benefits from our adaptive switching threshold and keeps basically on a par with other online arts. We further extend SwitOKD to multiple networks with two basis topologies. Finally, extensive experiments and analysis validate the merits of SwitOKD for classification over the state-of-the-arts. Our code is available at https://***/hfutqian/SwitOKD. Copyright © 2022, The Authors. All rights reserved.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Extremely Short Chinese Text Classification Method Based on Bidirectional Semantic Extension

Extremely Short Chinese Text Classification Method Based on ...

引用

作者： Yongzeng Yue Yuhong Zhang Xuegang Hu Peipei Li 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

Short text classification methods have achieved significant progress and wide application on text data such as Twitter and Weibo. However, the extremely short chinese texts like tax invoice data are different with traditional short texts in lackness of contextual semantic information, feature sparseness and extremely short length. The existing short text classification methods are difficult to achieve a satisfactory performance in these texts. To address these problems, this paper proposes a text classification method based on bidirectional semantic extension for extremely short texts like Chinese tax invoice data. More specifically, firstly, the Chinese knowledge graph is introduced for extending bidirectional semantic of texts and label data to expand the extremely short texts and ease the problem of feature sparseness;secondly,the hash vectorization is used to avoid the semantic problem caused by the lackness of contextual information. Experimental results conducted the real tax invoice dataset demonstrate the effectiveness of our proposed method.

关键词： Extremely Short Chinese Text Classification Method Based on Bidirectional Semantic Extension

来源：评论

学校读者我要写书评

暂无评论

Multivariate Time Series Classification via Hierarchical Graph Embedding

Multivariate Time Series Classification via Hierarchical Gra...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Wenhao Niu Xingrui Zhuo Gongqing Wu JunWei Lv Zan Zhang Chenyang Bu Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) School of Computer Science and Information Engineering Hefei University of Technology Anhui China

Multivariate time series classification aims to determine the labels for multivariate time series samples. Although variable interaction relationships and sample similarity relationships exist in multivariate time series, the available related methods usually ignore the rich relationships and are ineffective in exploiting these. To solve this problem, we propose a Hierarchical Graph Embedding for Multivariate Time Series Classification (MTSC-HGE), which consists of a variable-wise attentive graph pooling module and a sample-wise graph convolutional module to obtain the relationships of variables and samples. Specifically, we design an attentive graph pooling module based on self-attention, which can obtain sample features fusing temporal patterns and variable interaction relationships in samples. Furthermore, we propose a graph mapping criterion that converts the MTS dataset into a graph based on dynamic time warping to explicitly reflect the similarity relationships between samples. To capture latent sample relationships, a GCN module is utilized on the sample graph to integrate sample features obtained from the attentive graph pool module. In addition, a classifier takes the rich representation output by the model to get the final predicted class. Extensive experiments on 14 public datasets show that MTSC-HGE significantly outperforms state-of-the-art baselines.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Convolution Neural Network for Renal Function Assessment Based on Glomerular Filtration Rate

Convolution Neural Network for Renal Function Assessment Bas...

引用

2021 International Conference on Advanced Technologies and Applications of Modern Industry, ATAMI 2021

作者： Wu, Congzhong Wang, Lulu Yang, Zhen Wang, Jing Han, Li Li, Fei Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Hefei University of Technology Hefei Anhui230601 China School of Computer and Information Hefei University of Technology Hefei Anhui230601 China The Second Hospital of Anhui Medical University Hefei Anhui230601 China

Objective: To develop a Convolution Neural Network (CNN) and discuss its performance in the estimation of Glomerular Fifiltration Rate (GFR) for patients with chronic kidney disease (CKD). Methods: A total of 112 patients with chronic kidney disease were enrolled in this study. The GFR is measured by 99mTc-DTPA renal dynamic and used as standard GFR after normalization by body surface area imaging. We established a CNN model and verified the performance of the model by comparing the GFR predicted by the model with the standard GFR. It turned out that the CNN could better evaluate the GFR of patients which is superior to the CG formula, MDRD formula, CKD-EPI formula and GRNN model. Conclusions: The CNN significantly evaluated GFR for patients with CKD, and it showed better performance than traditional methods and GRNN model and closer to the results of 99mTc-DTPA. The experimental results demonstrated that CNN could be used to estimate GFR. © 2022 Institute of Physics Publishing. All rights reserved.

关键词： Neural network models

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

BASED ON SELF ORGANIZED EVOLUTIONARY ALGORITHM FOR SOLVING CONSTRAINT PROBLEM

BASED ON SELF ORGANIZED EVOLUTIONARY ALGORITHM FOR SOLVING C...

引用

2007中国宁波国际计算机科学与技术学术大会

作者： Zhu Lili Zhao Kong Yuan Hua Yi Rongqin Wenzhou University School of Physics & Electronic Information Suzhou Top Institute of Information Technology Key Lab.of Symbol Computation & Knowledge Engineering of the Ministry of Education College of Computer Science & Technology Jilin University

ISBN: (纸本)9780972147903

The problem of parameterization design is equivalent to the problem of solving a set of nonlinear equations *** this paper,a new optimization algorithm—self organized evolutionary algorithm(SOEA) is proposed and applied into the parameterization *** SOEA the colony is composed of the *** organizational evolutionary operators which are split operator,mergence operator and coordination operator can lead the colony to *** three kinds of operators have different functions in the *** operator limits the scale of the organization and makes sure a part of organization comes into next generation directly,which maintains the variety of the *** operator makes use of the leader's information fully and acts as a local search *** operator increases the degree of adaptability between the two organizations by the *** experiment shows that SOEA has good capability in parameterization design.

关键词： Optimal algorithm Geometric constraint solving Self organized evolutionary algorithm

来源：评论

学校读者我要写书评

暂无评论

引用

Physical Review Fluids 2024年第5期9卷 054608-054608页

作者： Xue-Lu Xiong (熊雪露) Shujin Laima (赖马树金) Hui Li (李惠) Yi Zhou (周毅) School of Energy and Power Engineering Key Lab of Smart Prevention and Mitigation of Civil Engineering Disasters of the Ministry of Industry and Information Technology Key Lab of Structures Dynamic Behavior and Control of the Ministry of Education Guangdong-Hong Kong-Macao Joint Laboratory for Data-Driven Fluid Mechanics and Engineering Applications

This paper presents a quadrant analysis of turbulent rotor wakes, placing a particular emphasis on the self-similarity in single-point turbulent statistics. The self-similarity analysis reveals that within the wake self-similar region, the distribution of the Reynolds shear stress −u′v′¯ and the turbulent kinetic energy k in different quadrants can also attain a state of self-similarity. The length scaling is the same for −u′v′¯, k, and their different quadrant contributions. However, the velocity scaling of the ejection contribution differs from that of −u′v′¯ and k. Additionally, the analysis of hole filtering and spectrum filtering effects on the self-similarity and scaling of the ejection contribution to −u′v′¯ reveals a strong connection between ejection events and large-scale coherent structures, as well as deceleration extreme events. This finding is further confirmed through quadrant analysis of the time evolution of velocity fluctuations. The present study can be helpful in improving our understanding of the turbulent wake self-similarity.

关键词： Shear flows Wakes & jets

来源：评论

学校读者我要写书评

暂无评论

Model for cascading failures in congested Internet

引用

Journal of Zhejiang University-Science A(Applied Physics & engineering) 2008年第10期9卷 1331-1335页

作者： Jian WANG Yan-heng LIU Jian-qi ZHU Yu JIAO Key Lab of Symbolic Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Changehun 130012 China

Cascading failures often occur in congested networks such as the Internet. A cascading failure can be described as a three-phase process: generation, diffusion, and dissipation of the congestion. In this account, we present a function that represents the extent of congestion on a given node. This approach is different from existing functions based on betweenness centrality. By introducing the concept of ''delay time'', we designate an intergradation between permanent removal and nouremoval. We also construct an evaluation function of network efficiency, based on congestion, which measures the damage caused by cascading failures. Finally, we investigate the effects of network structure and size, delay time, processing ability and packet generation speed on congestion propagation. Also, we uncover the relationship between the cascade dynamics and some properties of the network such as structure and size.

关键词： Complex network Cascading failures Congestion effects Propagation model

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：