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

FASTEN: Fuzzy Neural Support Vector Machine for Classification

IEEE Transactions on Fuzzy Systems 2025年

作者： Yuan, Zhian Qian, Yuhua Liang, Xinyan Kou, Yi Hou, Chenping Hu, Qinghua Shanxi University Institute of Big Data Science and Industry Key laboratory of Evolutionary Science Intelligence of Shanxi Province Shanxi Taiyuan030006 China National University of Defense Technology College of Science Hunan Changsha410073 China Tianjin University College of Intelligence and Computing Tianjin Key Laboratory of Machine Learning Tianjin300350 China

Classification tasks have long been a central concern in the field of machine learning. Although deep neural network-based approaches offer a novel, versatile and highly precise solution for classification tasks, the intrinsic ambiguity and uncertainty present in the data continue to pose a significant challenge, impeding the potential for further advancements in classification accuracy. To address this issue, we propose a Fuzzy neurAl SupporT vEctor machiNe (FASTEN) which mitigates the fuzziness and uncertainty inherent in the data and enhances the classification performance. FASTEN mainly consists of two parts: the fuzzy feature extraction unit and the multi-path classifier aggregation unit. The fuzzy feature extraction unit is designed to precisely capture the fuzzy features of the uncertainty data by embedding membership functions and fuzzy rules within the neural network. In this process, fuzzy parameters are dynamically updated on a task-driven basis, ensuring that the model can adaptively handle data with different degrees of fuzziness. The multi-path classifier aggregation unit is designed to integrate the outputs of multiple neural network classifiers through dynamic linear combination. Meanwhile, we introduce the maximum margin theory of support vector machines to optimize the feature representation and improve classification accuracy. Our experimental results show that FASTEN can improve the classification performance on image and signal datasets. Through ablation experiments, the contributions of each unit to performance enhancement have been further validated, thereby establishing a foundation for subsequent model optimization. © 2025 IEEE.

关键词： Membership functions

来源：评论

学校读者我要写书评

暂无评论

NcoVis: A Visual Analysis Framework for Exploring Academic Collaboration Networks under New Collaborative Relationships 25

NcoVis: A Visual Analysis Framework for Exploring Academic C...

引用

25th IEEE International Conference on Computer Supported Cooperative Work in Design, CSCWD 2022

作者： Yu, Ye Wu, Yao Liang, Xi Ma, Cheng Lu, Qiang Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education Hefei China School of Computer Science and Information Hefei University of Technology Hefei China Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei China

ISBN: (纸本)9781665405270

Academic collaboration has become one of the topics of large-scale social network analysis. The information extracted from academic collaboration also shows the contextual value in combination with other data. For academic collaborative social networks with intricate collaborative relationships, previous research methods mainly focused on network structure and community discovery, lacking in mining the characteristics of relationships in collaborative networks. There were some limitations in the research perspective. In this work, we propose a collaborative relationship representation method that is more suitable for academic collaborative social networks. It marks the attribute characteristics of nodes in collaborative relationships and highlights collaborative relationships in visualization. By adopting this new representation of collaborative relationships, we designed a visual analysis framework NcoVis, to visualize academic collaborative social networks. We further visually analyze the link relationship groups guided by nodes, and explore the potential representation of the structure and attribute characteristics of link relationships, so that analysts can explore the theme and structural change characteristics of link relationships, communities and the whole network in collaborative social networks. To prove the proposed framework, we conducted a case study on the academic collaboration literature data set, and analyzed the questionnaire with Likert scale through the user evaluation experiment, which verified the effectiveness of our method and the practicability of NcoVis. © 2022 IEEE.

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

Detent Force Reduction in Permanent Magnet Synchronous Linear Motor Based on Arc-teeth

Detent Force Reduction in Permanent Magnet Synchronous Linea...

引用

Chinese Control and Decision Conference, CCDC

作者： Yuxin Shen Rong Guo Hongyan Ma School of Electrical and Information Engineering Beijing University of Civil Engineering and Architecture Beijing China School of Electrical and Information Engineering Institute of Distributed Energy Storage Safety Big Data Beijing Key Laboratory of Intelligent of Processing for Building Big Data Beijing University of Civil Engineering and Architecture Beijing China

ISBN: (数字)9798350387780

