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

Research Square 2021年

作者： Zhang, Ping Sheng, Jiyao Gao, Wanfu Hu, Juncheng Li, Yonghao College of Computer Science and Technology JiLin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China College of Chemistry Jilin University Changchun China

Multi-label feature selection attracts considerable attention from multi-label learning. Information-theory based multi-label feature selection methods intend to select the most informative features and reduce the uncertain amount of information of labels. Previous methods regard the uncertain amount of information of labels as constant. In fact, as the classification information of the label set is captured by features, the remaining uncertainty of each label is changing dynamically. In this paper, we categorize labels into two groups: one contains the labels with few remaining uncertainty, which means that most of classification information with respect to the labels has been obtained by the already-selected features;another group contains the labels with extensive remaining uncertainty, which means that the classification information of these labels is neglected by already-selected features. Feature selection aims to select the new features with highly relevant to the labels in the second group. Existing methods do not distinguish the difference between two label groups and ignore the dynamic change amount of information of labels. To this end, a Relevancy Ratio is designed to clarify the dynamic change amount of information of each label under the condition of the already-selected features. Afterwards, a Weighted Feature Relevancy is defined to evaluate the candidate features. Finally, a new multi-label Feature Selection method based on Weighted Feature Relevancy (WFRFS) is proposed. The experiments obtain encouraging results of WFRFS in comparison to six multi-label feature selection methods on thirteen real-world data sets. © 2021, CC BY.

关键词： Information theory

来源：评论

学校读者我要写书评

暂无评论

IE-GAN: An Improved Evolutionary Generative Adversarial Network Using a New Fitness Function and a Generic Crossover Operator

arXiv

引用

arXiv 2021年

作者： Li, Junjie Li, Jingyao Zhou, Wenbo Lü, Shuai The Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University Ministry of Education China College of Computer Science and Technology Jilin University China The School of Information Science and Technology Northeast Normal University China

The training of generative adversarial networks (GANs) is usually vulnerable to mode collapse and vanishing gradients. The evolutionary generative adversarial network (E-GAN) attempts to alleviate these issues by optimizing the learning strategy with multiple loss functions. It uses a learning-based evolutionary framework, which develops new mutation operators specifically for general deep neural networks. However, the evaluation mechanism in the fitness function of E-GAN cannot truly reflect the adaptability of individuals to their environment, leading to an inaccurate assessment of the diversity of individuals. Moreover, the evolution step of E-GAN only contains mutation operators without considering the crossover operator jointly, isolating the superior characteristics among individuals. To address these issues, we propose an improved E-GAN framework called IE-GAN, which introduces a new fitness function and a generic crossover operator. In particular, the proposed fitness function, from an objective perspective, can model the evolutionary process of individuals more accurately. The crossover operator, which has been commonly adopted in evolutionary algorithms, can enable offspring to imitate the superior gene expression of their parents through knowledge distillation. Experiments on various datasets demonstrate the effectiveness of our proposed IE-GAN in terms of the quality of the generated samples and time efficiency. Copyright © 2021, The Authors. All rights reserved.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Multimodal Hypothetical Summary for Retrieval-based Multi-image Question Answering 39

Multimodal Hypothetical Summary for Retrieval-based Multi-im...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Li, Peize Si, Qingyi Fu, Peng Lin, Zheng Wang, Yan School of Artificial Intelligence Jilin University Changchun China Institute of Information Engineering Chinese Academy of Sciences Beijing China Huawei Technologies Co. Ltd. Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Changchun China

ISBN: (纸本)157735897X

