• Complex
  • Title
  • Keyword
  • Abstract
  • Scholars
  • Journal
  • ISSN
  • Conference
搜索
High Impact Results & Cited Count Trend for Year Keyword Cloud and Partner Relationship

Query:

学者姓名:冀俊忠

Refining:

Source

Submit Unfold

Co-Author

Submit Unfold

Clean All

Sort by:
Default
  • Default
  • Title
  • Year
  • WOS Cited Count
  • Impact factor
  • Ascending
  • Descending
< Page ,Total 24 >
Intra- and Inter-Head Orthogonal Attention for Image Captioning SCIE
期刊论文 | 2025 , 34 , 594-607 | IEEE TRANSACTIONS ON IMAGE PROCESSING
Abstract&Keyword Cite

Abstract :

Multi-head attention (MA), which allows the model to jointly attend to crucial information from diverse representation subspaces through its heads, has yielded remarkable achievement in image captioning. However, there is no explicit mechanism to ensure MA attends to appropriate positions in diverse subspaces, resulting in overfocused attention for each head and redundancy between heads. In this paper, we propose a novel Intra- and Inter-Head Orthogonal Attention (I(2)OA) to efficiently improve MA in image captioning by introducing a concise orthogonal regularization to heads. Specifically, Intra-Head Orthogonal Attention enhances the attention learning of MA by introducing orthogonal constraint to each head, which decentralizes the object-centric attention to more comprehensive content-aware attention. Inter-Head Orthogonal Attention reduces the heads redundancy by applying orthogonal constraint between heads, which enlarges the diversity of representation subspaces and improves the representation ability for MA. Moreover, the proposed I(2)OA is flexible to combine with various multi-head attention based image captioning methods and improve the performances without increasing model complexity and parameters. Experiments on the MS COCO dataset demonstrate the effectiveness of the proposed model.

Keyword :

Visualization Visualization Transformers Transformers multi-head attention (MA) multi-head attention (MA) Redundancy Redundancy Accuracy Accuracy orthogonal constraint orthogonal constraint Head Head Decoding Decoding Feature extraction Feature extraction Optimization Optimization Dogs Dogs Correlation Correlation Image captioning Image captioning

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Zhang, Xiaodan , Jia, Aozhe , Ji, Junzhong et al. Intra- and Inter-Head Orthogonal Attention for Image Captioning [J]. | IEEE TRANSACTIONS ON IMAGE PROCESSING , 2025 , 34 : 594-607 .
MLA Zhang, Xiaodan et al. "Intra- and Inter-Head Orthogonal Attention for Image Captioning" . | IEEE TRANSACTIONS ON IMAGE PROCESSING 34 (2025) : 594-607 .
APA Zhang, Xiaodan , Jia, Aozhe , Ji, Junzhong , Qu, Liangqiong , Ye, Qixiang . Intra- and Inter-Head Orthogonal Attention for Image Captioning . | IEEE TRANSACTIONS ON IMAGE PROCESSING , 2025 , 34 , 594-607 .
Export to NoteExpress RIS BibTex
A similar environment transfer strategy for dynamic multiobjective optimization SCIE
期刊论文 | 2025 , 707 | INFORMATION SCIENCES
Abstract&Keyword Cite

Abstract :

Solving dynamic multiobjective optimization problems (DMOPs) is extremely challenging due to the need to address multiple conflicting objectives that change over time. Transfer prediction- based strategies typically leverage solutions from historical environments to generate an initial population for a new environment. However, these strategies often overlook the similarity between the historical and new environments, which can negatively impact the quality of the initial population. To address this issue, we propose a similar environment transfer strategy. Firstly, we select Pareto-optimal solutions from a randomly generated population in the new environment to form a prior Pareto set (PS). The prior PS is expand by oversampling sparse solutions. Then, we apply the maximum mean discrepancy (MMD) to measure the discrepancy between the prior PS and the PS from each historical environment. The historical environment with the smallest MMD is identified as the similar environment. Finally, we use solutions from this similar environment to establish a kernelized easy transfer learning model, which is employed to predict the quality of random solutions in the new environment. The initial population is formed by combining excellent solutions predicted by the model with the prior PS. Experimental results demonstrate that the proposed strategy significantly outperforms several state-of-the-art strategies.

Keyword :

