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

4th International Conference on Computer Vision, Application, and Algorithm, CVAA 2024

作者： Xu, Xiaoxiang Li, Fanzhang Zhang, Li School of Computer Science and Technology Joint International Research Laboratory of Machine Learning and Neuromorphic Computing Provincial Key Laboratory for Computer Information Processing Technology Soochow University Suzhou China

ISBN: (纸本)9781510687615

For a long time, people have believed that representation problems are one of the bottlenecks in the field of machine learning. Therefore, it is a long-term and exploratory work to study machine learning representation methods. Due to this, we use category theory to study the fusion representation of data dimensionality reduction. We propose the basic concept of category representation for data dimensionality reduction and provide a data dimensionality reduction fusion representation framework. We have conducted research and analysis on algorithms such as PCA, KPCA, and LDA, identified the essential connection between PCA, KPCA, and LDA and proposed a data dimensionality reduction fusion representation algorithm based on a data dimensionality reduction fusion representation framework. Finally, we demonstrated the feasibility of the proposed method through experiments. © 2025 SPIE.

关键词： Dimensionality reduction

来源：评论

学校读者我要写书评

暂无评论

AMA-Net: Adaptive Masking Attention Network for Agricultural Crop Classification From UAV Images

IEEE Transactions on AgriFood Electronics

引用

IEEE Transactions on AgriFood Electronics 2025年第1期3卷 246-253页

作者： Wang, Xu Wang, Deyi He, Zhaoshui Lin, Zhijie Xie, Shengli Guangdong Mechanical and Electrical Polytechnic School of Electronics and Communication Guangzhou510550 China Guangdong University of Technology School of Automation Guangzhou510006 China Key Laboratory for IoT Intelligent Information Processing and System Integration of Ministry of Education Guangzhou510006 China Guangdong Provincial Key Laboratory of Intelligent Systems and Optimization Integration Guangzhou510006 China

Agriculture crop classification is helpful for agricultural production. However, it is challenging to classify crops from the agriculture image suffering from these problems: 1) Crops are often masked in complex backgrounds;2) There is high similarity between crop categories. To address these problems, an adaptive masking attention network (AMA-Net) is proposed for agriculture crop identification from natural images, where the adaptive masking (AM) module is developed to distinguish the crop from the complex background by selectively eliminating redundant information of feature maps, and the fair attention module is devised to identify similar crops between categories by modeling the fine-grained features. Experiments conducted on the benchmark show the effectiveness and superiority of the proposed AMA-Net, achieving the performance of 96.65%, 96.65%, 97.13%, and 96.72% on the accuracy, precision, recall, and F1-score, respectively, which is better than other state-of-the-art methods. © 2023 IEEE.

关键词： Crops Agriculture Accuracy Visualization Training Production Autonomous aerial vehicles Attention mechanisms Adaptive systems Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Fuzzy information Quantity Measurement and Feature Selection by Macrogranular Entropy

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年

作者： Zhu, Zhilin Zhang, Chucai Dai, Jianhua Hunan Normal University Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing College of Information Science and Engineering Changsha410081 China

Feature selection is an important data preprocessing process in artificial intelligence, which aims to eliminate redundant features while retaining essential features. Measuring feature significance and relevance between features is a significant challenge. Fuzzy information entropy is an extension of Shannon entropy. It is widely used for quantifying the information of fuzzy divisions. However, it has significant limitations, notably the lack of monotonicity in fuzzy conditional entropy measure of decision uncertainty in the feature selection process. We introduce a novel measurement Macrogranular Entropy (ME) and construct some generalized forms, such as conditional macrogranular entropy, mutual macrogranular information, and joint macrogranular entropy. The conditional macrogranular entropy exhibits monotonicity when measuring decision uncertainty. Additionally, we propose two feature selection algorithms: one based on Monotonic Conditional Macrogranular Entropy (MCME), and the other based on the Degree of Symmetric Association (ADSA). The ADSA algorithm and the MCME algorithm are compared against eight other feature selection algorithms through a series of experiments. The comparison was conducted based on classification performance using SVM and NB classifiers, as well as evaluation metrics including F1-score and Recall. In terms of all four evaluation metrics, ADSA and MCME achieved the top two rankings, respectively. Specifically, on the NB and SVM classifiers, the ADSA algorithm improves the average accuracy by 12.22% and 2.88% compared to the original feature set, while MCME improves the accuracy by 10.07% and 1.01%, respectively. Experimental comparisons demonstrate that ADSA algorithm effectively removes redundant information from the dataset during feature selection. © 2025 IEEE.

关键词： Feature Selection

来源：评论

学校读者我要写书评

暂无评论

Online Multi-label Streaming Feature Selection with Missing Features by Dual-Space Consistency information Measurement

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年

作者： Dai, Jianhua Wang, Jie Hunan Normal University Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing College of Information Science and Engineering Changsha410081 China