Retrieval-based multi-image question answering (QA) task involves retrieving multiple question-related images and synthesizing these images to generate an answer. Conventional "retrieve-then-answer" pipelines often suffer from cascading errors because the training objective of QA fails to optimize the retrieval stage. To address this issue, we propose a novel method to effectively introduce and reference retrieved information into the QA. Given the image set to be retrieved, we employ a multimodal large language model (visual perspective) and a large language model (textual perspective) to obtain multimodal hypothetical summary in question-form and description-form. By combining visual and textual perspectives, MHyS captures image content more specifically and replaces real images in retrieval, which eliminates the modality gap by transforming into text-to-text retrieval and helps improve retrieval. To more advantageously introduce retrieval with QA, we employ contrastive learning to align queries (questions) with MHyS. Moreover, we propose a coarse-to-fine strategy for calculating both sentence-level and word-level similarity scores, to further enhance retrieval and filter out irrelevant details. Our approach achieves a 3.7% absolute improvement over state-of-the-art methods on RETVQA and a 14.5% improvement over CLIP. Comprehensive experiments and detailed ablation studies demonstrate the superiority of our method. © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Traffic Jam Prediction Based on Analysis of Residents Spatial Activities

Traffic Jam Prediction Based on Analysis of Residents Spatia...

引用

Computer Information and Big Data Applications (CIBDA), International Conference on

作者： Zhijin Lv Hao Fu Wei Tang Xiaoxu Chen College of Software Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun

ISBN: (数字)9781728198378

ISBN: (纸本)9781728198385

The prediction of urban traffic congestion has always been one of the important contents in the research of intelligent transportation systems. The difficulty in predicting urban traffic congestion is that urban traffic operation is essentially a collection of spatial activity planning for residents under certain conditions. The huge group of residents themselves has great complexity and uncertainty. Traditional neural networks mostly focus on road characteristic data and road condition data, and lack of in-depth exploration of the fundamental factors of traffic congestion for residents' travel. So we propose a traffic congestion prediction model based on the analysis of residents' spatial activities. Starting from the residents' activities, the simulation of urban traffic operation conditions can more realistically reflect the traffic congestion situation of the city at specific times and roads, and quickly generate model results. The experimental results show that the model analyzed by residents' spatial activities runs fast and has high prediction accuracy. The results are in line with the actual situation and have strong practical value.

关键词： Data models Traffic congestion Big Data applications Logistics

来源：评论

学校读者我要写书评

暂无评论

Incomplete graph learning: A comprehensive survey

引用

Neural networks : the official journal of the International Neural Network Society 2025年 190卷 107682页

作者： Riting Xia Huibo Liu Anchen Li Xueyan Liu Yan Zhang Chunxu Zhang Bo Yang College of Computer Science Inner Mongolia University Hohhot 010021 China. Electronic address: xiart19@***. College of Computer Science Inner Mongolia University Hohhot 010021 China. Electronic address: liuhuibo@***. School of Computer Science and Technology Jilin University Changchun Jilin 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun Jilin 130012 China. Electronic address: liac@***. Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun Jilin 130012 China. Electronic address: xueyanliu@***. College of Computer Science Inner Mongolia University Hohhot 010021 China. Electronic address: yanz19@***. Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun Jilin 130012 China. Electronic address: zhangchunxu@***. Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun Jilin 130012 China. Electronic address: ybo@***.

Graph learning is a prevalent field that operates on ubiquitous graph data. Effective graph learning methods can extract valuable information from graphs. However, these methods are non-robust and affected by missing attributes in graphs, resulting in sub-optimal outcomes. This has led to the emergence of incomplete graph learning, which aims to process and learn from incomplete graphs to achieve more accurate and representative results. In this paper, we conducted a comprehensive review of the literature on incomplete graph learning. Initially, we categorize incomplete graphs and provide precise definitions of relevant concepts, terminologies, and techniques, thereby establishing a solid understanding for readers. Subsequently, we classify incomplete graph learning methods according to the types of incompleteness: (1) attribute-incomplete graph learning methods, (2) attribute-missing graph learning methods, and (3) hybrid-absent graph learning methods. By systematically classifying and summarizing incomplete graph learning methods, we highlight the commonalities and differences among existing approaches, aiding readers in selecting methods and laying the groundwork for further advancements. In addition, we summarize the datasets, incomplete processing modes, evaluation metrics, and application domains used by the current methods. Lastly, we discuss the current challenges and propose future directions for incomplete graph learning, with the aim of stimulating further innovations in this crucial field. To our knowledge, this is the first review dedicated to incomplete graph learning, aiming to offer valuable insights for researchers in related fields..

