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

Online Streaming Feature Selection Using Bidirectional Complementarity based on Fuzzy Gini Entropy

IEEE Transactions on Fuzzy Systems 2025年第5期33卷 1592-1604页

作者： Zhang, Chucai Lu, Zhengxiang Zhang, Yongkang Dai, Jianhua College of Information Science and Engineering Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing China Hunan Normal University Key Laboratory of Computing and Stochastic Mathematics Ministry of Education School of Mathematics and Statistics Changsha410081 China

Online streaming feature selection has garnered widespread attention due to its efficiency and adaptability in dynamic data environments. However, existing methods primarily focus on the correlation and redundancy among features, often overlooking the complementarity between candidate and selected features. In this paper, we address this gap by introducing three key innovations. First, we construct a novel metric, fuzzy Gini entropy (FGE), to measure feature uncertainty within datasets. Unlike traditional information entropy, fuzzy Gini entropy inherits the advantages of the Gini index, effectively measuring the impurity of datasets, while also being capable of handling common fuzzy environments. Accordingly, related metrics such as fuzzy joint Gini entropy, fuzzy conditional Gini entropy, and fuzzy mutual Gini information are developed. Second, we innovatively propose the concept of the bidirectional complementarity ratio (BCR), which captures the relationship between candidate features and previously selected features in online streaming feature selection. This mitigates the unfairness associated with the late arrival of features, ensuring that candidate features with a bidirectional complementary effect that outweighs their redundancy effect with the selected features are chosen. Third, we design an online streaming feature selection method named FGE-OSFS. The method evaluates streaming features through three steps: online relevance analysis, online bidirectional complementarity analysis, and online redundancy analysis. Finally, we compare the proposed method with five state-of-the-art online streaming feature selection methods, demonstrating the effectiveness of our new approach. © 1993-2012 IEEE.

关键词： Redundancy

来源：评论

学校读者我要写书评

暂无评论

Multimodal Cross-Attention Mechanism-Based Algorithm for Elderly Behavior Monitoring and Recognition

引用

Chinese Journal of Electronics 2025年第1期34卷 309-321页

作者： Hao Liu Zhiquan Feng Qingbei Guo School of Information Science and Engineering Unicersity of Jinan Shandong Provincial Key Laboratory of Network Based Intelligent Computing Unicersity of Jinan

In contrast to the general population, behavior recognition among the elderly poses increased specificity and difficulty, rendering the reliability and usability aspects of safety monitoring systems for the elderly more challenging. Hence, this study proposes a multi-modal perception-based solution for an elderly safety monitoring recognition system. The proposed approach introduces a recognition algorithm based on multi-modal cross-attention mechanism, innovatively incorporating complex information such as scene context and voice to achieve more accurate behavior recognition. By fusing four modalities, namely image, skeleton, sensor data, and audio, we further enhance the accuracy of recognition. Additionally, we introduce a novel human-robot interaction mode, where the system associates directly recognized intentions with robotic actions without explicit commands, delivering a more natural and efficient elderly assistance paradigm. This mode not only elevates the level of safety monitoring for the elderly but also facilitates a more natural and efficient caregiving approach. Experimental results demonstrate significant improvement in recognition accuracy for 11 typical elderly behaviors compared to existing methods.

关键词： Privacy Accuracy Image recognition Speech recognition Robot sensing systems Skeleton Safety Reliability Older adults Monitoring

来源：评论

学校读者我要写书评

暂无评论

Enhancing Graph Structure Learning Via Motif-Driven Hypergraph Construction

引用

IEEE Transactions on Network Science and Engineering 2025年第3期12卷 2333-2344页

作者： Zhao, Jia-Le Zhang, Xian-Jie Ding, Xiao Zhang, Xingyi Zhang, Hai-Feng Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Mathematical Science Hefei230601 China Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Hefei230601 China