Dynamic multiobjective optimization Dynamic multiobjective optimization Transfer learning Transfer learning Prediction-based strategy Prediction-based strategy Maximum mean discrepancy Maximum mean discrepancy

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Ji, Junzhong , Zhang, Xiaoyu , Yang, Cuicui et al. A similar environment transfer strategy for dynamic multiobjective optimization [J]. | INFORMATION SCIENCES , 2025 , 707 .
MLA Ji, Junzhong et al. "A similar environment transfer strategy for dynamic multiobjective optimization" . | INFORMATION SCIENCES 707 (2025) .
APA Ji, Junzhong , Zhang, Xiaoyu , Yang, Cuicui , Li, Xiang , Sui, Guangyuan . A similar environment transfer strategy for dynamic multiobjective optimization . | INFORMATION SCIENCES , 2025 , 707 .
Export to NoteExpress RIS BibTex
MetaRLEC: Meta-Reinforcement Learning for Discovery of Brain Effective Connectivity CPCI-S
期刊论文 | 2024 , 10261-10269 | THIRTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 38 NO 9
WoS CC Cited Count: 5
Abstract&Keyword Cite

Abstract :

In recent years, the discovery of brain effective connectivity (EC) networks through computational analysis of functional magnetic resonance imaging (fMRI) data has gained prominence in neuroscience and neuroimaging. However, owing to the influence of diverse factors during data collection and processing, fMRI data typically exhibit high noise and limited sample characteristics, consequently leading to the suboptimal performance of current methods. In this paper, we propose a novel brain effective connectivity discovery method based on meta-reinforcement learning, called MetaRLEC. The method mainly consists of three modules: actor, critic, and meta-critic. MetaRLEC first employs an encoder-decoder framework: The encoder utilizing a transformer converts noisy fMRI data into a state embedding, and the decoder employing bidirectional LSTM discovers brain region dependencies from the state and generates actions (EC networks). Then, a critic network evaluates these actions, incentivizing the actor to learn higher-reward actions amidst the high-noise setting. Finally, a meta-critic framework facilitates online learning of historical state-action pairs, integrating an action-value neural network and supplementary training losses to enhance the model's adaptability to small-sample fMRI data. We conduct comprehensive experiments on both simulated and real-world data to demonstrate the efficacy of our proposed method.

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Zhang, Zuozhen , Ji, Junzhong , Liu, Jinduo . MetaRLEC: Meta-Reinforcement Learning for Discovery of Brain Effective Connectivity [J]. | THIRTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 38 NO 9 , 2024 : 10261-10269 .
MLA Zhang, Zuozhen et al. "MetaRLEC: Meta-Reinforcement Learning for Discovery of Brain Effective Connectivity" . | THIRTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 38 NO 9 (2024) : 10261-10269 .
APA Zhang, Zuozhen , Ji, Junzhong , Liu, Jinduo . MetaRLEC: Meta-Reinforcement Learning for Discovery of Brain Effective Connectivity . | THIRTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 38 NO 9 , 2024 , 10261-10269 .
Export to NoteExpress RIS BibTex
Concept-Level Causal Explanation Method for Brain Function Network Classification CPCI-S
期刊论文 | 2024 , 3087-3096 | PROCEEDINGS OF THE THIRTY-THIRD INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2024
Abstract&Keyword Cite

Abstract :

Using deep models to classify brain functional networks (BFNs) for the auxiliary diagnosis and treatment of brain diseases has become increasingly popular. However, the unexplainability of deep models has seriously hindered their applications in computer-aided diagnosis. In addition, current explanation methods mostly focus on natural images, which cannot be directly used to explain the deep model for BFN classification. In this paper, we propose a novel concept-level causal explanation method for BFN classification called CLCEM. First, CLCEM employs the causal learning method to extract concepts that are meaningful to humans from BFNs. Second, it aggregates the same concepts to obtain the contribution of each concept to the model output. Finally, CLCEM adds the contribution of each concept to make a diagnosis. The experimental results show that our CLCEM can not only accurately identify brain regions related to specific brain diseases but also make decisions based on the concepts of these brain regions, which enables humans to understand the decision-making process without performance degradation.

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Liu, Jinduo , Wang, Feipeng , Ji, Junzhong . Concept-Level Causal Explanation Method for Brain Function Network Classification [J]. | PROCEEDINGS OF THE THIRTY-THIRD INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2024 , 2024 : 3087-3096 .
MLA Liu, Jinduo et al. "Concept-Level Causal Explanation Method for Brain Function Network Classification" . | PROCEEDINGS OF THE THIRTY-THIRD INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2024 (2024) : 3087-3096 .
APA Liu, Jinduo , Wang, Feipeng , Ji, Junzhong . Concept-Level Causal Explanation Method for Brain Function Network Classification . | PROCEEDINGS OF THE THIRTY-THIRD INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2024 , 2024 , 3087-3096 .
Export to NoteExpress RIS BibTex
Learning Causal Biological Networks with Parallel Ant Colony Optimization Algorithm SCIE
期刊论文 | 2023 , 10 (8) | BIOENGINEERING-BASEL
WoS CC Cited Count: 1
Abstract&Keyword Cite