关键词： Attribute-incomplete graphs Attribute-missing graphs Graph learning Incomplete graph learning Incomplete graphs Robustness

来源：评论

学校读者我要写书评

暂无评论

Object Attribute Matters in Visual Question Answering

arXiv

引用

arXiv 2023年

作者： Li, Peize Si, Qingyi Fu, Peng Lin, Zheng Wang, Yan School of Artificial Intelligence Jilin University Changchun China Institute of Information Engineering Chinese Academy of Sciences Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Changchun China

Visual question answering is a multimodal task that requires the joint comprehension of visual and textual information. However, integrating visual and textual semantics solely through attention layers is insufficient to comprehensively understand and align information from both modalities. Intuitively, object attributes can naturally serve as a bridge to unify them, which has been overlooked in previous research. In this paper, we propose a novel VQA approach from the perspective of utilizing object attribute, aiming to achieve better object-level visual-language alignment and multimodal scene understanding. Specifically, we design an attribute fusion module and a contrastive knowledge distillation module. The attribute fusion module constructs a multimodal graph neural network to fuse attributes and visual features through message passing. The enhanced object-level visual features contribute to solving fine-grained problem like counting-question. The better object-level visual-language alignment aids in understanding multimodal scenes, thereby improving the model’s robustness. Furthermore, to augment scene understanding and the out-of-distribution performance, the contrastive knowledge distillation module introduces a series of implicit knowledge. We distill knowledge into attributes through contrastive loss, which further strengthens the representation learning of attribute features and facilitates visual-linguistic alignment. Intensive experiments on six datasets, COCO-QA, VQAv2, VQA-CPv2, VQA-CPv1, VQAvs and TDIUC, show the superiority of the proposed method. © 2023, CC BY.

关键词： Distillation

来源：评论

学校读者我要写书评

暂无评论

Document-level Relation Extraction with Relation Correlations

arXiv

引用

arXiv 2022年

作者： Han, Ridong Peng, Tao Wang, Benyou Liu, Lu Wan, Xiang College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education China College of Software Jilin University China Shenzhen Research Institute of Big Data The Chinese University of Hong Kong Shenzhen China School of Data Science The Chinese University of Hong Kong Shenzhen China

Document-level relation extraction faces two overlooked challenges: long-tail problem and multi-label problem. Previous work focuses mainly on obtaining better contextual representations for entity pairs, hardly address the above challenges. In this paper, we analyze the co-occurrence correlation of relations, and introduce it into DocRE task for the first time. We argue that the correlations can not only transfer knowledge between data-rich relations and data-scarce ones to assist in the training of tailed relations, but also reflect semantic distance guiding the classifier to identify semantically close relations for multi-label entity pairs. Specifically, we use relation embedding as a medium, and propose two co-occurrence prediction sub-tasks from both coarse- and fine-grained perspectives to capture relation correlations. Finally, the learned correlation-aware embeddings are used to guide the extraction of relational facts. Substantial experiments on two popular DocRE datasets are conducted, and our method achieves superior results compared to baselines. Insightful analysis also demonstrates the potential of relation correlations to address the above challenges. Copyright © 2022, The Authors. All rights reserved.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

Sample efficient imitation learning via reward function trained in advance

arXiv

引用

arXiv 2021年

作者： Zhang, LiHua Liu, Quan School of Computer Science and Technology Soochow University Soochow China Provincial Key Laboratory for Computer Information Processing Technology Soochow University Soochow China Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education Jilin University Jilin China