Graph neural networks (GNNs), as a cutting-edge technology in deep learning, perform particularly well in various tasks that process graph structure data. However, their foundation on pairwise graphs often limits their capacity to capture latent higher-order topological semantic information. Thus, it is crucial to find a way to extract the latent higher-order information of graphs without missing the lower-order information of the original graph. To address this issue, we here develop a method to construct hypergraph based on motifs, and then a novel neural network framework, named MD-HGNN, is proposed for enhanced graph learning. Specifically, we first utilize motifs of the original graph to construct the hypergraph and eliminate nested structures within the hypergraph to prevent information redundancy. Subsequently, GNNs and hypergraph neural networks (HGNNs) are employed separately to extract the lower-order and higher-order topological semantic information of the graph. Finally, the lower-order and higher-order information are integrated to obtain an embedded representation of graph. Extensive experimental results demonstrate that MD-HGNN preserves the original lower-order graph structure information while effectively extracting higher-order features. Moreover, its performance and robustness are validated across different downstream tasks. © 2025 IEEE. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

RECONSTRUCTION-BASED A POSTERIORI ERROR ESTIMATES FOR THE L1 METHOD FOR TIME FRACTIONAL PARABOLIC PROBLEMS

引用

Journal of Computational Mathematics 2025年第2期43卷 345-368页

作者： Jiliang Cao Aiguo Xiao Wansheng Wang Department of Mathematics Shanghai Normal UniversityShanghai 200234China Hunan Key Laboratory for Computation and Simulation in Science and Engineering&Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan UniversityXiangtan 411105China

In this paper,we study a posteriori error estimates of the L1 scheme for time discretizations of time fractional parabolic differential equations,whose solutions have generally the initial *** derive optimal order a posteriori error estimates,the quadratic reconstruction for the L1 method and the necessary fractional integral reconstruction for the first-step integration are *** using these continuous,piecewise time reconstructions,the upper and lower error bounds depending only on the discretization parameters and the data of the problems are *** numerical experiments for the one-dimensional linear fractional parabolic equations with smooth or nonsmooth exact solution are used to verify and complement our theoretical results,with the convergence ofαorder for the nonsmooth case on a uniform *** recover the optimal convergence order 2-αon a nonuniform mesh,we further develop a time adaptive algorithm by means of barrier function recently *** numerical implementations are performed on nonsmooth case again and verify that the true error and a posteriori error can achieve the optimal convergence order in adaptive mesh.

关键词： Time fractional parabolic differential equations A posteriori error estimates Ll method Fractional integral reconstruction Quadratic reconstruction

来源：评论

学校读者我要写书评

暂无评论

Distributed optimal consensus control for multiagent systems based on event-triggered and prioritized experience replay strategies

引用

Science China(information Sciences) 2025年第1期68卷 306-321页

作者： Cuijuan ZHANG Lianghao JI Shasha YANG Xing GUO Huaqing LI Chongqing Key Laboratory of Image Cognition Chongqing University of Posts and Telecommunications Key Laboratory of Intelligent Perception and Computing of Anhui Province Anqing Normal University College of Electronic and Information Engineering Southwest University

This study uses event-triggered(ET) and reinforcement learning methods to investigate the optimal consensus control problem for cooperative-competitive multiagent systems. It proposes a novel distributed ET control strategy, which relies on a prioritized experience replay(PER) policy. This strategy not only conserves communication resources but also ensures acceptable system performance. To implement the proposed method, actor-critic(AC) dual-structured neural networks(NNs) are used to approximate the value function and control policy. In the AC NNs, the weight estimates for the NNs are updated at the moment of event triggering, resulting in a nonperiodic weight adjustment pattern. This approach decreases the computational cost in comparison with the traditional ET mechanism. The PER-based ET mechanism makes full use of valid historical data and effectively establishes a balance between system performance and communication resource ***, it does not require the following two conditions in most existing studies:(1) requirement of the system dynamics model to be known, and(2) persistent excitation. In addition, Zeno behavior is excluded from this study. Finally, a simulation is conducted to confirm the validity of the suggested approach.