Multi-label feature selection is critical to address the challenges of high dimensionality and computational complexity in multi-label learning. However, in some practical applications, a more complex challenge is the dynamic generation of features, known as streaming features. Although some scholars have studied multi-label streaming feature selection methods, the problem of missing features during dynamic feature generation in multi-label data is rarely considered. Hence, we propose an online multi-label streaming feature selection method for multilabel data containing missing features by dual-space consistency information measurement. Firstly, we construct the dual-space consistency information measurement, which can effectively capture the relationships between features and labels. Specifically, we consider it from the perspective of instance correlation, and propose a fuzzy α-tolerance relation in the feature space to directly deal with missing features, and introduce an improved neighbour similarity relation in the label space to capture the instance similarity between the label combinations. Secondly, based on the dual-space consistency information, we further introduce the consistency gain index to help identify those features with important information during the streaming feature selection process. Thirdly, by combining online significance analysis, online relevance analysis, and online redundancy analysis, a new streaming feature selection framework is constructed, which can comprehensively evaluate the newly arrived features in terms of strong consistency, weak consistency and irrelevance, so as to identify the most representative features in the continuously arriving feature streams. Finally, a series of comparative experiments on multiple benchmark datasets demonstrate the effectiveness and superiority of our proposed method. © 2025 IEEE.

关键词： Data consistency

来源：评论

学校读者我要写书评

暂无评论

Leveraging catastrophic forgetting to develop safe diffusion models against malicious finetuning 24

Leveraging catastrophic forgetting to develop safe diffusion...

引用

Proceedings of the 38th International Conference on Neural information processing Systems

作者： Jiadong Pan Hongcheng Gao Zongyu Wu Taihang Hu Li Su Qingming Huang Liang Li Key Laboratory of Intelligent Information Processing Institute of Computing Technology CAS and University of Chinese Academy of Sciences University of Chinese Academy of Sciences The Pennsylvania State University Nankai University Key Laboratory of Intelligent Information Processing Institute of Computing Technology CAS

ISBN: (纸本)9798331314385

Diffusion models (DMs) have demonstrated remarkable proficiency in producing images based on textual prompts. Numerous methods have been proposed to ensure these models generate safe images. Early methods attempt to incorporate safety filters into models to mitigate the risk of generating harmful images but such external filters do not inherently detoxify the model and can be easily bypassed. Hence, model unlearning and data cleaning are the most essential methods for maintaining the safety of models, given their impact on model parameters. However, malicious fine-tuning can still make models prone to generating harmful or undesirable images even with these methods. Inspired by the phenomenon of catastrophic forgetting, we propose a training policy using contrastive learning to increase the latent space distance between clean and harmful data distribution, thereby protecting models from being fine-tuned to generate harmful images due to forgetting. The experimental results demonstrate that our methods not only maintain clean image generation capabilities before malicious fine-tuning but also effectively prevent DMs from producing harmful images after malicious fine-tuning. Our method can also be combined with other safety methods to maintain their safety against malicious fine-tuning further.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Probabilistic Inference Based Incremental Graph Index for Similarity Search on Social Networks 19th

Probabilistic Inference Based Incremental Graph Index for S...

引用

19th EAI International Conference on Collaborative computing: Networking, Applications and Worksharing, CollaborateCom 2023

作者： Lu, Tong Qi, Zhiwei Yue, Kun Duan, Liang School of Information Science and Engineering Yunnan University Kunming China Yunnan Key Laboratory of Intelligent Systems and Computing Yunnan University Kunming China

ISBN: (纸本)9783031545276

To find k neighbor users on social networks, the efficient approximate nearest neighbor search (ANNS) is useful. Existing graph index methods have shown attractive performance, but suffer from inaccuracy w.r.t. unindexed queries. To achieve both indexed and unindexed queries for graph-index methods, we propose an incremental graph index based method for ANNS on social networks. First, graph convolutional network based on attention mechanism is adopted to embed the social network into low-dimensional vector space, on which the graph index is constructed efficiently. To add the unindexed queries to the graph index incrementally, we propose Bayesian network (BN) learned from social interactions to represent dependency relations of unindexed queries and their neighbors, and perform probabilistic inferences in BN to infer the closest neighbors of unindexed queries. Extensive experiments show that our proposed method outperforms the state-of-the-art methods on both execution time and precision. © ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2024.

关键词： Vector spaces

来源：评论

学校读者我要写书评

暂无评论

Online Multi-Label Streaming Feature Selection by Label Enhancement and Fuzzy Synergistic Discrimination information

引用

IEEE Transactions on Fuzzy Systems 2025年

作者： Zou, Ligeng Zhou, Tong Dai, Jianhua Hunan Normal University Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing College of Information Science and Engineering Changsha410081 China