ISBN: (纸本)9798350387797

Permanent Magnet Synchronous Linear Motors (PMSLM) has the advantages of high thrust force density, high acceleration, high speed, high precision, high efficiency etc. However, the detent force of PMSLM is an inevitable problem, caused by their inherent end-disconnection structure. Excessive detent force will cause thrust fluctuations and reduce the system’s stability. To resolve the above problems, an improved PMSLM structure based on arc-teeth is proposed to reduce detent force. Firstly, the motor permeability distribution is analyzed at different moments based on the flux-tube method, and the expression of detent force is derived. Second, the finite element model of PMSLM is established to optimize the height of arc-teeth, and the optimal structural parameters of the motor is obtained. Finally, the performance advantages of the proposed PMSLM are verified by comparing with traditional linear motor.

关键词： Fluctuations Shape Force Stators Motors Harmonic analysis Permanent magnets

来源：评论

学校读者我要写书评

暂无评论

D3still: Decoupled Differential Distillation for Asymmetric Image Retrieval

D3still: Decoupled Differential Distillation for Asymmetric ...

引用

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Yi Xie Yihong Lin Wenjie Cai Xuemiao Xu Huaidong Zhang Yong Du Shengfeng He South China University of Technology Independent Researcher State Key Laboratory of Subtropical Building Science Guangdong Provincial Key Lab of Computational Intelligence and Cyberspace Information Ministry of Education Key Laboratory of Big Data and Intelligent Robot Ocean University of China Singapore Management University

ISBN: (数字)9798350353006

ISBN: (纸本)9798350353013

Existing methods for asymmetric image retrieval employ a rigid pairwise similarity constraint between the query network and the larger gallery network. However, these one-to-one constraint approaches often fail to maintain retrieval order consistency, especially when the query network has limited representational capacity. To overcome this problem, we introduce the Decoupled Differential Distillation (D3still) framework. This framework shifts from absolute one-to-one supervision to optimizing the relational differences in pairwise similarities produced by the query and gallery networks, thereby preserving a consistent retrieval order across both networks. Our method involves computing a pairwise similarity differential matrix within the gallery domain, which is then decomposed into three components: feature representation knowledge, inconsistent pairwise similarity differential knowledge, and consistent pairwise similarity differential knowledge. This strategic decomposition aligns the retrieval ranking of the query network with the gallery network effectively. Extensive experiments on various bench-mark datasets reveal that D3still surpasses state-of-the-art methods in asymmetric image retrieval. Code is available at https://***/SCY-X/D3still.

关键词： Computer vision Codes Accuracy Image retrieval Pattern recognition Matrix decomposition Knowledge transfer

来源：评论

学校读者我要写书评

暂无评论

Research on Optimization Algorithm for Fire Emergency Evacuation in Experimental Buildings of Universities

Research on Optimization Algorithm for Fire Emergency Evacua...

引用

Chinese Control and Decision Conference, CCDC

作者： Xincheng Han Hongyan Ma Wei He Shun Wang School of Electrical and Information Engineering Beijing University of Civil Engineering and Architecture Beijing China School of Electrical and Information Engineering Institute of Distributed Energy Storage Safety Big Data Beijing Key Laboratory of Intelligent Processing for Building Big Data Beijing University of Civil Engineering and Architecture Beijing China

ISBN: (数字)9798350387780

ISBN: (纸本)9798350387797

College laboratory buildings have dense population, numerous electrical devices, and high fire risk. However, the existing evacuation A* algorithm has the disadvantages of long time and poor adaptability. In order to effectively solve the problems of long evacuation simulation time, low efficiency, and inability to change evacuation directions according to fire conditions in college laboratory buildings, this paper proposes an improved A* algorithm. This paper improves the heuristic function in the A* algorithm by introducing a logarithmic decay factor. By changing the weight of the estimated cost, it reduces the number of unnecessary search nodes and steers the search algorithm in the correct direction, thereby improving search efficiency. Secondly, it introduces a bidirectional A* search strategy to reduce search nodes and improve the efficiency of the algorithm. Simulation results show that the improved A* algorithm has fewer traversed nodes, shorter search paths, and higher search efficiency, which verifies the effectiveness and feasibility of the improved A* algorithm in experimental building fire evacuation. This study provides a solution for fire evacuation in college laboratory buildings.