关键词： multiagent systems event-triggered mechanism prioritized experience replay dual-structured neural networks optimal consensus control

来源：评论

学校读者我要写书评

暂无评论

JDC-GCN: joint diversity and consistency graph convolutional network

引用

Neural computing and Applications 2025年 1-17页

作者： Lin, Renjie Yao, Jie Wang, Shiping Guo, Wenzhong College of Computer and Data Science Fuzhou University Fuzhou350116 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China

In real-world scenarios, multi-view data comprises heterogeneous features, with each feature corresponding to a specific view. The objective of multi-view semi-supervised classification is to enhance classification performance by leveraging the inherent complementary and consistent information present within diverse views. Nevertheless, many existing frameworks primarily focus on assigning suitable weights to different views while neglecting the importance of consistent information. In this paper, a multi-view semi-supervised classification framework called joint diversity and consistency graph convolutional network (JDC-GCN) is proposed. Firstly, the structure of graph convolutional network is introduced to the multi-view semi-supervised classification, capable of propagating the label information over the topological structure of multi-view data. Secondly, the proposed JDC-GCN captures the complementary and consistent information from multiple views through two indispensable sub-modules, Diversity-GCN and Consistency-GCN, respectively. Finally, the attention mechanism is leveraged to dynamically adjust the weights of various views, allowing us to measure the significance of heterogeneous features and the consistent graph without introducing additional parameters. Comprehensive experiments on eight multi-view datasets are conducted to validate the effectiveness of the JDC-GCN algorithm. The results show that the proposed method exhibits superior classification performance compared to other state-of-the-art methods. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2025.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

PRPFD: Polynomial Resampling Particle Filter Based Deconvolution Approach for Resting-State BOLD-fMRI Data Analysis 24

PRPFD: Polynomial Resampling Particle Filter Based Deconvolu...

引用

5th International Symposium on Artificial Intelligence for Medicine Science, ISAIMS 2024

作者： Luo, Yunying Zeng, Weiming Key Laboratory for Digital Imaging Processing and Intelligent Computing School of Information Engineering Shanghai Maritime University Shanghai China

ISBN: (纸本)9798400717826

Functional Magnetic Resonance Imaging (fMRI) stands out in brain science research due to its non-invasive, non-intrusive, radiation-free, high spatial resolution, and precise localization advantages. However, the BOLD-fMRI signals it generates exhibit a several-second delay compared to neural activity, making it unable to reflect brain neural activity directly. This discrepancy may lead to differences from the actual situation. Therefore, this study aims to enhance the deconvolution of fMRI by refining existing methods to reconstruct the brain’s neural signals more faithfully. Building upon the foundation of particle filtering deconvolution, this paper introduced a novel approach to deconvolving resting-state fMRI data: the polynomial resampling particle filtering deconvolution (PRPFD). They adapted the particle distribution better to match the actual state through weight computation and resampling. We performed a simulation-based experiment to validate the feasibility of our approach. Besides, we validated the performance of our method using group data, focusing on both effective connectivity and functional connectivity, providing strong evidence for the usability and stability of our approach, and compared our method with other deconvolution techniques, demonstrating improvements in accuracy and computational efficiency. © 2024 Copyright held by the owner/author(s).

关键词： Polynomials

来源：评论

学校读者我要写书评

暂无评论

An Improved Compressive Sensing-Based Model for Efficient Analysis of Monostatic Electromagnetic Scattering Problems

引用

IEEE Microwave and Wireless Technology Letters 2025年第4期35卷 388-391页

作者： Qi, Qi Fan, Yunuo Cao, Xinyuan Liu, Yi Kong, Meng Huang, Zhixiang Wu, Xianliang Hefei Normal University Anhui Province Key Laboratory of Simulation Calculation and Design for Electronic Information System Hefei230601 China Anhui University Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Hefei230601 China

