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

1st International Conference on Intelligent Manufacturing and Cloud Computing, ICIMCC 2024

作者： Yuan, Changjiang Li, Yidong Chen, Naiyue Zhang, Zikai Key Laboratory of Big Data & Artificial Intelligence in Transportation Beijing Jiaotong University Ministry of Education China School of Computer Science and Technology Beijing Jiaotong University Beijing100044 China

ISBN: (纸本)9781643685779

The distributed nature of federated learning makes it highly susceptible to backdoor attacks, which aim to induce the model to produce incorrect results when specific data is input. Existing defense methods based on distance calculations mostly use one single distance, which can be easily circumvented by backdoor attacks. Therefore, we conducted research on the combination of multiple distances. Based on this, we propose a backdoor defense algorithm based on multi metrics, which evaluates models through distance calculation and normalization to select benign models for aggregation. To verify the effectiveness of our method, we conducted experiments on three datasets, and the results prove that our method can provide good defense without reducing the model's main task accuracy. © 2025 The Authors.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Multicomponent Similarity Graphs for Cross-Network Node Classification

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial intelligence 2024年第3期5卷 1411-1424页

作者： Zhang, Yuhong Shi, Congmei Li, Xinzheng Zhang, Zan Hu, Xuegang School of Computer Science and Information Engineering Hefei University of Technology Hefei230601 China Institute of Artificial Intelligence Hefei Comprehensive National Science Center Hefei230088 China Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education Hefei230009 China

Cross-network node classification aims to train a classifier for an unlabeled target network using a source network with rich labels. In applications, the degree of nodes mostly conforms to the long-tail distribution, i.e., most nodes in the network are tail nodes with sparse neighborhoods. The established methods focus on either the discrepancy cross network or the long tail in a single network. As for the cross-network node classification under long tail, the coexistence of sparsity of tail nodes and the discrepancy cross-network challenges existing methods for long tail or methods for the cross-network node classification. To this end, a multicomponent similarity graphs for cross-network node classification (MS-CNC) is proposed in this article. Specifically, in order to address the sparsity of the tail nodes, multiple component similarity graphs, including attribute and structure similarity graphs, are constructed for each network to enrich the neighborhoods of the tail nodes and alleviate the long-tail phenomenon. Then, multiple representations are learned from the multiple similarity graphs separately. Based on the multicomponent representations, a two-level adversarial model is designed to address the distribution difference across networks. One level is used to learn the invariant representations cross network in view of structure and attribute components separately, and the other level is used to learn the invariant representations in view of the fused structure and attribute graphs. Extensive experimental results show that the MS-CNC outperforms the state-of-the-art methods. Impact Statement-Node classification is an important task in graph mining. With the unavailability of labels, some researchers propose cross-network node classification, using one labeled network to assist the node classification of another unlabeled network. However, the long-tail of nodes leads to unsatisfactory performance and challenges the recent cross-network node classification m

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

LSTV-V2V: A Large-Scale Traffic Virtual dataset for Vehicle-to-Vehicle Cooperative Perception 27

LSTV-V2V: A Large-Scale Traffic Virtual Dataset for Vehicle-...

引用

27th IEEE International Conference on Intelligent Transportation Systems, ITSC 2024

作者： Suo, Xiaohua Zhang, Hui Xu, Feibing Li, Yidong Beijing Jiaotong University School of Computer and Information Technology Beijing Jiaotong University Key Laboratory of Big Data and Artificial Intelligence in Transportation Ministry of Education Beijing100044 China

ISBN: (纸本)9798331505929

Cooperative perception system is essential to address occlusion and small object perception issues in autonomous driving. However, autonomous vehicle (AV) perception methods based on deep learning rely on large-scale and accurately annotated traffic datasets. Compared to real datasets, which are difficult to collect and annotate and limited in quantity and diversity of scenes, the virtual dataset synthesis method is a convenient and efficient approach. To improve annotation accuracy while speeding up modeling, we propose a pipeline for constructing artificial traffic scenes and generating virtual datasets based on autonomous driving simulation software from a parallel vision perspective. Furthermore, to facilitate the development of cooperative perception, we propose a novel efficient traffic scene dataset for V2V cooperative perception named Large-Scale Traffic Virtual dataset (LSTV-V2V). Our dataset contains 47 traffic scenarios, 8380 frames, and 191864 annotated 3D vehicle bounding boxes. Experimental results demonstrate the effectiveness of our virtual dataset in cooperative perception tasks. © 2024 IEEE.