Online streaming feature selection is an effective approach for handling large-scale streaming data in real-world applications. However, many existing online streaming feature selection studies do not effectively leverage the correlation and hidden information in the label space. The measures used in streaming feature selection often face challenges such as computational complexity and insufficient information exploitation. To address these issues, we propose an online streaming feature selection method based on label enhancement and fuzzy synergistic discrimination information. Firstly, we define a novel label enhancement method based on label correlation, which does not require any prior knowledge of feature space. Secondly, we propose a new measure to evaluate the discriminative ability of multiple feature subsets for labels in fuzzy environment, called fuzzy synergistic discrimination information. It is bounded and has many interesting properties. The fuzzy synergistic discrimination information is computed directly based on fuzzy similarity relations, so the calculation is relatively simple. Thirdly, based on label enhancement and proposed fuzzy synergistic discrimination information, we construct a three-stage online multi-label streaming feature selection method, including online significance analysis, online relevance analysis and online redundancy analysis. Finally, comparative experiments on 12 datasets demonstrate the effectiveness and superiority of the proposed method. The influences of different feature sequences and these components on the algorithm's performance are further analyzed. © 1993-2012 IEEE.

关键词： information hiding

来源：评论

学校读者我要写书评

暂无评论

Imperceptible and Sparse Adversarial Attacks via a Dual-Population-Based Constrained Evolutionary Algorithm

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2023年第2期4卷 268-281页

作者： Tian, Ye Pan, Jingwen Yang, Shangshang Zhang, Xingyi He, Shuping Jin, Yaochu Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Institutes of Physical Science and Information Technology Hefei230601 China Hefei Comprehensive National Science Center Institute of Artificial Intelligence Hefei230088 China Anhui University School of Computer Science and Technology Hefei230601 China Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Artificial Intelligence Hefei230601 China Anhui University Anhui Engineering Laboratory of Human-Robot Integration System and Intelligent Equipment School of Electrical Engineering and Automation Hefei230601 China Bielefeld University Faculty of Technology Bielefeld33619 Germany

The sparse adversarial attack has attracted increasing attention due to the merit of a low attack cost via changing a small number of pixels. However, the generated adversarial examples are easily detected in vision since the perturbation to each pixel is relatively large. To achieve imperceptible and sparse adversarial attacks, this article formulates a bi-objective constrained optimization problem, simultaneously minimizing the 0 and 2 distances to the original image, and proposes a dual-population-based constrained evolutionary algorithm to solve it. The proposed method solves the optimization problem by evolving two populations, where one population is responsible for finding feasible solutions (i.e., successful attacks) and the other one is to minimize both the 0 and 2 distances. Moreover, a population initialization strategy and two genetic operators are customized to accelerate the convergence speed. Experimental results indicate that the proposed method can achieve high success rates with low attack costs, and strikes a better balance between the 0 and 2 distances than state-of-the-art methods. © 2020 IEEE.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Paradigm Shift in Natural Language processing

引用

Machine Intelligence Research 2022年第3期19卷 169-183页

作者： Tian-Xiang Sun Xiang-Yang Liu Xi-Peng Qiu Xuan-Jing Huang School of Computer Science Fudan UniversityShanghai 200438China Shanghai Key Laboratory of Intelligent Information Processing Fudan UniversityShanghai 200438China

In the era of deep learning, modeling for most natural language processing (NLP) tasks has converged into several mainstream paradigms. For example, we usually adopt the sequence labeling paradigm to solve a bundle of tasks such as POS-tagging, named entity recognition (NER), and chunking, and adopt the classification paradigm to solve tasks like sentiment analysis. With the rapid progress of pre-trained language models, recent years have witnessed a rising trend of paradigm shift, which is solving one NLP task in a new paradigm by reformulating the task. The paradigm shift has achieved great success on many tasks and is becoming a promising way to improve model performance. Moreover, some of these paradigms have shown great potential to unify a large number of NLP tasks, making it possible to build a single model to handle diverse tasks. In this paper, we review such phenomenon of paradigm shifts in recent years, highlighting several paradigms that have the potential to solve different NLP tasks.

关键词： Natural language processing pre-trained language models deep learning sequence-to-sequence paradigm shift

来源：评论

学校读者我要写书评

暂无评论

Towards Privacy-Aware Causal Structure Learning in Federated Setting

引用

IEEE Transactions on Big Data 2023年第6期9卷 1525-1535页

作者： Huang, Jianli Guo, Xianjie Yu, Kui Cao, Fuyuan Liang, Jiye Intelligent Interconnected Systems Laboratory of Anhui Province School of Computer Science and Information Engineering Hefei University of Technology Hefei230601 China Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Education School of Computer and Information Technology Shanxi University Taiyuan030006 China

Causal structure learning has been extensively studied and widely used in machine learning and various applications. To achieve an ideal performance, existing causal structure learning algorithms often need to centralize a large amount of data from multiple data sources. However, in the privacy-preserving setting, it is impossible to centralize data from all sources and put them together as a single dataset. To preserve data privacy, federated learning as a new learning paradigm has attached much attention in machine learning in recent years. In this paper, we study a privacy-aware causal structure learning problem in the federated setting and propose a novel federated PC (FedPC) algorithm with two new strategies for preserving data privacy without centralizing data. Specifically, we first propose a novel layer-wise aggregation strategy for a seamless adaptation of the PC algorithm into the federated learning paradigm for federated skeleton learning, then we design an effective strategy for learning consistent separation sets for federated edge orientation. The extensive experiments validate that FedPC is effective for causal structure learning in federated learning setting. © 2023 IEEE.

关键词： Big data

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：