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

Applying Kumaraswamy distribution on stick-breaking process: a Dirichlet neural topic model approach

Neural Computing and Applications 2024年第22期36卷 13731-13744页

作者： Ouyang, Jihong Wang, Teng Cao, Jingyue Wang, Yiming College of Computer Science and Technology Jilin University Qianjin Street Jilin Changchun130015 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Qianjin Street Jilin Changchun130015 China

In recent years, neural topic modeling has increasingly raised extensive attention due to its capacity on generating coherent topics and flexible deep neural structures. However, the widely used Dirichlet distribution in shallow topic models is difficult to reparameterize. Therefore, most existing neural topic models assume the Gaussian as the prior of topic proportions for reparameterization. Gaussian distribution does not have the sparsity like Dirichlet distribution, which limits the model’s topic extraction ability. To address this issue, we propose a novel neural topic model approximating the Dirichlet prior with the reparameterizable Kumaraswamy distribution, namely Kumaraswamy Neural Topic Model (KNTM). Specifically, we adopted the stick-breaking process for posterior inference with the Kumaraswamy distribution as the base distribution. Besides, to capture the dependencies among topics, we propose a Kumaraswamy Recurrent Neural Topic Model (KRNTM) based on the recurrent stick-breaking construction to ensure that the model can still generate coherent topical words in high-dimensional topic space. We examined our method on five prevalent benchmark datasets over six Dirichlet-approximating neural topic models, among which KNTM has the lowest perplexity and KRNTM performance best on topic coherence and topic uniqueness. Qualitative analysis of the top topical words verifies that our proposed models can extract more semantically coherent topics compared with state-of-the-art models, further demonstrating our method’s effectiveness. This work contributes to the broader application of VAEs with Dirichlet priors. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Meta-GPS++: Enhancing Graph Meta-Learning with Contrastive Learning and Self-Training

引用

ACM Transactions on knowledge Discovery from Data 2024年第9期18卷 1-30页

作者： Liu, Yonghao Li, Mengyu Li, Ximing Huang, Lan Giunchiglia, Fausto Liang, Yanchun Feng, Xiaoyue Guan, Renchu Key Laboratory of Symbolic Computation and Knowledge Engineering of the Ministry of Education College of Computer Science and Technology Jilin University Changchun China University of Trento Trento Italy Zhuhai Lab. of the Key Lab. of Symbolic Computation and Knowledge Eng. of the Ministry of Education Zhuhai College of Science and Technology Zhuhai China

Node classification is an essential problem in graph learning. However, many models typically obtain unsatisfactory performance when applied to few-shot scenarios. Some studies have attempted to combine meta-learning with graph neural networks to solve few-shot node classification on graphs. Despite their promising performance, some limitations remain. First, they employ the node encoding mechanism of homophilic graphs to learn node embeddings, even in heterophilic graphs. Second, existing models based on meta-learning ignore the interference of randomness in the learning process. Third, they are trained using only limited labeled nodes within the specific task, without explicitly utilizing numerous unlabeled nodes. Finally, they treat almost all sampled tasks equally without customizing them for their uniqueness. To address these issues, we propose a novel framework for few-shot node classification called Meta-GPS. Specifically, we first adopt an efficient method to learn discriminative node representations on homophilic and heterophilic graphs. Then, we leverage a prototype-based approach to initialize parameters and contrastive learning for regularizing the distribution of node embeddings. Moreover, we apply self-Training to extract valuable information from unlabeled nodes. Additionally, we adopt S (scaling and shifting) transformation to learn transferable knowledge from diverse tasks. The results on real-world datasets show the superiority of Meta-GPS. Our code is available here. © 2024 Copyright held by the owner/author(s).

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Auxiliary Tasks Benefit Skeleton-based Action Recognition

Auxiliary Tasks Benefit Skeleton-based Action Recognition

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Yang, Yuheng Chen, Haipeng College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun China

ISBN: (纸本)9798350368741

Skeleton-based action recognition has long been a fundamental and intriguing problem in machine intelligence. This task is challenging due to pose occlusion and rapid motion, which typically results in incomplete or noisy skeleton data. State-of-the-art methods tend to learn human motion directly from these corrupted skeletons as if they were reliable. Unfortunately, this might lead to unsatisfactory results when key regions of the skeleton are occluded or disturbed. To tackle the problem, we propose a novel framework that integrates auxiliary tasks into a motion modeling network. These auxiliary tasks corrupt partial human skeletons with masking or noise and then force the network to recover the corrupted data, explicitly facilitating robust feature representation learning. We further propose supervising the auxiliary tasks with mutual information losses, mathematically ensuring feature consistency and spatial alignment between the recovered and original skeleton data. Empirically, our approach sets the new state-of-the-art performance on three benchmark datasets. © 2025 IEEE.

关键词： auxiliary task mutual information skeleton-based action recognition

来源：评论

学校读者我要写书评

暂无评论

Zero-shot Image Classification with Logic Adapter and Rule Prompt 24

Zero-shot Image Classification with Logic Adapter and Rule P...

引用

33rd ACM Web Conference, WWW 2024