关键词： Heuristic algorithms Simulation Buildings Sociology Laboratories Search problems Path planning

来源：评论

学校读者我要写书评

暂无评论

Environment-aware dynamic graph learning for out-of-distribution generalization 23

Environment-aware dynamic graph learning for out-of-distribu...

引用

Proceedings of the 37th International Conference on Neural Information Processing Systems

作者： Haonan Yuan Qingyun Sun Xingcheng Fu Ziwei Zhang Cheng Ji Hao Peng Jianxin Li Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University and School of Computer Science and Engineering Beihang University Key Lab of Education Blockchain and Intelligent Technology Guangxi Normal University Department of Computer Science and Technology Tsinghua University Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University

Dynamic graph neural networks (DGNNs) are increasingly pervasive in exploiting spatio-temporal patterns on dynamic graphs. However, existing works fail to generalize under distribution shifts, which are common in real-world scenarios. As the generation of dynamic graphs is heavily influenced by latent environments, investigating their impacts on the out-of-distribution (OOD) generalization is critical. However, it remains unexplored with the following two major challenges: (1) How to properly model and infer the complex environments on dynamic graphs with distribution shifts? (2) How to discover invariant patterns given inferred spatio-temporal environments? To solve these challenges, we propose a novel Environment-Aware dynamic Graph LEarning (EAGLE) framework for OOD generalization by modeling complex coupled environments and exploiting spatiotemporal invariant patterns. Specifically, we first design the environment-aware EADGNN to model environments by multi-channel environments disentangling. Then, we propose an environment instantiation mechanism for environment diversification with inferred distributions. Finally, we discriminate spatio-temporal invariant patterns for out-of-distribution prediction by the invariant pattern recognition mechanism and perform fine-grained causal interventions node-wisely with a mixture of instantiated environment samples. Experiments on real-world and synthetic dynamic graph datasets demonstrate the superiority of our method against state-of-the-art baselines under distribution shifts. To the best of our knowledge, we are the first to study OOD generalization on dynamic graphs from the environment learning perspective.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Specific Design and Implementation of the Characteristic Species database in Wuling Mountain Area

Specific Design and Implementation of the Characteristic Spe...

引用

Information Technology, Communication Ecosystem and Management (ITCEM), International Conference on

作者： Shaowei Deng Yujun Yang Yimei Yang College of Computer and Artificial Intelligence(Software College) Huaihua University Huaihua Hunan China Key Laboratory of Wuling-Mountain Health Big Data Intelligent Processing and Application in Hunan Province Universities Huaihua Hunan China Key Laboratory of Intelligent Control Technology for Wuling-Mountain Ecological Agriculture in Hunan Province

ISBN: (数字)9798331542696

ISBN: (纸本)9798331542702

This article aims to design and implement a database system for characteristic species in the Wuling Mountain area. The system will collect, organize, store, and analyze information on characteristic species in the Wuling Mountain area, providing data support for ecological research, biodiversity conservation, agricultural production, and other fields. This article will provide a detailed introduction to database requirements analysis, data model design, database structure implementation, data security management, and system testing and optimization.

关键词： System testing data security Ecosystems Production database systems data models Biodiversity Information technology Optimization

来源：评论

学校读者我要写书评

暂无评论

Automatic Life Event Tree Generation for Older Adults 1

引用

24th International Conference on Human-Computer Interaction, HCII 2022

作者： Gui, Fang Wu, Xi Hu, Min Yang, Jiaoyun School of Computer Science and Information Engineering Hefei University of Technology Hefei China Key Laboratory of Knowledge Engineering with Big Data of Ministry of Education Hefei University of Technology Hefei China National Smart Eldercare International S&T Cooperation Base Hefei University of Technology Hefei China Laboratory of Affective Computing and Advanced Intelligent Machine Hefei University of Technology Hefei China Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei China

ISBN: (数字)9783031179020

ISBN: (纸本)9783031179013

