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

SSRN 2024年

作者： Chen, Haipeng Ju, Honghong Qin, Jun Song, Jincai Lyu, Yingda Liu, Xianzhu College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Computer Science and Technology Changchun University of Science and Technology Changchun130022 China Public Computer Education and Research Center Jilin University Changchun130012 China National and Local Joint Engineering Research Center of Space Optoelectronics Technology Changchun University of Science and Technology Changchun130022 China College of Opto-Electronic Engineering Changchun University of Science and Technology Changchun130022 China

Automatic segmentation of polyps from colonoscopy images plays a critical role in early screening and treatment of colorectal cancer. Although deep learning methods have made significant progress, precise polyp segmentation faces two challenges: (1) the imbalance of color appearances in the limited training dataset hinders the generalization of the model, and (2) polyps have the diverse scales, locations and shapes with blurred boundary. To address the issues, Dataset-Level Color Augmentation (DLCA) and Convolutional Multi-scale Attention Module (CMAM) are proposed. DLCA employs the dataset-level color knowledge and generate new color appearances, to avoid the model learning false associations with colors. Meanwhile, CMAM simultaneously explores the region and boundary clues and model multi-scale context, which improves the accuracy of polyp localization and fine-grained segmentation. We conduct comprehensive experiments and compare our network with state-of-the-art methods. The proposed model is superior on multiple polyp datasets, especially on ETIS, where mDice and mIoU reach 0.839 and 0.766. Furthermore, it's validated that DLCA can be widely applied to most polyp segmentation methods, and CMAM is practical and plug-and-play. Finally, the model demonstrates promising generalization to breast ultrasound and skin lesion segmentation. © 2024, The Authors. All rights reserved.

关键词： Color

来源：评论

学校读者我要写书评

暂无评论

Multi-Label Feature Selection Method Based on Dynamic Weight

Research Square

引用

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Supervised topic models with weighted words:multi-label document classification

引用

Frontiers of Information Technology & Electronic engineering 2018年第4期19卷 513-523页

作者： Yue-peng ZOU Ji-hong OUYANG Xi-ming LI College of Computer Science and Technology Jilin University MOE Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University

Supervised topic modeling algorithms have been successfully applied to multi-label document classification *** models include labeled latent Dirichlet allocation(L-LDA)and ***,these models neglect the class frequency information of words(i.e.,the number of classes where a word has occurred in the training data),which is significant for *** address this,we propose a method,namely the class frequency weight(CF-weight),to weight words by considering the class frequency *** CF-weight is based on the intuition that a word with higher(lower)class frequency will be less(more)*** this study,the CF-weight is used to improve L-LDA and dependency-LDA.A number of experiments have been conducted on real-world multi-label *** results demonstrate that CF-weight based algorithms are competitive with the existing supervised topic models.

关键词： Supervised topic model Multi-label classification Class frequency Labeled latent Dirichlet allocation (L-LDA) Dependency-LDA

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Aerial Active STAR-RIS-assisted Satellite-Terrestrial Covert Communications

arXiv

引用

arXiv 2025年

作者： Zhang, Chuang Sun, Geng Li, Jiahui Wang, Jiacheng Zhang, Ruichen Niyato, Dusit Mao, Shiwen Quek, Tony Q.S. Computer Science and Technology Jilin University Changchun130012 China Singapore University of Technology and Design Singapore487372 Singapore College of Computer Science and Technology Jilin University Changchun130012 China College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China Department of Electrical and Computer Engineering Auburn University AuburnAL36849 United States Information System Technology and Design Pillar Singapore University of Technology and Design Singapore487372 Singapore

An integration of satellites and terrestrial networks is crucial for enhancing performance of next generation communication systems. However, the networks are hindered by the long-distance path loss and security risks in dense urban environments. In this work, we propose a satellite-terrestrial covert communication system assisted by the aerial active simultaneous transmitting and reflecting reconfigurable intelligent surface (AASTAR-RIS) to improve the channel capacity while ensuring the transmission covertness. Specifically, we first derive the minimal detection error probability (DEP) under the worst condition that the Warden has perfect channel state information (CSI). Then, we formulate an AASTAR-RIS-assisted satellite-terrestrial covert communication optimization problem (ASCCOP) to maximize the sum of the fair channel capacity for all ground users while meeting the strict covert constraint, by jointly optimizing the trajectory and active beamforming of the AASTAR-RIS. Due to the challenges posed by the complex and high-dimensional state-action spaces as well as the need for efficient exploration in dynamic environments, we propose a generative deterministic policy gradient (GDPG) algorithm, which is a generative deep reinforcement learning (DRL) method to solve the ASCCOP. Concretely, the generative diffusion model (GDM) is utilized as the policy representation of the algorithm to enhance the exploration process by generating diverse and high-quality samples through a series of denoising steps. Moreover, we incorporate an action gradient mechanism to accomplish the policy improvement of the algorithm, which refines the better state-action pairs through the gradient ascent. Simulation results demonstrate that the proposed approach significantly outperforms important benchmarks, and also validate the performance and practicality under different algorithm parameters and environment settings. Copyright © 2025, The Authors. All rights reserved.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Elucidating Spatial Complex Structures from Mass Spectrometry Imaging with Deep Multimodal Model

Elucidating Spatial Complex Structures from Mass Spectrometr...

引用

Medical Artificial Intelligence (MedAI), IEEE International Conference on

作者： Jiangnan Cui Junjie Xia Xuan Li Yan Wang Fufang Qiu Yaochen Xu Keren Xu Chunman Zuo School of Computer Science and Technology Institute of Artificial Intelligence Donghua University Shanghai China Institute of Artificial Intelligence Donghua University Shanghai China College of Computer Science and Technology Jilin University Changchun China Department of Neurosurgery Huashan Hospital Shanghai China CAS Key Laboratory of Systems Biology Shanghai Institute of Biochemistry and Cell Biology Center for Excellence in Molecular Cell Science Chinese Academy of Sciences Shanghai China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China

Spatial mass spectrometry imaging (SMSI) technology has enabled the characterization of biomolecule patterns within the tissue microenvironment, yet its analyses suffer from substantial noise. The lack of effective methods for exploiting multi-view features (e.g., spatial location) has hindered their elucidation ability for tissue heterogeneity. Here, we propose MSG, a multimodal modal that integrates histology, spatial location, and MSI data, in deciphering tissue structure by graph neural network. Specifically, MSG learns low-dimensional representations by aggregating histomorphological features from neighboring tiles via graph attention autoencoder. MSG outperforms other methods in identifying spatial domains and denoising data. The subsequent domain-guided differential expression analysis of the denoised data enables the identification of ions with significantly enriched patterns within the recognized domains. MSG exhibits its versatility in handling SMSI data from various platforms.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：