作者： Yu, Dongran Liu, Xueyan Yang, Bo Key Laboratory of Symbolic Computation and Knowledge Engineer Ministry of Education School of Artificial Intelligence Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineer Ministry of Education School of Computer Science and Technology Jilin University Changchun China

ISBN: (纸本)9798400701719

Zero-shot image classification, which aims to predict unseen classes whose samples have never appeared during the training phase, is crucial in the Web domain because many new web images appear on various websites. Attributes, as annotations for class-level characteristics, are widely used semantic information for this task. However, most current methods often fail to capture discriminative image features between similar images from different classes, leading to unsatisfactory zero-shot image classification results. This is because they solely focus on limited visual-attribute feature alignment. Therefore, we propose a Zero-Shot image Classification with Logic adapter and Rule prompt method called ZSCLR, which utilizes logic adapter and rule prompts to encourage the model to capture discriminative image features and achieve reasoning. Specifically, ZSCLR consists of a visual perception module and a logic adapter. The visual perception module extracts image features from training data. At the same time, the logic adapter utilizes the Markov logic network to encode the extracted image features and rule prompts for refining the discriminative image features. Due to predicates of rule prompts representing symbolic discriminative features, the proposed model can focus more on these discriminative features and achieve more precise image classification. Additionally, the logic adapter enables the model to adapt from recognizing images in seen classes to those in unseen classes through the reasoning of the Markov logic networks. We implement experiments on three standard zero-shot image classification benchmarks, and ZSCLR achieves competitive performance. Furthermore, ZSCLR can provide explanations for its predictions through rule prompts. © 2024 ACM.

关键词： Zero-shot learning

来源：评论

学校读者我要写书评

暂无评论

Transformer-based multi-level attention integration network for video saliency prediction

引用

Multimedia Tools and Applications 2025年第13期84卷 11833-11854页

作者： Tan, Rui Sun, Minghui Liang, Yanhua Software College Jilin University Qianjin Street Jilin Changchun130012 China College of Computer Science and Technology Jilin University Qianjin Street Jilin Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Qianjin Street Jilin Changchun130012 China

Most existing models for video saliency prediction heavily rely on 3D convolutional operations to extract spatio-temporal features. However, it is worth noting that 3D convolution produces a local receptive field, which may struggle to capture long-range spatio-temporal dependencies effectively. To compensate for such shortage, this paper introduces a novel approach called the Transformer-based Multi-level Attention Integration Network (TMAI-Net) for video saliency prediction. TMAI-Net is designed as a two-stream encoder-decoder model, carefully integrating multi-level features of semantic information. Our model incorporates a Multi-level Interactive Attention(MLIA) module and a Transformer, both implemented based on self-attention mechanism, which are placed at different levels of the model to capture long-range spatio-temporal feature dependencies. Additionally, our model operates on input video frames and attentional patches, allowing the Transformer module to capture structural similarities between related objects in global features and attention features. This, in turn, enables the model to allocate increased attention to salient areas. The efficacy of our proposed approach is validated through extensive experiments conducted on three widely recognized benchmark datasets. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Harmfully Manipulated Images Matter in Multimodal Misinformation Detection 24

Harmfully Manipulated Images Matter in Multimodal Misinforma...

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： Wang, Bing Wang, Shengsheng Li, Changchun Guan, Renchu Li, Ximing College of Computer Science and Technology Jilin University Jilin Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of the Ministry of Education Jilin University China

ISBN: (纸本)9798400706868

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 containing multimodal content, has attracted growing attention from the academic and industrial communities, and induced an active research topic named Multimodal Misinformation Detection (MMD). Typically, existing MMD methods capture the semantic correlation and inconsistency between multiple modalities, but neglect some potential clues in multimodal content. Recent studies suggest that manipulated traces of the images in articles are non-trivial clues for detecting misinformation. Meanwhile, we find that the underlying intentions behind the manipulation, e.g., harmful and harmless, also matter in MMD. Accordingly, in this work, we propose to detect misinformation by learning manipulation features that indicate whether the image has been manipulated, as well as intention features regarding the harmful and harmless intentions of the manipulation. Unfortunately, the manipulation and intention labels that make these features discriminative are unknown. To overcome the problem, we propose two weakly supervised signals as alternatives by introducing additional datasets on image manipulation detection and formulating two classification tasks as positive and unlabeled learning problems. Based on these ideas, we propose a novel MMD method, namely Harmfully Manipulated Images Matter in MMD (Hami-m3d). Extensive experiments across three benchmark datasets can demonstrate that Hami-m3d can consistently improve the performance of any MMD baselines. © 2024 ACM.

关键词： image manipulation

来源：评论

学校读者我要写书评

暂无评论

Caption-Aware Multimodal Relation Extraction with Mutual Information Maximization 24

Caption-Aware Multimodal Relation Extraction with Mutual Inf...

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： Zhang, Zefan Zhang, Weiqi Li, Yanhui Bai, Tian College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun China