Abstract :

A wealth of causal relationships exists in biological systems, both causal brain networks and causal protein signaling networks are very classical causal biological networks (CBNs). Learning CBNs from biological signal data reliably is a critical problem today. However, most of the existing methods are not excellent enough in terms of accuracy and time performance, and tend to fall into local optima because they do not take full advantage of global information. In this paper, we propose a parallel ant colony optimization algorithm to learn causal biological networks from biological signal data, called PACO. Specifically, PACO first maps the construction of CBNs to ants, then searches for CBNs in parallel by simulating multiple groups of ants foraging, and finally obtains the optimal CBN through pheromone fusion and CBNs fusion between different ant colonies. Extensive experimental results on simulation data sets as well as two real-world data sets, the fMRI signal data set and the Single-cell data set, show that PACO can accurately and efficiently learn CBNs from biological signal data.

Keyword :

causal protein signaling networks causal protein signaling networks CBNs fusion CBNs fusion causal biological networks causal biological networks parallel ant colony optimization parallel ant colony optimization pheromone fusion pheromone fusion causal brain networks causal brain networks

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Zhai, Jihao , Ji, Junzhong , Liu, Jinduo . Learning Causal Biological Networks with Parallel Ant Colony Optimization Algorithm [J]. | BIOENGINEERING-BASEL , 2023 , 10 (8) .
MLA Zhai, Jihao et al. "Learning Causal Biological Networks with Parallel Ant Colony Optimization Algorithm" . | BIOENGINEERING-BASEL 10 . 8 (2023) .
APA Zhai, Jihao , Ji, Junzhong , Liu, Jinduo . Learning Causal Biological Networks with Parallel Ant Colony Optimization Algorithm . | BIOENGINEERING-BASEL , 2023 , 10 (8) .
Export to NoteExpress RIS BibTex
Tri-objective optimization-based cascade ensemble pruning for deep forest SCIE
期刊论文 | 2023 , 143 | PATTERN RECOGNITION
WoS CC Cited Count: 3
Abstract&Keyword Cite

Abstract :

Deep forest is a new multi-layer ensemble model, where the high time costs and storage requirements inhibit its large-scale application. However, current deep forest pruning methods used to alleviate these drawbacks do not consider its cascade coupling characteristics. Therefore, we propose a tri-objective optimization-based cascade ensemble pruning (TOOCEP) algorithm for it. Concretely, we first present a tri-objective optimization-based single-layer pruning (TOOSLP) method to prune its single-layer by simultaneously optimizing three objectives, namely accuracy, independent diversity, and coupled diversity. Particularly, the coupled diversity is designed for deep forest to deal with the coupling relationships between its adjacent layers. Then, we perform TOOSLP in a cascade framework to prune the deep forest layer-by-layer. Experimental results on 15 UCI datasets show that TOOCEP outperforms several state-ofthe-art methods in accuracy and pruned rate, which significantly reduces the storage space and accelerate the prediction speed of deep forest. & COPY; 2023 Elsevier Ltd. All rights reserved.

Keyword :

Deep forest Deep forest Ensemble pruning Ensemble pruning Ensemble learning Ensemble learning Coupled diversity Coupled diversity Multi-objective optimization Multi-objective optimization

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Ji, Junzhong , Li, Junwei . Tri-objective optimization-based cascade ensemble pruning for deep forest [J]. | PATTERN RECOGNITION , 2023 , 143 .
MLA Ji, Junzhong et al. "Tri-objective optimization-based cascade ensemble pruning for deep forest" . | PATTERN RECOGNITION 143 (2023) .
APA Ji, Junzhong , Li, Junwei . Tri-objective optimization-based cascade ensemble pruning for deep forest . | PATTERN RECOGNITION , 2023 , 143 .
Export to NoteExpress RIS BibTex
基于对比学习的卷积神经网络脑功能连接分类方法
会议论文 | 2023 | 2023中国自动化大会
Abstract&Keyword Cite

Abstract :

