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

A dynamic multi-objective evolutionary algorithm based on Niche prediction strategy

Applied Soft Computing 2023年 142卷

作者： Zheng, Jinhua Zhang, Bo Zou, Juan Yang, Shengxiang Hu, Yaru Hunan Engineering Research Center of Intelligent System Optimization and Security Xiangtan University Hunan Province Xiangtan411105 China Key Laboratory of Intelligent Computing and Information Processing Ministry of Education of China Xiangtan University Hunan Province Xiangtan411105 China Key Laboratory of Hunan Province for Internet of Things and Information Security Xiangtan University Hunan Province Xiangtan411105 China School of Computer Science and Informatics De Montfort University LeicesterLE1 9BH United Kingdom

In reality, many multi-objective optimization problems are dynamic. The Pareto optimal front (PF) or Pareto optimal solution (PS) of these dynamic multi-objective problems (DMOPs) changes as the environment change. Therefore, solving such problems requires an optimization algorithm that can quickly track the PF or PS after an environment change. Prediction-based response mechanism is a common method used to deal with environmental changes, which is commonly known as center point-based prediction. However, if the predicted direction of the center point is inaccurate, the predicted population will be biased towards one side. In this paper, we propose a niche prediction strategy based on center and boundary points (PCPB) to solve the dynamic multi-objective optimization problems, which consists of three steps. After environmental changes are detected, the first step is to divide the niche, dividing different individuals in the PS into different niche populations. The second step is to independently predict different niches, and select individuals with good convergence and distribution in the niche to predict the individuals that will produce the next generation. Finally, some different individuals are randomly generated in the next possible PS area to ensure the diversity of the population. To verify whether our proposed strategy is effective and competitive, PCPB was compared with five state-of-the-art strategies. The experimental results show that PCPB performed competitively in solving dynamic multi-objective optimization problems, which proves that our algorithm has good competitiveness. © 2023 Elsevier B.V.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Air Pollution Monitoring By Integrating Local and Global Information in Self-Adaptive Multiscale Transform Domain

引用

IEEE Transactions on Multimedia 2025年

作者： Gu, Ke Liu, Yuchen Liu, Hongyan Liu, Bo Qiao, Junfei Lin, Weisi Zhang, Wenjun Beijing University of Technology School of Information Science and Technology Engineering Research Center of Intelligent Perception and Autonomous Control of Ministry of Education Beijing Laboratory of Smart Environmental Protection Beijing Key Laboratory of Computational Intelligence and Intelligent System Beijing Artificial Intelligence Institute Beijing100124 China Massey University School of Mathematical and Computational Sciences New Zealand Nanyang Technological University College of Computing and Data Science Singapore Shanghai Jiao Tong University Institute of Image Communication and Information Processing Shanghai China

As the deadliest form of pollution, air pollution had a prolonged severe damage to the human health and life safety of nearly 99% of the world's population. Facing to the problem that billions of tons of pollutants discharged into the air per year by industrial activities, this paper proposed a novel image-based air pollution monitor (IAPM) by incorporating local and global information in the self-adaptive multiscale transform domain, so as to achieve the timely and effective leakage detection of typical air pollutants from a single image. To be specific, this paper first developed a screen-shaped module according to two significant findings in visual neuroscience, which include the high sensitivity of human eyes to horizontal and vertical stimuli and the center-surround inhibition, by designing and fusing the square module, horizontal strip module and vertical strip module parallelly for simulating the behaviour of human eyes to extract local features. Second, the learnable weights and proportional mapping were applied to incorporate the screen-shaped module and lightweight vision transformer as backbone, towards more richly exploiting and fusing local and global information just as the way a brain perceives external stimuli. Third, a new self-adaptive multiscale transform domain method was devised based on two motivations from the visual characteristics of multiscale perception and the brain characteristics of self-adaptive domain transform to modify the backbone by using the operations of pooling and pointwise convolution. Extensive experiments implemented on the datasets of carbon particulate matters and ethylene leakage confirmed the superior monitoring performance of the proposed IAPM model beyond the state-of-the-art (SOTA) peers by an accuracy gain of about 4%. Furthermore, the proposed IAPM model only required 0.089 GFLOPs and 0.15 million model parameters, remarkably outperforming SOTA competitors in computational efficiency and storage resources. © 1999-2

关键词： Information leakage

来源：评论

学校读者我要写书评

暂无评论

Emotion Recognition Empowered Human-Computer Interaction with Domain Adaptation Network

引用

IEEE Transactions on Consumer Electronics 2024年