Studies have shown that learning personal stories could help provide individualized eldercare services. However, personal stories are often disordered because of the scattered collection, including informal interviews or daily interactions, which brings difficulties in acquiring valuable information quickly. One solution to this problem is to extract events from personal stories and automatically organize them in chronological order. Events extracted by current methods from social media or news corpus are mainly organized in a linear structure. These works usually focus on the event time and ignore the consistency of event contents when organizing events. This paper aims to organize events into a tree structure based on an event network, with stem nodes representing key event topics and branch nodes representing detailed events. Social workers or caregivers can clarify the life experience of the older adults quickly through the event tree and have a preliminary understanding of them. The experiments show that the event tree generated by our method has a better performance in consistency than current event organization methods. A survey study shows that our method achieves the highest logical coherence for the event tree branches compared with other algorithms. © 2022, Springer Nature Switzerland AG.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Suppress content shift: better diffusion features via off-the-shelf generation techniques 24

Suppress content shift: better diffusion features via off-th...

引用

Proceedings of the 38th International Conference on Neural Information Processing Systems

作者： Benyuan Meng Qianqian Xu Zitai Wang Zhiyong Yang Xiaochun Cao Qingming Huang Institute of Information Engineering CAS and School of Cyber Security University of Chinese Academy of Sciences Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS and Peng Cheng Laboratory Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS School of Computer Science and Tech. University of Chinese Academy of Sciences School of Cyber Science and Tech. Shenzhen Campus of Sun Yat-sen University School of Computer Science and Tech. University of Chinese Academy of Sciences and Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS and Key Laboratory of Big Data Mining and Knowledge Management CAS

ISBN: (纸本)9798331314385

Diffusion models are powerful generative models, and this capability can also be applied to discrimination. The inner activations of a pre-trained diffusion model can serve as features for discriminative tasks, namely, diffusion feature. We discover that diffusion feature has been hindered by a hidden yet universal phenomenon that we call content shift. To be specific, there are content differences between features and the input image, such as the exact shape of a certain object. We locate the cause of content shift as one inherent characteristic of diffusion models, which suggests the broad existence of this phenomenon in diffusion feature. Further empirical study also indicates that its negative impact is not negligible even when content shift is not visually perceivable. Hence, we propose to suppress content shift to enhance the overall quality of diffusion features. Specifically, content shift is related to the information drift during the process of recovering an image from the noisy input, pointing out the possibility of turning off-the-shelf generation techniques into tools for content shift suppression. We further propose a practical guideline named GATE to efficiently evaluate the potential benefit of a technique and provide an implementation of our methodology. Despite the simplicity, the proposed approach has achieved superior results on various tasks and datasets, validating its potential as a generic booster for diffusion features. Our code is available at https://***/Darkbblue/diffusion-content-shift.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SCALABLE ATTRIBUTION OF ADVERSARIAL ATTACKS VIA MULTI-TASK LEARNING

arXiv

引用

arXiv 2023年

作者： Guo, Zhongyi Han, Keji Ge, Yao Ji, Wei Li, Yun Nanjing University of Posts and Telecommunications Nanjing China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

Deep neural networks (DNNs) can be easily fooled by adversarial attacks during inference phase when attackers add imperceptible perturbations to original examples, i.e., adversarial examples. Many works focus on adversarial detection and adversarial training to defend against adversarial attacks. However, few works explore the tool-chains behind adversarial examples, which can help defenders to seize the clues about the originator of the attack, their goals, and provide insight into the most effective defense algorithm against corresponding attacks. With such a gap, it is necessary to develop techniques that can recognize tool-chains that are leveraged to generate the adversarial examples, which is called Adversarial Attribution Problem (AAP). In this paper, AAP is defined as the recognition of three signatures, i.e., attack algorithm, victim model and hyperparameter. Current works transfer AAP into single label classification task and ignore the relationship between these signatures. The former will meet combination explosion problem as the number of signatures is increasing. The latter dictates that we cannot treat AAP simply as a single task problem. We first conduct some experiments to validate the attributability of adversarial examples. Furthermore, we propose a multi-task learning framework named Multi-Task Adversarial Attribution (MTAA) to recognize the three signatures simultaneously. MTAA contains perturbation extraction module, adversarial-only extraction module and classification and regression module. It takes the relationship between attack algorithm and corresponding hyperparameter into account and uses the uncertainty weighted loss to adjust the weights of three recognition tasks. The experimental results on MNIST and ImageNet show the feasibility and scalability of the proposed framework as well as its effectiveness in dealing with false alarms. Copyright © 2023, The Authors. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：