近年来,基于深度学习的脑功能连接分类方法成为脑科学中的研究热点。为了进一步获得具有判别性的大脑连接特征,进而提升脑功能连接的分类准确率,本文提出了一种基于对比学习的卷积神经网络脑功能连接分类方法。对比学习是一种特殊的自监督学习框架,通过在特征空间中对正样本与负样本进行对比,充分挖掘不同样本间的差异性。首先,提出一种融合多视角信息的对比学习框架,采用实例-实例的对比学习挖掘样本间的差异性,并利用实例-原型的对比学习挖掘样本与样本簇之间的差异性。其次,将多视角对比学习与目标分类任务联合训练,增强所学特征的判别性,提升卷积神经网络的分类性能。本文使用ABIDE-I数据集进行实验,结果表明,所提方法能够使脑功能连接的分类效果得到有效提升,并且能够对重要的功能连接与脑区进行准确识别。

Keyword :

对比学习 对比学习 脑功能连接分类 脑功能连接分类 卷积神经网络 卷积神经网络

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 何庆钊 , 于乐 , 冀俊忠 et al. 基于对比学习的卷积神经网络脑功能连接分类方法 [C] //2023中国自动化大会 . 2023 .
MLA 何庆钊 et al. "基于对比学习的卷积神经网络脑功能连接分类方法" 2023中国自动化大会 . (2023) .
APA 何庆钊 , 于乐 , 冀俊忠 , 雷名龙 . 基于对比学习的卷积神经网络脑功能连接分类方法 2023中国自动化大会 . (2023) .
Export to NoteExpress RIS BibTex
Amortization Transformer for Brain Effective Connectivity Estimation from fMRI Data SCIE
期刊论文 | 2023 , 13 (7) | BRAIN SCIENCES
WoS CC Cited Count: 36
Abstract&Keyword Cite

Abstract :

Using machine learning methods to estimate brain effective connectivity networks from functional magnetic resonance imaging (fMRI) data has garnered significant attention in the fields of neuroinformatics and bioinformatics. However, existing methods usually require retraining the model for each subject, which ignores the knowledge shared across subjects. In this paper, we propose a novel framework for estimating effective connectivity based on an amortization transformer, named AT-EC. In detail, AT-EC first employs an amortization transformer to model the dynamics of fMRI time series and infer brain effective connectivity across different subjects, which can train an amortized model that leverages the shared knowledge from different subjects. Then, an assisted learning mechanism based on functional connectivity is designed to assist the estimation of the brain effective connectivity network. Experimental results on both simulated and real-world data demonstrate the efficacy of our method.

Keyword :

brain effective connectivity brain effective connectivity transformer transformer functional magnetic resonance imaging functional magnetic resonance imaging amortization learning amortization learning

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Zhang, Zuozhen , Zhang, Ziqi , Ji, Junzhong et al. Amortization Transformer for Brain Effective Connectivity Estimation from fMRI Data [J]. | BRAIN SCIENCES , 2023 , 13 (7) .
MLA Zhang, Zuozhen et al. "Amortization Transformer for Brain Effective Connectivity Estimation from fMRI Data" . | BRAIN SCIENCES 13 . 7 (2023) .
APA Zhang, Zuozhen , Zhang, Ziqi , Ji, Junzhong , Liu, Jinduo . Amortization Transformer for Brain Effective Connectivity Estimation from fMRI Data . | BRAIN SCIENCES , 2023 , 13 (7) .
Export to NoteExpress RIS BibTex
Convolutional Neural Network With Sparse Strategies to Classify Dynamic Functional Connectivity SCIE
期刊论文 | 2022 , 26 (3) , 1219-1228 | IEEE JOURNAL OF BIOMEDICAL AND HEALTH INFORMATICS
WoS CC Cited Count: 3
Abstract&Keyword Cite

Abstract :

Classification of dynamic functional connectivity (DFC) is becoming a promising approach for diagnosing various neurodegenerative diseases. However, the existing methods generally face the problem of overfitting. To solve it, this paper proposes a convolutional neural network with three sparse strategies named SCNN to classify DFC. Firstly, an element-wise filter is designed to impose sparse constraints on the DFC matrix by replacing the redundant elements with zeroes, where the DFC matrix is specially constructed to quantify the spatial and temporal variation of DFC. Secondly, a 1x1 convolutional filter is adopted to reduce the dimensionality of the sparse DFC matrix, and remove meaningless features resulted from zero elements in the subsequent convolution process. Finally, an extra sparse optimization classifier is employed to optimize the parameters of the above two filters, which can effectively improve the ability of SCNN to extract discriminative features. Experimental results on multiple resting-state fMRI datasets demonstrate that the proposed model provides a better classification performance of DFC compared with several state-of-the-art methods, and can identify the abnormal brain functional connectivity.