作者： Xu, Xu Fu, Chong Chen, Junxin Northeastern University School of Computer Science and Engineering Shenyang110004 China Dalian University of Technology China The School of Software Dalian116621 China Northeastern University School of Computer Science and Engineering Shenyang110004 China Northeastern University Key Laboratory of Intelligent Computing in Medical Image Ministry of Education Shenyang110819 China Ministry of Education Engineering Research Center of Security Technology of Complex Network System Shenyang110004 China Dalian University of Technology School of Software Dalian116621 China

Multi-modal emotion recognition plays a vital role in the human-computer interaction (HCI) for consumer electronics. Nowadays, many studies have developed multi-modal fusion algorithms for this ***, two challenging issues remain unsolved, i.e., inefficient multi-modal feature fusion and unclear distance in feature *** this end, we develop a novel framework, namely LAFDA-Net, for cross-subject emotion recognition using EEG and eye movement *** is based on low-rank fusion and domain adaptation *** specifically, the multi-modal signals are input into the feature extraction branch in parallel to generate ***, these features are fused by the low-rank fusion branch, reducing complexity and avoiding ***, the fused features are flattened and sent to the classification branch to determine the emotion *** training, these features are input into the domain adaptive branch to bridge the gap between the source domain and target *** benchmark datasets, i.e., SEED, SEED-IV, and SEED-V, are employed for performance *** results demonstrate that the proposed LAFDA-Net is robust, effective, and has advantages over peer methods. © 1975-2011 IEEE.

关键词： Emotion Recognition

来源：评论

学校读者我要写书评

暂无评论

Multi-Label Text Classification for Judicial Texts via Dual Graph and Label Feature Fusion

Multi-Label Text Classification for Judicial Texts via Dual ...

引用

Smart World Congress (SWC), IEEE

作者： Qiliang Gu Qin Lu Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9798331520861

ISBN: (纸本)9798331520878

The legal judgement prediction (LJP) of judicial texts represents a multi-label text classification (MLTC) problem, which in turn involves three distinct tasks: the prediction of charges, legal articles, and terms of penalty. Nevertheless, extant multi-label text classification models tend to eschew the consideration of multiple correlations and semantic information between labels when predicting judicial texts, which may result in the loss of pertinent information. Furthermore, these models do not take full advantage of the local and overall information of the labels in the process of selecting appropriate labels for the text using the multi-head attention mechanism. To address these issues, we propose a new model, BGFLFF, which explores label correlation and semantics among the three tasks by employing Graph Convolutional Network (GCN) and multi-head attention mechanisms. In particular, we propose a Bi-Graph Fusion GCN (BGF-GCN), which fuses the co-occurrence matrix of labels with the cosine similarity matrix, thereby fully exploiting the multiple correlations between labels. Furthermore, prior to embedding the tags, the interpretations of the labels are obtained via Google in order to enhance the semantic information between the labels. To further reinforce the interconnections between labels and text and more effectively comprehend the interrelationships between the three tasks, we propose a Multi-Head Label Feature Fusion Attentional Mechanism (MH-LFFAtt), which assigns distinct weights to the pertinent label information in the text by fusing the local and overall features of the labels. The experimental results demonstrate that the F1 score exhibits an improvement of up to ${2. 2 8 \%}$ and a minimum of ${1. 2 9 \%}$ across the various tasks of the two datasets. This evidence substantiates the assertion that BGFLFF outperforms the existing baseline model.

关键词： Attention mechanisms Correlation Law Graph convolutional networks Fuses Text categorization Semantics Predictive models Multitasking Internet

来源：评论

学校读者我要写书评

暂无评论

Research on security Assessment of intelligent Electronic Devices in Smart Grids Considering Cyber-Attacks and Physical Faults

SSRN

引用

SSRN 2023年

作者： Chen, Yang-Rong Li, Jun-E Xia, Yu Zhang, Rui-Wen Li, Ling-Ling Li, Xiao-Yu Ge, Lin School of Intelligent Engineering Zhengzhou University of Aeronautics Zhengzhou450046 China Henan Data Security Engineering Technology Research Center Zhengzhou450046 China Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Cyber Science and Engineering Wuhan University Wuhan430072 China Zhengzhou University of Aeronautics China

The smart grid contains lots of intelligent electronic devices (IEDs). IEDs are considered high-priority targets of cyber-attacks. Assessing the security of IEDs effectively can help operators take timely measures to improve the ability of the smart grid (SG) to resist cyber-attacks. Therefore, it is a new challenge how to evaluate the security of IEDs to support the decision-making of grid control policies in the condition of cyber-attacks probably occurring. However, there is a lack of research on the security assessment of IEDs considering cyber-attacks. Hence, this paper takes cyber-attacks and physical faults into consideration, and presents security assessment indicators and assessment methods for IEDs. Firstly, the security monitoring technology of IEDs is presented from the perspective of data sources required for the security assessment of IEDs. The classification of IEDs is carried out, and the security monitoring index system considering the running states of IEDs, network traffic, and abnormal behaviours is presented. Then, the quantitative methods of various security monitoring indicators are expounded. Furthermore, a security assessment method (i.e., GRCW-hybrid method) for IEDs based on grey relational analysis (GRA) and combination weight method (CWM) is proposed. Finally, to verify the effectiveness of the proposed index system and assessment method, 15 indicator exception scenarios, which are established based on monitoring indicators and the actual situation of IEDs, are evaluated. © 2023, The Authors. All rights reserved.