To further accelerate the analysis of monostatic electromagnetic (EM) scattering problems of objects, an improved compressive sensing (CS)-based model is proposed. First, an orthogonal subspace spanned by the wide-angle induced currents is identified by means of the wide-angle incident sources. Then, the sparse transform of the induced currents is replaced by the subspace projection. In addition, an optimal number of measurements is determined, only slightly larger than the dimension of the subspace. Finally, the recovery algorithm is simplified to the least-squares method to solve the resulting overdetermined system. Compared with the traditional CS-based model, the proposed model significantly improves the efficiency of the recovery step and optimizes both the requirement for and the way of determining the number of measurements. © 2023 IEEE.

关键词： Least squares approximations

来源：评论

学校读者我要写书评

暂无评论

Efficient Algorithms for Minimizing the Kirchhoff Index via Adding Edges

引用

IEEE Transactions on Knowledge and Data Engineering 2025年第6期37卷 3342-3355页

作者： Zhou, Xiaotian Zehmakan, Ahad N. Zhang, Zhongzhi Shanghai Key Laboratory of Intelligent Information Processing School of Computer Science Fudan University Shanghai200433 China Institute of Intelligent Complex Systems Fudan University Shanghai200433 China School of Computing Australian National University Canberra Australia

The Kirchhoff index, which is the sum of the resistance distance between every pair of nodes in a network, is a key metric for gauging network performance, where lower values signify enhanced performance. In this paper, we study the problem of minimizing the Kirchhoff index by adding edges. We first provide a greedy algorithm for solving this problem and give an analysis of its quality based on the bounds of the submodularity ratio and the curvature. Then, we introduce a gradient-based greedy algorithm as a new paradigm to solve this problem. To accelerate the computation cost, we leverage geometric properties, convex hull approximation, and approximation of the projected coordinate of each point. To further improve this algorithm, we use pre-pruning and fast update techniques, rending its especially apt for large-scale networks. Our proposed algorithms have nearly-linear time complexity. We provide extensive experiments on ten real networks to evaluate the quality of our algorithms. The results demonstrate that our proposed algorithms outperform the state-of-the-art methods in terms of efficiency and effectiveness. Moreover, our algorithms are scalable to large graphs with over 5 million nodes and 12 million edges. © 2025 IEEE Computer Society. All rights reserved.

关键词： Graph algorithms

来源：评论

学校读者我要写书评

暂无评论

HRAM-VITON: High-Resolution Virtual Try-On with Attention Mechanism

引用

Computers, Materials & Continua 2025年第2期82卷 2753-2768页

作者： Yue Chen Xiaoman Liang Mugang Lin Fachao Zhang Huihuang Zhao College of Computer Science and Technology Hengyang Normal UniversityHengyang421002China Hunan Provincial Key Laboratory of Intelligent Information Processing and Application Hengyang421002China

The objective of image-based virtual try-on is to seamlessly integrate clothing onto a target image, generating a realistic representation of the character in the specified attire. However, existing virtual try-on methods frequently encounter challenges, including misalignment between the body and clothing, noticeable artifacts, and the loss of intricate garment details. To overcome these challenges, we introduce a two-stage high-resolution virtual try-on framework that integrates an attention mechanism, comprising a garment warping stage and an image generation stage. During the garment warping stage, we incorporate a channel attention mechanism to effectively retain the critical features of the garment, addressing challenges such as the loss of patterns, colors, and other essential details commonly observed in virtual try-on images produced by existing methods. During the image generation stage, with the aim of maximizing the utilization of the information proffered by the input image, the input features undergo double sampling within the normalization procedure, thereby enhancing the detail fidelity and clothing alignment efficacy of the output image. Experimental evaluations conducted on high-resolution datasets validate the effectiveness of the proposed method. Results demonstrate significant improvements in preserving garment details, reducing artifacts, and achieving superior alignment between the clothing and body compared to baseline methods, establishing its advantage in generating realistic and high-quality virtual try-on images.

关键词： Virtual try-on attention mechanism high-resolution image generation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：