Relation extraction is one of the most essential tasks of knowledge construction, but it depends on a large amount of annotated data corpus. Few-shot relation extraction is proposed as a new paradigm, which is designed to learn new relationships between entities with merely a small number of annotated instances, effectively mitigating the cost of large-scale annotation and long-tail problems. To generalize to novel classes not included in the training set, existing approaches mainly focus on tuning pre-trained language models with relation instructions and developing class prototypes based on metric learning to extract relations. However, the learned representations are extremely sensitive to discrepancies in intra-class and inter-class relationships and hard to adaptively classify the relations due to biased class features and spurious correlations, such as similar relation classes having closer inter-class prototype representation. In this paper, we introduce an adaptive class augmented prototype network with instance-level and representation-level augmented mechanisms to strengthen the representation space. Specifically, we design the adaptive class augmentation mechanism to expand the representation of classes in instance-level augmentation, and class augmented representation learning with Bernoulli perturbation context attention to enhance the representation of class features in representation-level augmentation and explore adaptive debiased contrastive learning to train the model. Experimental results have been demonstrated on FewRel and NYT-25 under various few-shot settings, and the proposed model has improved accuracy and generalization, especially for cross-domain and different hard tasks.
16 January 2024 in IEEE Transactions on Intelligent Transportation Systems
Crack segmentation is a critical component in structural health monitoring. Conventional crack segmentation models usually focus on optimizing the cross-entropy-based objective function and overlook the optimization of the subsequent binarization process. In this paper, we redefine the crack segmentation problem as a joint optimization problem, which requires optimizing the binarization process in addition to the objective function of the segmentation model. Simultaneously optimizing both processes demonstrates significant improvements in the model’s segmentation performance. To optimize the binarization process, we propose the Adaptive Dynamic Thresholding Module (ADTM), which reuses the spatial features in the segmentation network to perform an additional regression task to obtain the optimal threshold for each crack image. ADTM is a pluggable component for practical deployment, consuming only a small amount of additional memory during deployment while significantly improving inference accuracy. Experimental results using four different datasets with diverse sources and distributions for crack semantic and instance segmentation demonstrate the effectiveness of ADTM in improving segmentation performance. While ADTM has only been evaluated on cracked data, our findings suggest its potential to improve the performance of other binary classification image segmentation problems.
20 November 2023 in Expert Systems with Applications
As a building block of knowledge acquisition, knowledge graph completion (KGC) aims at inferring missing facts in knowledge graphs (KGs) automatically. Previous studies mainly focus on graph convolutional network (GCN)-based KG embedding (KGE) to determine the representations of entities and relations, accordingly predicting missing triplets. However, most existing KGE methods suffer from limitations in predicting tail entities that are far away or even unreachable in KGs. This limitation can be attributed to the related high-order information being largely ignored. In this work, we focus on learning the information from the related high-order neighbors in KGs to improve the performance of prediction. Specifically, we first introduce a set of new nodes called pedal nodes to augment the KGs for facilitating message passing between related high-order entities, effectively injecting the information of high-order neighbors into entity representation. Additionally, we propose strength-guided graph neural networks to aggregate neighboring entity representations. To address the issue of transmitting irrelevant higher order information to entities through pedal nodes, which can potentially hurt entity representation, we further propose to dynamically integrate the aggregated representation of each node with its corresponding self-representation. Extensive experiments have been conducted on three benchmark datasets and the results demonstrate the superiority of our method compared to strong baseline models.
27 February 2025 in Expert Systems with Applications
Oxidative stress is crucial to the biology of tumors. Oxidative stress’ potential predictive significance in colorectal cancer (CRC) has not been studied; nevertheless here, we developed a forecasting model based on oxidative stress to forecast the result of CRC survival and enhance clinical judgment. The training set was chosen from the transcriptomes of 177 CRC patients in GSE17536. For validation, 65 samples of colon cancer from GSE29621 were utilized. For the purpose of choosing prognostic genes, the expression of oxidative stress‐related genes (OXEGs) was found. Prognostic risk models were built using multivariate Cox regression analysis, univariate Cox regression analysis, and LASSO regression analysis. The outcomes of the western blot and transcriptome sequencing tests were finally confirmed. ATF4, CARS2, CRP, GPX1, IL1B, MAPK8, MRPL44, MTFMT, NOS1, OSGIN2, SOD2, AARS2, and FOXO3 were among the 14 OXEGs used to build prognostic characteristics. Patients with CRC were categorized into low‐risk and high‐risk groups according on their median risk scores. Cox regression analysis using single and multiple variables revealed that OXEG‐related signals were independent risk factors for CRC. Additionally, the validation outcomes from western blotting and transcriptome sequencing demonstrated that OXEGs were differently expressed. Using 14 OXEGs, our work creates a predictive signature that may be applied to the creation of new prognostic models and the identification of possible medication candidates for the treatment of CRC.