ISBN: (纸本)9798400706868

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 main reason is that visual features are not fully aligned with textual features and the reasoning process may suppress redundant and noisy information at the risk of losing critical information. In light of this, we propose a Caption-Aware Multimodal Relation Extraction Network with Mutual Information Maximization (CAMIM). Specifically, we first generate detailed image captions through the Large Language Model (LLM). Then, the Caption-Aware Module (CAM) hierarchically aligns the fine-grained visual entities and textual entities for reasoning. In addition, for preserving crucial information within different modalities, we leverage a Mutual Information Maximization method to regulate the multimodal reasoning module. Experiments show that our model outperforms the state-of-the-art MRE models on the benchmark dataset MNRE. Further ablation studies prove the pluggable and effective performance of our Caption-Aware Module and Mutual Information Maximization method. Our code is available at https://***/zefanZhang-cn/CAMIM. © 2024 ACM.

关键词： Modeling languages

来源：评论

学校读者我要写书评

暂无评论

Multiparticipant Federated Feature Selection Algorithm With Particle Swarm Optimization for Imbalanced Data Under Privacy Protection

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2023年第5期4卷 1002-1016页

作者： Hu, Ying Zhang, Yong Gong, Dunwei Sun, Xiaoyan China University of Mining and Technology School of Information and Control Engineering Xuzhou221008 China Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Changchun130012 China

In the real world, data describing the same learning task may be distributed in different institutions (called participants), and these participants cannot share their own data due to the need of privacy protection. How to select an optimal feature subset on the basis of ensuring the data privacy of each participant is an important and challenging topic. At the same time, data on part participants show imbalanced or even miss some classes, further increasing the difficulty of solving this kind of problem. In view of this, by introducing a trusted third party to process and integrate optimal information from participants, this article proposes a multiparticipant federated evolutionary feature selection algorithm for imbalanced data under privacy protection. First, a multilevel joint sample filling strategy with multiple participants (called sampling-rough selection-fine tuning strategy) is proposed to fill imbalanced or empty classes on each participant while ensuring data privacy. Then, a federated evolutionary feature selection method based on particle swarm optimization (PSO) is proposed by periodically sharing the optimal feature subsets obtained by PSOs on participants. Finally, the proposed algorithm is applied to 15 test datasets, and compared with several typical imbalanced feature selection algorithms and two kinds of ensemble feature selection algorithms. The experimental results show that the proposed algorithm can significantly promote the ability of each participant on processing imbalanced datasets, and improve the classification accuracy of obtained feature subsets while protecting the participants' data privacy. © 2020 IEEE.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

More Flexible Proximity Wildcards Path Planning with Compressed Path Databases 34

More Flexible Proximity Wildcards Path Planning with Compres...

引用

34th International Conference on Automated Planning and Scheduling, ICAPS 2024

作者： Chen, Xi Zhang, Yue Zhang, Yonggang College of Software Jilin University China College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University China

ISBN: (纸本)9781577358893

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 for grid-based path planning. It is able to find an optimal path extremely fast without state-space search. In recent years, researchers have tended to focus on improving CPDs by reducing CPD size or improving search performance. Among various methods, proximity wildcards are one of the most proven improvements in reducing the size of CPD. However, its proximity area is significantly restricted by complex terrain, which significantly affects the pathfinding efficiency and causes more additional costs. In this paper, we enhance CPDs from the perspective of improving search efficiency and reducing search costs. Our work focuses on using more flexible methods to obtain larger proximity areas, so that more heuristic information can be used to improve search performance. Experiments conducted on the Grid-Based Path Planning Competition (GPPC) benchmarks demonstrate that the two proposed methods can effectively improve search efficiency and reduce search costs by up to 3 orders of magnitude. Remarkably, our methods can further reduce the storage cost, and improve the compression capability of CPDs simultaneously. Copyright © 2024, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

A frequency and two-hop configuration checking-driven local search algorithm for the minimum weakly connected dominating set problem

引用

Neural Computing and Applications 2024年第22期36卷 13833-13852页

作者： Li, Ruizhi He, Jintao Lin, Cuisong Liu, Ying Hu, Shuli Yin, Minghao Jilin University of Finance and Economics Changchun130117 China Northeast Normal University Changchun130117 China Business Big Data Research Center of Jilin Province Changchun130117 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China

The minimum weakly connected dominating set problem is a typical NP-hard problem with a wide range of applications. To solve this problem, we propose a frequency property and two-hop configuration checking strategy-driven local search algorithm (FCC2LS). In this algorithm, we first propose a lock-vertex-based initial solution construction procedure. This procedure guarantees that certain vertices, which must be included in the optimal solution, are added to the solution. Second, we propose a two-hop configuration checking strategy and a frequency property. The two-hop configuration checking strategy is a new variant of the original configuration checking strategy, which prohibits vertices with unchanged configuration from being added to the candidate solution. The frequency property is used to record the number of times for each vertex is added to the solution, which can increase the diversity of selected vertices. Third, we combine two scoring functions, Dscore and Nscore, with the above strategies and propose effective vertex selection methods to help the algorithm select suitable vertices to add into or remove from the candidate solutions. Finally, we evaluate the proposed algorithm FCC2LS with four state-of-the-art algorithms on four groups of benchmark instances. Experimental results show that our algorithm performs better on four classical benchmark instances. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：