Keyword :

Symmetric matrices Symmetric matrices feature extraction feature extraction Functional magnetic resonance imaging Functional magnetic resonance imaging Convolutional neural network Convolutional neural network resting-state functional Magnetic Resonance Imaging (rs-fMRI) resting-state functional Magnetic Resonance Imaging (rs-fMRI) Windows Windows Feature extraction Feature extraction Diseases Diseases Sparse matrices Sparse matrices Time series analysis Time series analysis sparse strategies sparse strategies dynamic functional connectivity dynamic functional connectivity

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Ji, Junzhong , Chen, Zhihui , Yang, Cuicui . Convolutional Neural Network With Sparse Strategies to Classify Dynamic Functional Connectivity [J]. | IEEE JOURNAL OF BIOMEDICAL AND HEALTH INFORMATICS , 2022 , 26 (3) : 1219-1228 .
MLA Ji, Junzhong et al. "Convolutional Neural Network With Sparse Strategies to Classify Dynamic Functional Connectivity" . | IEEE JOURNAL OF BIOMEDICAL AND HEALTH INFORMATICS 26 . 3 (2022) : 1219-1228 .
APA Ji, Junzhong , Chen, Zhihui , Yang, Cuicui . Convolutional Neural Network With Sparse Strategies to Classify Dynamic Functional Connectivity . | IEEE JOURNAL OF BIOMEDICAL AND HEALTH INFORMATICS , 2022 , 26 (3) , 1219-1228 .
Export to NoteExpress RIS BibTex
A knowledge guided bacterial foraging optimization algorithm for many-objective optimization problems SCIE
期刊论文 | 2022 , 34 (23) , 21275-21299 | NEURAL COMPUTING & APPLICATIONS
WoS CC Cited Count: 2
Abstract&Keyword Cite

Abstract :

Despite that evolutionary and swarm intelligence algorithms have achieved considerable success on multi-objective optimization problems, they face huge challenges when dealing with many-objective optimization problems (MaOPs). There is an urgent call for effective evolutionary and swarm intelligence algorithms for MaOPs. Inspired by the satisfactory performance of bacterial foraging optimization (BFO) on the single-objective optimization problems, this paper extends BFO to deal with MaOPs and proposes a knowledge guided BFO for MaOPs (called as KLBFO). Firstly, KLBFO learns promising direction knowledge based on group decision making idea to guide the population to converge toward proper directions. Secondly, KLBFO learns elite knowledge by a new biological mechanism to accelerate the population to converge. Thirdly, KLBFO learns density knowledge by a new diversity management strategy based on orthogonal grid to produce well-distributed solutions. The performance of KLBFO is comprehensively evaluated by comparing it with eight state-of-the-art algorithms on two suites of test problems and one real-world problem. The empirical results have validated the superior performance of KLBFO for MaOPs.

Keyword :

Elite knowledge Elite knowledge Bacterial foraging optimization Bacterial foraging optimization Orthogonal nearest neighbor Orthogonal nearest neighbor Consensus directions Consensus directions Many-objective optimization problems Many-objective optimization problems

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Yang, Cuicui , Weng, Yannan , Ji, Junzhong et al. A knowledge guided bacterial foraging optimization algorithm for many-objective optimization problems [J]. | NEURAL COMPUTING & APPLICATIONS , 2022 , 34 (23) : 21275-21299 .
MLA Yang, Cuicui et al. "A knowledge guided bacterial foraging optimization algorithm for many-objective optimization problems" . | NEURAL COMPUTING & APPLICATIONS 34 . 23 (2022) : 21275-21299 .
APA Yang, Cuicui , Weng, Yannan , Ji, Junzhong , Wu, Tongxuan . A knowledge guided bacterial foraging optimization algorithm for many-objective optimization problems . | NEURAL COMPUTING & APPLICATIONS , 2022 , 34 (23) , 21275-21299 .
Export to NoteExpress RIS BibTex
10| 20| 50 per page
< Page ,Total 24 >

Export

Results:

Selected

to

Format:
Online/Total:1513/9277683
Address:BJUT Library(100 Pingleyuan,Chaoyang District,Beijing 100124, China Post Code:100124) Contact Us:010-67392185
Copyright:BJUT Library Technical Support:Beijing Aegean Software Co., Ltd.