Multimodal Relation Extraction (MRE) has achieved great improvements. However, modern MRE models are easily affected by irrelevant objects during multimodal alignment which are called error sensitivity issues. The mai...
详细信息
Nowadays, misinformation is widely spreading over various social media platforms and causes extremely negative impacts on society. To combat this issue, automatically identifying misinformation, especially those conta...
详细信息
Histological image classification plays a crucial role in cancer diagnosis. However, the acquisition of well-labeled histological images is prohibitively expensive, and obtaining rare abnormal samples is challenging. ...
详细信息
ISBN:
(纸本)9798350358780
Histological image classification plays a crucial role in cancer diagnosis. However, the acquisition of well-labeled histological images is prohibitively expensive, and obtaining rare abnormal samples is challenging. Therefore, applying few-shot learning methods to histological image classification tasks holds significant clinical value. Nevertheless, existing research predom-inantly relies on coarse-grained image classification approaches based on natural image datasets, which struggle to address the fine-grained challenges encountered in histological image classification, such as intra-class diversity and inter-class similarity. To tackle this issue, this study proposes a novel few-shot fine-grained classification method for histological images, named 'Category-Aware Feature Map Reconstruction Network.' This method employs channel weights to localize the differences between inter-class and intra-class regions, composed of intra-class channel weights and inter-class channel weights, collectively referred to as category-aware weights. Specifically, intra-class channel weights indicate the matching degree of salient regions within the support set of a particular class, while inter-class channel weights represent the degree of containing distinct information between classes. The category-aware weights are utilized to transform the support feature maps and query feature maps, generating feature maps that capture differentiating details between categories. Finally, the distance between the transformed query feature map and support feature map is calculated to achieve probabilistic predictions for the categories. On a histological few-shot dataset, this method achieves an accuracy of 90.23% using ResNet-12 as the feature extractor, surpassing the baseline model by 5.24% and outperforming other few-shot methods by at least 10% in the 5-way 10-shot experimental setting. The proposed method exhibits exceptional performance on histological image few-shot datasets, playing a
With the complexity of the functions of modern buildings, the problem of vertical traffic in buildings is becoming more and more prominent. As the only vertical transportation, the elevator is a necessary prerequisite...
详细信息
1Introduction and main contributions In the field of social networks and knowledge graphs,semi-supervised learning models based on graph convolutional networks have achieved great success in node classification[1],ind...
详细信息
1Introduction and main contributions In the field of social networks and knowledge graphs,semi-supervised learning models based on graph convolutional networks have achieved great success in node classification[1],inductive node embedding[2],link prediction[3],and *** semi-supervised models based on graph convolutional network(GCN)[4]expect to obtain more feature information of a graph or accelerate the training.
Grid-based path planning is one of the classic problems in AI, and a popular topic in application areas such as computer games and robotics. Compressed Path Databases (CPDs) are recognized as a state-of-the-art method...
详细信息
Weakly supervised semantic segmentation using only image-level labels is critical since it alleviates the need for expensive pixel-level labels. Most cuttingedge methods adopt two-step solutions that learn to produce ...
详细信息
Weakly supervised semantic segmentation using only image-level labels is critical since it alleviates the need for expensive pixel-level labels. Most cuttingedge methods adopt two-step solutions that learn to produce pseudo-ground-truth using only image-level labels and then train off-the-shelf fully supervised semantic segmentation network with these pseudo labels. Although these methods have made significant progress, they also increase the complexity of the model and training. In this paper, we propose a one-step approach for weakly supervised image semantic segmentation—attention guided enhancement network(AGEN), which produces pseudopixel-level labels under the supervision of image-level labels and trains the network to generate segmentation masks in an end-to-end manner. Particularly, we employ class activation maps(CAM) produced by different layers of the classification branch to guide the segmentation branch to learn spatial and semantic ***, the CAM produced by the lower layer can capture the complete object region but with many ***, the self-attention module is proposed to enhance object regions adaptively and suppress irrelevant object regions, further boosting the segmentation *** on the Pascal VOC 2012 dataset demonstrate that AGEN outperforms alternative state-of-the-art weakly supervised semantic segmentation methods exclusively relying on image-level labels.
In-context learning is a promising approach for offline reinforcement learning (RL) to handle online tasks, which can be achieved by providing task prompts. Recent works demonstrated that in-context RL could emerge wi...
详细信息
In-context learning is a promising approach for offline reinforcement learning (RL) to handle online tasks, which can be achieved by providing task prompts. Recent works demonstrated that in-context RL could emerge with self-improvement in a trial-and-error manner when treating RL tasks as an across-episodic sequential prediction problem. Despite the self-improvement not requiring gradient updates, current works still suffer from high computational costs when the across-episodic sequence increases with task horizons. To this end, we propose an In-context Decision Transformer (IDT) to achieve self-improvement in a high-level trial-and-error manner. Specifically, IDT is inspired by the efficient hierarchical structure of human decision-making and thus reconstructs the sequence to consist of high-level decisions instead of low-level actions that interact with environments. As one high-level decision can guide multi-step low-level actions, IDT naturally avoids excessively long sequences and solves online tasks more efficiently. Experimental results show that IDT achieves state-of-the-art in long-horizon tasks over current in-context RL methods. In particular, the online evaluation time of our IDT is 36× times faster than baselines in the D4RL benchmark and 27× times faster in the Grid World benchmark. Copyright 2024 by the author(s)
Graphs, as a fundamental data structure, have proven efficacy in modeling complex relationships between objects and are therefore found in wide web applications. Graph classification is an essential task in graph data...
详细信息
Aiming at the shortcomings of the traditional butterfly optimization algorithm in solving the high-dimensional classification feature selection problem, which has low convergence and is prone to fall into local optima...
详细信息
暂无评论