关键词： Virtual environments

来源：评论

学校读者我要写书评

暂无评论

Joint Feature Representation and Classifier Learning Based Unsupervised Domain Adaption ELM

引用

Chinese Journal of Electronics 2021年第1期30卷 109-118页

作者： WANG Xuesong ZHAO Jijuan CHENG Yuhu YU Qiang School of Information and Control Engineering China University of Mining and Technology Xuzhou Key Laboratory of Artificial Intelligence and Big Data

In the problem of unsupervised domain adaption Extreme learning machine(ELM), the output layer parameters need to have both classification and domain adaptation functions, which often cannot be simultaneously fully utilized. In addition, traditional matching method based on data probability distribution cannot find the common subspace of source and target domains under large difference between domains. In order to alleviate the pressure of double functions of classifier parameters, the entire ELM learning process is mainly divided into two stages: feature representation and adaptive classifier learning, thus a joint feature representation and classifier learning based unsupervised domain adaption ELM model is proposed. In the feature representation stage, the source and target domain data are projected to their respective subspace while minimizing the difference in probability distribution between the two domains. In the adaptive classifier learning stage, the smooth manifold regularization term of target domain is used to improve the parameter adaptive *** on six different types of datasets show that the proposed model has higher cross-domain classification accuracy.

关键词： entire ELM learning process unsupervised domain adaption ELM model output layer parameters image representation double functions parameter adaptive ability common subspace classifier parameters joint feature representation unsupervised domain adaption Extreme learning machine data probability distribution learning (artificial intelligence) higher cross-domain classification accuracy target domain probability pattern classification adaptive classifier learning stage traditional matching method target domains unsupervised learning feature representation stage domain adaptation functions

来源：评论

学校读者我要写书评

暂无评论

Adaptive Normalization for Non-stationary Time Series Forecasting: A Temporal Slice Perspective 37

Adaptive Normalization for Non-stationary Time Series Foreca...

引用

37th Conference on Neural Information Processing Systems, NeurIPS 2023

作者： Liu, Zhiding Cheng, Mingyue Li, Zhi Huang, Zhenya Liu, Qi Xie, Yanhu Chen, Enhong Anhui Province Key Laboratory of Big Data Analysis and Application University of Science and Technology of China China State Key Laboratory of Cognitive Intelligence China Shenzhen International Graduate School Tsinghua University China The First Affiliated Hospital of University of Science and Technology of China China

ISBN: (纸本)9781713899921

Deep learning models have progressively advanced time series forecasting due to their powerful capacity in capturing sequence dependence. Nevertheless, it is still challenging to make accurate predictions due to the existence of non-stationarity in real-world data, denoting the data distribution rapidly changes over time. To mitigate such a dilemma, several efforts have been conducted by reducing the non-stationarity with normalization operation. However, these methods typically overlook the distribution discrepancy between the input series and the horizon series, and assume that all time points within the same instance share the same statistical properties, which is too ideal and may lead to suboptimal relative improvements. To this end, we propose a novel slice-level adaptive normalization, referred to SAN, which is a novel scheme for empowering time series forecasting with more flexible normalization and denormalization. SAN includes two crucial designs. First, SAN tries to eliminate the non-stationarity of time series in units of a local temporal slice (i.e., sub-series) rather than a global instance. Second, SAN employs a slight network module to independently model the evolving trends of statistical properties of raw time series. Consequently, SAN could serve as a general model-agnostic plugin and better alleviate the impact of the non-stationary nature of time series data. We instantiate the proposed SAN on four widely used forecasting models and test their prediction results on benchmark datasets to evaluate its effectiveness. Also, we report some insightful findings to deeply analyze and understand our proposed SAN. We make our codes publicly available. © 2023 Neural information processing systems foundation. All rights reserved.