关键词： Smart power grids

来源：评论

学校读者我要写书评

暂无评论

Online Discriminative Semantic-Preserving Hashing for Large-Scale Cross-Modal Retrieval 18th

Online Discriminative Semantic-Preserving Hashing for Large-...

引用

18th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2021

作者： Yi, Jinhan He, Yi Liu, Xin Department of Computer Science and Technology Huaqiao University Xiamen361021 China Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education Nanjing University of Science and Technology Nanjing210094 China Xiamen Key Laboratory of Computer Vision and Pattern Recognition Xiamen China Fujian Key Laboratory of Big Data Intelligence and Security Xiamen China

ISBN: (纸本)9783030891879

Cross-modal hashing has drawn increasing attentions for efficient retrieval across different modalities, and existing methods primarily learn the hash functions in a batch based mode, i.e., offline methods. Nevertheless, the multimedia data often comes in a streaming fashion, which makes the batch based learning methods uncompetitive for large-scale streaming data due to the large memory consumption and calculation. To address this problem, we present an Online Discriminative Semantic-Preserving Hashing (ODSPH) method for large-scale cross-modal retrieval, featuring on fast training speed, low memory consumption and high retrieval accuracy. Within the proposed ODSPH framework, we utilize the newly coming data points to learn the hash codes and update hash functions in a stream manner. When new data comes, the corresponding hash codes are obtained by regressing the class label of the training examples. For hash function, we update it with the accumulated information from each round. Besides, we design a novel momentum updating method to adaptively update the hash function and reduce quantization loss, which can produce discriminative hash codes for high retrieval precision. Extensive experiments on three benchmark datasets show that the proposed ODSPH method improves the retrieval performance over the state-of-the-arts. © 2021, Springer Nature Switzerland AG.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Gnn-Mgrpool: Enhanced Graph Neural Networks with Multi-Granularity Pooling for Graph Classification

SSRN

引用

SSRN 2023年

作者： Sun, Haichao Wang, Guoyin Liu, Qun Guo, Yike Chongqing Key Laboratory of Computational Intelligence Chongqing University of Posts and Telecommunications Chongqing400065 China Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and Telecommunications Chongqing400065 China Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education Chongqing University of Posts and Telecommunications Chongqing400065 China Department of Computer Science and Engineering The Hong Kong University of Science and Technology 999077 Hong Kong School of Computer Engineering and Science Shanghai University Shanghai200444 China

Graph neural networks (GNNs) have gained significant attention and have been applied in various domain tasks. Currently, numerous pooling approaches have been proposed to aggregate node features and obtain node embeddings. However, current GNNs are almost black-box models that typically use a flat or single pooling step to aggregate nodes by only considering the similarity between nodes within the cluster. These approaches ignore the influence of relationships within and between clusters. To address this issue, we propose a novel multi-granular pooling method to aggregate nodes by simultaneously considering density and relationships among nodes and clusters. This method allows to obtain multi-granular node embedding clusters. The clusters in the current layer are built upon the previous layer, and these clusters change from fine to coarse as the number of clusters decreases, which is achieved by using multi-granular pooling (MgrPool for short). Additionally, the node representation of each layer is established through the ratio of node distance within clusters to that of between clusters. Finally, we conduct several experiments on node and graph classification tasks by this pooling approach. The results demonstrate that our GNN-MgrPool model outperforms the state-of-the-art similar algorithms and largely improves the interpretability of the learning process. © 2023, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Generalized Category Discovery with Large Language Models in the Loop

arXiv

引用

arXiv 2023年

作者： An, Wenbin Shi, Wenkai Tian, Feng Lin, Haonan Wang, QianYing Wu, Yaqiang Cai, Mingxiang Wang, Luyan Chen, Yan Zhu, Haiping Chen, Ping School of Automation Science and Engineering Xi’an Jiaotong University China School of Computer Science and Technology Xi’an Jiaotong University China Ministry of Education Key Laboratory of Intelligent Networks and Network Security China Shaanxi Province Key Laboratory of Big Data Knowledge Engineering China Lenovo Research China University of Massachusetts Boston United States