Imitation learning (IL) is a framework that learns to imitate expert behavior from demonstrations. Recently, IL shows promising results on high dimensional and control tasks. However, IL typically suffers from sample inefficiency in terms of environment interaction, which severely limits their application to simulated domains. In industrial applications, learner usually have a high interaction cost, the more interactions with environment, the more damage it causes to the environment and the learner itself. In this article, we make an effort to improve sample efficiency by introducing a novel scheme of inverse reinforcement learning. Our method, which we call Model Reward Function Based Imitation Learning (MRFIL), uses an ensemble dynamic model as a reward function, what is trained with expert demonstrations. The key idea is to provide the agent with an incentive to match the demonstrations over a long horizon, by providing a positive reward upon encountering states in line with the expert demonstration distribution. In addition, we demonstrate the convergence guarantee for new objective function. Experimental results show that our algorithm reaches the competitive performance and significantly reducing the environment interactions compared to IL methods. Copyright © 2021, The Authors. All rights reserved.

关键词： Demonstrations

来源：评论

学校读者我要写书评

暂无评论

Method for Preoperative Prediction of Microvascular Invasion of Hepatocellular Carcinoma

Method for Preoperative Prediction of Microvascular Invasion...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Chen Zhao Tian Bai Tongjia Chu Feng Wei Fa Zhang 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 Hepatobiliary and Pancreas Department General Surgery Center First Hospital of Jilin University Changchun China School of Medical Technology Beijing Institute of Technology Beijing China

ISBN: (数字)9781665468190

ISBN: (纸本)9781665468206

Microvascular invasion (MVI) in hepatocellular carcinoma (HCC) is of great guiding significance for the formulating treatment strategies and accessing the prognosis before the surgery. However, in traditional medicine, the gold standard for the diagnosis of MVI is obtained by examining pathological images which can only be obtained by sampling and sectioning tumors after surgery. At this time, MVI results have lost the timeliness of guiding tumor resection surgery. In order to solve this problem, existing studies began to use deep learning-based methods for preoperative prediction of MVI using non-invasive imaging. Most of these methods adopt the fusion methods of multi-sequence images to predict MVI, but fail to make full use of the characteristics of multiply sequences as prior knowledge to combine into the model, resulting in no further improvement of prediction performance. So we propose a multi-sequence image difference and correlation deep learning model. The model can extract the difference and correlation information between sequences from different scales and combine them into the model. To validate proposed model, we collected a data set consists of 120 HCC patients, including 50 MVI-positive patients. Compared with existing studies, our method has greatly improved in all evaluation metrics.

关键词： Deep learning Pathology Correlation Biological system modeling Surgery Predictive models Data mining

来源：评论

学校读者我要写书评

暂无评论

Distilling Autoregressive Models to Obtain High-Performance Non-Autoregressive Solvers for Vehicle Routing Problems with Faster Inference Speed

arXiv

引用

arXiv 2023年

作者： Xiao, Yubin Wang, Di Li, Boyang Wang, Mingzhao Wu, Xuan Zhou, Changliang Zhou, You Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University China Joint NTU-UBC Research Centre of Excellence in Active Living for the Elderly Nanyang Technological University Singapore WeBank-NTU Joint Research Institute on Fintech Nanyang Technological University Singapore School of Computer Science and Engineering Nanyang Technological University Singapore School of System Design and Intelligent Manufacturing Southern University of Science and Technology China

Neural construction models have shown promising performance for Vehicle Routing Problems (VRPs) by adopting either the Autoregressive (AR) or Non-Autoregressive (NAR) learning approach. While AR models produce high-quality solutions, they generally have a high inference latency due to their sequential generation nature. Conversely, NAR models generate solutions in parallel with a low inference latency but generally exhibit inferior performance. In this paper, we propose a generic Guided Non-Autoregressive knowledge Distillation (GNARKD) method to obtain high-performance NAR models having a low inference latency. GNARKD removes the constraint of sequential generation in AR models while preserving the learned pivotal components in the network architecture to obtain the corresponding NAR models through knowledge distillation. We evaluate GNARKD by applying it to three widely adopted AR models to obtain NAR VRP solvers for both synthesized and real-world instances. The experimental results demonstrate that GNARKD significantly reduces the inference time (4∼5× faster) with acceptable performance drop (2∼3%). To the best of our knowledge, this study is first-of-its-kind to obtain NAR VRP solvers from AR ones through knowledge distillation. Copyright © 2023, The Authors. All rights reserved.

关键词： Distillation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：