关键词： Time series

来源：评论

学校读者我要写书评

暂无评论

A Multi-Objective Particle Swarm Optimization Algorithm Based on Decomposition and Multi-Selection Strategy

引用

Computers, Materials & Continua 2025年第1期82卷 997-1026页

作者： Li Ma Cai Dai Xingsi Xue Cheng Peng School of Computer Science Shaanxi Normal UniversityXi’an710119China Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of TechnologyFuzhou350118China Information Construction and Management Center and Institute of Artificial Intelligence and Educational New Productivity Ningxia Normal UniversityGuyuan756099China

The multi-objective particle swarm optimization algorithm(MOPSO)is widely used to solve multi-objective optimization *** the article,amulti-objective particle swarm optimization algorithmbased on decomposition and multi-selection strategy is proposed to improve the search ***,two update strategies based on decomposition are used to update the evolving population and external archive,***,a multiselection strategy is *** first strategy is for the subspace without a non-dominated *** the neighbor particles,the particle with the smallest penalty-based boundary intersection value is selected as the global optimal solution and the particle far away fromthe search particle and the global optimal solution is selected as the personal optimal solution to enhance global *** second strategy is for the subspace with a non-dominated *** the neighbor particles,two particles are randomly selected,one as the global optimal solution and the other as the personal optimal solution,to enhance local *** third strategy is for Pareto optimal front(PF)discontinuity,which is identified by the cumulative number of iterations of the subspace without non-dominated *** the subsequent iteration,a new probability distribution is used to select from the remaining subspaces to ***,an adaptive inertia weight update strategy based on the dominated degree is designed to further improve the search ***,the proposed algorithmis compared with fivemulti-objective particle swarm optimization algorithms and five multi-objective evolutionary algorithms on 22 test *** results show that the proposed algorithm has better performance.

关键词： Multi-objective optimization multi-objective particle swarm optimization decomposition multi-selection strategy

来源：评论

学校读者我要写书评

暂无评论

Enhancing graph representation learning via type-aware decoupling and node influence allocation

引用

Applied intelligence 2025年第6期55卷 1-14页

作者： Zhu, Guochang Hu, Jun Liu, Li Zhang, Qinghua Wang, Guoyin School of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongwen Road Chongqing Chongqing400065 China Chongqing Key Laboratory of Computational Intelligence Chongqing University of Posts and Telecommunications Chongwen Road Chongqing Chongqing400065 China Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education Chongqing400065 China

The traditional graph representation methods can fit the information of graph with low-dimensional vectors, but they cannot interpret their composition, resulting in insufficient security. Graph decoupling, as a method of graph representation, can analyze the latent factors composing the graph representation vectors. However, in current graph decoupling methods, the number of factors is a hyperparameter, and enforce uniform decoupling vector dimensions which leads to information loss or redundancy. To address these issues, we propose a type-aware graph decoupling based on influence called Variational Graph Decoupling Auto-Encoder (VGDAE). It uses node labels as interpretable and objectively existing natural semantics for decoupling and allocates embedding space based on node influence, addressing the issues of manually setting the number of factors in traditional graph decoupling and the mismatch between node information size and embedding space. On the Cora, Citeseer, and fb-CMU datasets, VGDAE shows the impact of different node classes as decoupling targets on classification tasks. Furthermore, we perform visualization of the representations, VGDAE exhibits performance improvements of 2% in classification tasks and 12% in clustering tasks when compared with baseline models. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.

关键词： Graph embeddings

来源：评论

学校读者我要写书评

暂无评论

Few-shot Temporal Pruning Accelerates Diffusion Models for Text Generation 30

Few-shot Temporal Pruning Accelerates Diffusion Models for T...

引用

Joint 30th International Conference on Computational Linguistics and 14th International Conference on Language Resources and Evaluation, LREC-COLING 2024

作者： Li, Bocheng Gao, Zhujin Zhu, Yongxin Yin, Kun Cao, Haoyu Jiang, Deqiang Xu, Linli School of Computer Science and Technology University of Science and Technology of China China School of Data Science University of Science and Technology of China China State Key Laboratory of Cognitive Intelligence China Tencent YouTu Lab China