Generalized Category Discovery (GCD) is a crucial task that aims to recognize both known and novel categories from a set of unlabeled data by utilizing a few labeled data with only known categories. Due to the lack of supervision and category information, current methods usually perform poorly on novel categories and struggle to reveal semantic meanings of the discovered clusters, which limits their applications in the real world. To mitigate the above issues, we propose Loop, an end-to-end active-learning framework that introduces Large Language Models (LLMs) 1 into the training loop, which can boost model performance and generate category names without relying on any human efforts. Specifically, we first propose Local Inconsistent Sampling (LIS) to select samples that have a higher probability of falling to wrong clusters, based on neighborhood prediction consistency and entropy of cluster assignment probabilities. Then we propose a Scalable Query strategy to allow LLMs to choose true neighbors of the selected samples from multiple candidate samples. Based on the feedback from LLMs, we perform Refined Neighborhood Contrastive Learning (RNCL) to pull samples and their neighbors closer to learn clustering-friendly representations. Finally, we select representative samples from clusters corresponding to novel categories to allow LLMs to generate category names for them. Extensive experiments on three benchmark datasets show that Loop outperforms SOTA models by a large margin and generates accurate category names for the discovered clusters. Code and data are available at https://***/Lackel/LOOP. Copyright © 2023, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Towards Few-shot Inductive Link Prediction on Knowledge Graphs: A Relational Anonymous Walk-guided Neural Process Approach

arXiv

引用

arXiv 2023年

作者： Zhao, Zicheng Luo, Linhao Pan, Shirui Nguyen, Quoc Viet Hung Gong, Chen School of Computer Science and Engineering Nanjing University of Science and Technology China Jiangsu Key Laboratory of Image and Video Understanding for Social Security China Department of Data Science and AI Monash University Australia School of Information and Communication Technology Griffith University Australia Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education

Few-shot inductive link prediction on knowledge graphs (KGs) aims to predict missing links for unseen entities with few-shot links observed. Previous methods are limited to transductive scenarios, where entities exist in the knowledge graphs, so they are unable to handle unseen entities. Therefore, recent inductive methods utilize the sub-graphs around unseen entities to obtain the semantics and predict links inductively. However, in the few-shot setting, the sub-graphs are often sparse and cannot provide meaningful inductive patterns. In this paper, we propose a novel relational anonymous walk-guided neural process for few-shot inductive link prediction on knowledge graphs, denoted as RawNP. Specifically, we develop a neural process-based method to model a flexible distribution over link prediction functions. This enables the model to quickly adapt to new entities and estimate the uncertainty when making predictions. To capture general inductive patterns, we present a relational anonymous walk to extract a series of relational motifs from few-shot observations. These motifs reveal the distinctive semantic patterns on KGs that support inductive predictions. Extensive experiments on typical benchmark datasets demonstrate that our model derives new state-of-the-art performance. Copyright © 2023, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Stable and Feature Decoupled of Deep Mutual Information Maximization Based on Wasserstein Distance

SSRN

引用

SSRN 2023年

作者： He, Xing Peng, Changgen Wang, Lin Tan, Weijie State Key Laboratory of Public Big Data College of Computer Science and Technology Guizhou University PR Guiyang550025 China Guizhou Key Laboratory of Pattern Recognition and Intelligent System Guizhou Minzu University PR Guiyang550025 China Guizhou Big Data Academy Guizhou University PR Guiyang550025 China Key Laboratory of Advanced Manufacturing Technology Ministry of Education Guizhou University PR Guiyang550025 China

Deep learning techniques usually require large amounts of expensive labeled data to train networks, and the extracted deep representations are usually mixed with multiple attributes having uninterpretability, which limits the application and development of deep learning techniques. Therefore, it is crucial to investigate the stability of training models by unsupervised learning methods and to learn feature decoupled representations. Although the method based on depth mutual information maximization(Deep InfoMax or DIM) has achieved good results in the field of computer vision, it is extremely prone to "gradient explosion" or "gradient disappearance", which makes the training model unstable. At the same time, it is difficult to decouple the features learned by the encoder. In order to solve these problems, we stable and feature decoupled of deep mutual information maximization based on Wasserstein distance, which we call the method called WDIM. The method first addresses the instability of the model trained by the DIM method and proposes to measure the distance between the encoder output and the prior distribution based on the Wasserstein distance, which is a good guide to the stability of the model training. Second, to address the problem that the features learned by the encoder are difficult to be decoupled, the mutual information between the features learned by the hidden layer of the encoder and the intermediate layer is required to be minimized during the training of the encoder so that the features learned by each filter are as uncorrelated as possible to achieve feature decoupling. Finally, the WDIM method is validated on the CIFAR-10, CIFAR-100, STL-10, and FashionMNIST datasets. Experiments show that our proposed WDIM method is more stable for model training, faster model convergence, and more significant feature decoupling. © 2023, The Authors. All rights reserved.

关键词： Network coding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：