ISBN: (纸本)9782493814104

Diffusion models have achieved significant success in computer vision and shown immense potential in natural language processing applications, particularly for text generation tasks. However, generating high-quality text using these models often necessitates thousands of iterations, leading to slow sampling rates. Existing acceleration methods either neglect the importance of the distribution of sampling steps, resulting in compromised performance with smaller number of iterations, or require additional training, introducing considerable computational overheads. In this paper, we present Few-shot Temporal Pruning, a novel technique designed to accelerate diffusion models for text generation without supplementary training while effectively leveraging limited data. Employing a Bayesian optimization approach, our method effectively eliminates redundant sampling steps during the sampling process, thereby enhancing the generation speed. A comprehensive evaluation of discrete and continuous diffusion models across various tasks, including machine translation, question generation, and paraphrasing, reveals that our approach achieves competitive performance even with minimal sampling steps after down to less than 1 minute of optimization, yielding a significant acceleration of up to 400x in text generation tasks. © 2024 ELRA Language Resource Association: CC BY-NC 4.0.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Discovering Reliable Information Extraction Patterns with Pre-Trained Model for Text with Writing Style

Discovering Reliable Information Extraction Patterns with Pr...

引用

2023 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2023

作者： Bu, Chenyang Liu, Jiacheng Liu, Jiaxuan Ji, Shengwei Yang, Hongbin School of Computer Science and Information Engineering Ministry of Education Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Anhui Hefei230027 China School of Artificial Intelligence and Big Data Hefei University China

ISBN: (纸本)9798350337020

Large-scale pre-trained models such as GPT and BERT have demonstrated remarkable performance in information extraction tasks. However, their black-box nature poses challenges for reliability and interpretability. In contrast, rule- based extraction methods have better interpretability, but typically require domain experts to manually establish rules, limiting their generalization ability. In industry, there is often a demand for reliable knowledge extraction to reduce the time spent on manual verification of each piece of knowledge. In this paper, we explore the idea of combining GPT and symbolic-based methods to automatically discover reliable extraction patterns in text with a particular writing style. This method leverages the characteristics of high information density and similar writing patterns in text with a specific writing style to generate verifiable and reliable patterns. We conduct experiments on two datasets with a specific writing style to demonstrate its effectiveness, validating the idea of combining large models for reliable information extraction pattern discovery in the tested datasets. © 2023 IEEE.

关键词： Information extraction Reliable pattern Writing style data

来源：评论

学校读者我要写书评

暂无评论

Learning-Efficient Yet Generalizable Collaborative Filtering for Item Recommendation 41

Learning-Efficient Yet Generalizable Collaborative Filtering...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Pu, Yuanhao Chen, Xiaolong Huang, Xu Chen, Jin Lian, Defu Chen, Enhong School of Artificial Intelligence and Data Science University of Science and Technology of China China School of Computer Science and Technology University of Science and Technology of China China School of Business and Management Hong Kong University of Science and Technology Hong Kong State Key Laboratory of Cognitive Intelligence China

The weighted squared loss is a common component in several Collaborative Filtering (CF) algorithms for item recommendation, including the representative implicit Alternating Least Squares (iALS). Despite its widespread use, this loss function lacks a clear connection to ranking objectives such as Discounted Cumulative Gain (DCG), posing a fundamental challenge in explaining the exceptional ranking performance observed in these algorithms. In this work, we make a breakthrough by establishing a connection between squared loss and ranking metrics through a Taylor expansion of the DCG-consistent surrogate loss-softmax loss. We also discover a new surrogate squared loss function, namely Ranking-Generalizable Squared (RG2) loss, and conduct thorough theoretical analyses on the DCG-consistency of the proposed loss function. Later, we present an example of utilizing the RG2 loss with Matrix Factorization (MF), coupled with a generalization upper bound and an ALS optimization algorithm that leverages closed-form solutions over all items. Experimental results over three public datasets demonstrate the effectiveness of the RG2 loss, exhibiting ranking performance on par with, or even surpassing, the softmax loss while achieving faster convergence. Copyright 2024 by the author(s)

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：