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

Hyperbolic Neural Network Based Preselection for Expensive Multi-Objective Optimization

IEEE Transactions on Evolutionary Computation 2024年 1-1页

作者： Li, Bingdong Yang, Yanting Hong, Wenjing Yang, Peng Zhou, Aimin Shanghai Institute of AI for Education the School of Computer Science and Technology and the Shanghai Frontiers Science Center of Molecule Intelligent Syntheses East China Normal University Shanghai China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China Department of Computer Science and Engineering Guangdong Key Laboratory of Brain-Inspired Intelligent Computation Southern University of Science and Technology Shenzhen China

A series of surrogate-assisted evolutionary algorithms (SAEAs) have been proposed for expensive multi-objective optimization problems (EMOPs), building cheap surrogate models to replace the expensive real function evaluations. However, the search efficiency of these SAEAs is not yet satisfactory. More efforts are needed to further exploit useful information from the real function evaluations in order to better guide the search process. Facing this challenge, this paper proposes a Hyperbolic Neural Network (HNN) based preselection operator to accelerate the optimization process based on limited evaluated solutions. First, the preselection task is modeled as a multi-label classification problem where solutions are classified into different layers (ordinal categories) through -relaxed objective aggregation. Second, in order to resemble the hierarchical structure of candidate solutions, a hyperbolic neural network is applied to tackle the multi-label classification problem. The reason for using HNN is that hyperbolic spaces more closely resemble hierarchical structures than Euclidean spaces. Moreover, to alleviate the data deficiency issue, a data augmentation strategy is employed for training the HNN. In order to evaluate its performance, the proposed HNN-based preselection operator is embedded into two surrogate-assisted evolutionary algorithms. Experimental results on two benchmark test suites and three real-world problems with up to 11 objectives and 150 decision variables involving seven state-of-the-art algorithms demonstrate the effectiveness of the proposed method. IEEE

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Prototype-supervised adversarial network for targeted attack of deep hashing

arXiv

引用

arXiv 2021年

作者： Wang, Xunguang Zhang, Zheng Wu, Baoyuan Shen, Fumin Lu, Guangming Harbin Institute of Technology Shenzhen China Peng Cheng Laboratory School of Data Science The Chinese University of Hong Kong Shenzhen China Secure Computing Lab of Big Data Shenzhen Research Institute of Big Data University of Electronic Science and Technology of China Koala Uran Tech

Due to its powerful capability of representation learning and high-efficiency computation, deep hashing has made significant progress in large-scale image retrieval. However, deep hashing networks are vulnerable to adversarial examples, which is a practical secure problem but seldom studied in hashing-based retrieval field. In this paper, we propose a novel prototype-supervised adversarial network (ProS-GAN), which formulates a flexible generative architecture for efficient and effective targeted hashing attack. To the best of our knowledge, this is the first generation-based method to attack deep hashing networks. Generally, our proposed framework consists of three parts, i.e., a PrototypeNet, a generator and a discriminator. Specifically, the designed PrototypeNet embeds the target label into the semantic representation and learns the prototype code as the category-level representative of the target label. Moreover, the semantic representation and the original image are jointly fed into the generator for flexible targeted attack. Particularly, the prototype code is adopted to supervise the generator to construct the targeted adversarial example by minimizing the Hamming distance between the hash code of the adversarial example and the prototype code. Furthermore, the generator is against the discriminator to simultaneously encourage the adversarial examples visually realistic and the semantic representation informative. Extensive experiments verify that the proposed framework can efficiently produce adversarial examples with better targeted attack performance and transferability over state-of-the-art targeted attack methods of deep hashing. Copyright © 2021, The Authors. All rights reserved.

关键词： Hamming distance

来源：评论

学校读者我要写书评

暂无评论

Prediction of Estimated Time of Arrival for Multi-Airport Systems Via "Bubble" Mechanism

SSRN

引用

SSRN 2022年

作者： Wang, Lechen Mao, Jianfeng Li, Lishuai Li, Xuechun Tu, Yilei School of Data Science The Chinese University of Hong Kong Shenzhen China School of Science and Engineering The Chinese University of Hong Kong Shenzhen China Shenzhen Research Institute of Big Data Guangdong China Guangdong Provincial Key Laboratory of Big Data Computing The Chinese University of Hong Kong Shenzhen China Faculty of Aerospace Engineering Delft University of Technology Delft2600 AA Netherlands School of Data Science City University of Hong Kong Hong Kong

Predicting Estimated Time of Arrival (ETA) for a Multi-Airport System (MAS) is much more challenging than for a single airport system because of complex air route structure, dense air traffic volume and vagaries of traffic conditions in an MAS. In this work, we propose a novel Bubble mechanism to accurately and e ciently predict medium-term ETA for a Multi-Airport System (MAS), in which the prediction of travel time of an origin-destination (OD) pair is decomposed into two stages, termed as out-MAS and in-MAS stages. For the out-MAS stage, Auto-Regressive Integrated Moving Average (ARIMA) is used to predict the travel time of a ight to reach the MAS boundary. For the in-MAS stage, we construct new spatio-temporal features based on clustering analysis of trajectory patterns facilitated by a novel data-driven hybrid polar sampling method. A sequence-to-sequence prediction model, Multi-variate Stacked Fully connected Bidirectional Long-Short Term Memory, is further developed to achieve multi-step-ahead predictions of in-MAS travel time for each trajectory pattern using the spatio-temporal features as input. Finally, the medium-term ETA prediction for an MAS is achieved by integrating the out-MAS and in-MAS prediction with the help of trajectory pattern prediction via random forest. A case study of predicting medium-term ETA for a typical MAS in China, Guangdong-Hong Kong-Macao Greater Bay Area, is conducted to demonstrate the usage and promising performance of the proposed method in comparison to several commonly used end-to-end learning methods. © 2022, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

A Real-Time and Ubiquitous Network Attack Detection Based on Deep Belief Network and Support Vector Machine

引用

IEEE/CAA Journal of Automatica Sinica 2020年第3期7卷 790-799页

作者： Hao Zhang Yongdan Li Zhihan Lv Arun Kumar Sangaiah Tao Huang IEEE National Engineering Laboratory for Educational Big Data Central China Normal UniversityWuhan 430072China Lanzhou Central Sub-branch of The People’s Bank of China Lanzhou 730000China School of Data Science and Software Engineering Qingdao UniversityQingdao 266071China School of Computing Science and Engineering Vellore Institute of Technology UniversityTamil Nadu 632014India

In recent years, network traffic data have become larger and more complex, leading to higher possibilities of network intrusion. Traditional intrusion detection methods face difficulty in processing high-speed network data and cannot detect currently unknown attacks. Therefore, this paper proposes a network attack detection method combining a flow calculation and deep learning. The method consists of two parts: a real-time detection algorithm based on flow calculations and frequent patterns and a classification algorithm based on the deep belief network and support vector machine(DBN-SVM). Sliding window(SW) stream data processing enables real-time detection, and the DBN-SVM algorithm can improve classification accuracy. Finally, to verify the proposed method, a system is *** on the CICIDS2017 open source data set, a series of comparative experiments are conducted. The method's real-time detection efficiency is higher than that of traditional machine learning algorithms. The attack classification accuracy is 0.7 percentage points higher than that of a DBN, which is 2 percentage points higher than that of the integrated algorithm boosting and bagging methods. Hence, it is suitable for the real-time detection of high-speed network intrusions.

关键词： Deep belief network(DBN) flow calculation frequent pattern intrusion detection sliding window support vector machine(SVM)

来源：评论

学校读者我要写书评

暂无评论

Clustering by orthogonal NMF model and non-convex penalty optimization

Clustering by orthogonal NMF model and non-convex penalty op...

引用

作者： Wang, Shuai Chang, Tsung-Hui Cui, Ying Pang, Jong-Shi Shenzhen Research Institute of Big Data and School of Science and Engineering The Chinese University of Hong Kong Shenzhen518172 China Guangdong Provincial Key Laboratory of Big Data Computing and School of Science and Engineering The Chinese University of Hong Kong Shenzhen518172 China Department of Industrial and Systems Engineering University of Minnesota MinneapolisMN55455 United States Department of Industrial and Systems Engineering University of Southern California Los AngelesCA90089 United States

The non-negative matrix factorization (NMF) model with an additional orthogonality constraint on one of the factor matrices, called the orthogonal NMF (ONMF), has been found a promising clustering model and can outperform the classical K-means. However, solving the ONMF model is a challenging optimization problem because the coupling of the orthogonality and non-negativity constraints introduces a mixed combinatorial aspect into the problem due to the determination of the correct status of the variables (positive or zero). Most of the existing methods directly deal with the orthogonality constraint in its original form via various optimization techniques, but are not scalable for large-scale problems. In this paper, we propose a new ONMF based clustering formulation that equivalently transforms the orthogonality constraint into a set of norm-based non-convex equality constraints. We then apply a non-convex penalty (NCP) approach to add them to the objective as penalty terms, leading to a problem that is efficiently solvable. One smooth penalty formulation and one non-smooth penalty formulation are respectively studied. We build theoretical conditions for the penalized problems to provide feasible stationary solutions to the ONMF based clustering problem, as well as proposing efficient algorithms for solving the penalized problems of the two NCP methods. Experimental results based on both synthetic and real datasets are presented to show that the proposed NCP methods are computationally time efficient, and either match or outperform the existing K-means and ONMF based methods in terms of the clustering performance. © 1991-2012 IEEE.

关键词： Non-negative matrix factorization

来源：评论

学校读者我要写书评

暂无评论

Efficient COVID-19 detection using data mining algorithms: a comparison of basic and hybrid approaches

引用

Soft computing 2025年第3期29卷 1437-1451页

作者： Saidi, Mohammad Gheibi, Mohammad Ghazikhani, Adel Lotfata, Aynaz Chahkandi, Benyamin Familsamavati, Sajad Behzadian, Kourosh Department of Computer Science Imam Reza International University Mashhad Iran MS of Software Engineering Information and Communication Technology Unit Mashhad Municipality Fire and Safety Services Organization Mashhad Iran Big Data Lab Imam Reza International University Mashhad Iran Institute for Nanomaterials Advanced Technologies and Innovation Technical University of Liberec Liberec46117 Czech Republic Tallinn10615 Estonia Department of Pathology Microbiology and Immunology School of Veterinary Medicine University of California Davis95616 United States Department of Urban and Regional Planning San Jose State University San Jose95192 United States Faculty of Civil and Environmental Engineering Gdansk University of Technology Narutowicza Street 11/12 80-233 Gdansk Poland Tecnologico de Monterrey Escuela de Ingeniería y Ciencias Monterrey Mexico School of Computing and Engineering University of West London London United Kingdom

Accurate and efficient diagnosis of COVID-19 remains a significant challenge due to the limitations of current detection methods, such as blood tests and chest scans, which can be time-consuming and error-prone. This study aims to compare the performance of basic and hybrid data mining algorithms in diagnosing COVID-19, using blood test results and clinical information to identify the most effective approach. A dataset of 200 records from suspected and infected COVID-19 patients, with 23 characteristics and one diagnostic class, was analysed. Nine data mining algorithms were tested: four basic algorithms (Naive Bayes, Support Vector Machine, Decision Tree, K-Nearest Neighbor) and five hybrid algorithms (Random Forest, AdaBoost, Majority Voting, XGBoost, Bagging). The study also integrated Response Surface Methodology (RSM) and Adaptive-Network-based Fuzzy Inference System (ANFIS) to enhance model performance. The Bagging algorithm demonstrated superior performance with an accuracy of 88%, sensitivity of 74%, and F-criterion of 78%. The integration of RSM and ANFIS further showed that a smart model could be developed for efficient pandemic crisis management, achieving up to 100% accuracy when considering key factors like AST, Albumin, and CRP. The findings suggest that Bagging and hybrid data mining algorithms can significantly improve COVID-19 detection, reducing time and errors in identifying exposed individuals. The study highlights the potential of combining machine learning techniques with RSM-ANFIS models for effective pandemic management and decision-making in medical settings. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2025.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Modeling Method for Sampling Zeros of Sampled-data System with Time Delay in Generalized Sample Hold

引用

IFAC-PapersOnLine 2023年第2期56卷 9799-9805页

作者： Minghui Ou Shan Liang Zhiyong Yang Zhenjie Yan Zhiyong Li School of Big Data and Internet of Things Chongqing Vocational Institute of Engineering Chongqing 402260 PR China College of Automation Chongqing University Chongqing 400044 PR China Key Laboratory of Dependable Service Computing in Cyber Physical Society Ministry of Education Chongqing 400044 PR China. School of Electrical Engineering Southwest Jiaotong University Chengdu 611756 PR China

Unstable zeros are widely known to dramatically curb the performance of controllers and the direct applications of several control algorithms. Time delay is a crucial research topic due to the prevalence of communication and computational delays in the control process. In particular, time delay exacerbates the possibility of continuous-time systems with stable zeros transforming into discrete-time systems with unstable zeros. For continuous-time systems with a relative degree greater than or equal to two, at least one zero of the corresponding discrete-time system converges to either marginally stable or unstable locations as the sampling time approaches zero. This study investigates the sampling zeros of discrete-time systems in the case of a generalized sample hold function (GSHF) with time delay. Moreover, it presents a novel modeling method and stability conditions of the limiting zeros for the discrete-time system. The results demonstrate that the stable properties of zeros for the time delay systems can be preserved in the discretization process when GSHF is applied for signal reconstruction when zero-order hold fails to do so. Finally, numerical examples are provided to illustrate the effectiveness of the proposed method in this study.

关键词： Sampling zeros stability generalized sample hold function (GSHF) time delay. sampled-data system

来源：评论

学校读者我要写书评

暂无评论

Reinforcement-learning-based Algorithms for Optimization Problems and Applications to Inverse Problems

arXiv

引用

arXiv 2023年

作者： Xu, Chen Zhao, Yun-Bin Lu, Zhipeng Zhang, Ye Guangdong Laboratory of Machine Perception and Intelligent Computing Shenzhen MSU-BIT University China Shenzhen Research Institute of Big Data Chinese University of Hong Kong Shenzhen China Faculty of Computational Mathematics and Cybernetics Shenzhen MSU-BIT University Shenzhen518172 China School of Mathematics and Statistics Beijing Institute of Technology Beijing100081 China

We design a new iterative algorithm, called REINFORCE-OPT, for solving a general type of optimization problems. This algorithm parameterizes the solution search rule and iteratively updates the parameter using a reinforcement learning (RL) algorithm resembling REINFORCE. To gain a deeper understanding of the RL-based methods, we show that REINFORCE-OPT essentially solves a stochastic version of the given optimization problem, and that under standard assumptions, the searching rule parameter almost surely converges to a locally optimal value. Experiments show that REINFORCE-OPT outperforms other optimization methods such as gradient descent, the genetic algorithm, and particle swarm optimization, via its ability to escape from locally optimal solutions and its robustness to the choice of initial values. With rigorous derivations, we formally introduce the use of reinforcement learning to deal with inverse problems. By choosing specific probability models for the action-selection rule, we can also connect our approach to the conventional methods of Tikhonov regularization and iterative regularization. We take non-linear integral equations and parameter-identification problems in partial differential equations as examples to show how reinforcement learning can be applied in solving non-linear inverse problems. The numerical experiments highlight the strong performance of REINFORCE-OPT, as well as its ability to quantify uncertainty in error estimates and identify multiple solutions for ill-posed inverse problems that lack solution stability and *** Codes 90C26, 65J22, 65J20, 90C40, 90C15, 45Q05, 47A52 Copyright © 2023, The Authors. All rights reserved.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Research on Experimental System and Method for Electric Vehicle Charging Behavior Detection

Research on Experimental System and Method for Electric Vehi...

引用

Chinese Automation Congress (CAC)

作者： Hongyu Long Xiaosheng Zhan Yuansen Xu Jianbo Yu Tian Tian Yongzhong Zhou School of Automation/School of Industrial Internet and Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and Telecommunications Chongqing China School of Automation Chongqing University of Posts and Telecommunications Chongqing China Economic and Technical Research Institute of State Grid Chongqing Electric Power Company Chongqing China

Before the charging behavior occurs, drivers often make charging decisions motivated by range anxiety. Traditional research on charging behavior mainly relies on psychological questionnaires and big data analysis, but these methods are subjective and limited. Therefore, this paper uses physiological signal studies as a supplement to provide objective and quantitative indicators. In this paper, by building an experimental platform and designing an experimental scheme, the electroencephalogram, electrocardiogram, electrodermal and electromyography signals of the subjects during simulated driving were collected. Through data processing and analysis, it is found that the EEG signal, ECG signal, EDA signal and EMG signal will change after the driver is stimulated by insufficient driving range. The experimental results show that there is a certain correlation between the driver's range anxiety state and physiological information, indicating that physiological signals can be used as an effective tool to evaluate and study range anxiety, and also provide a new solution for the driver's state detection before charging electric vehicles, which is of great significance for the popularization and promotion of electric vehicles.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Privacy Preserving Federated Learning Aggregation Algorithm for Noise Label

A Privacy Preserving Federated Learning Aggregation Algorith...

引用

International Conference on Computer and Communications (ICCC)

作者： Weiguang Han Xishan Yan Shenyang Institute of Computing Technology Chinese Academy of Sciences Shenyang China College of Computer and Cyber Secutiry Fujian Normal University Fuzhou China University of Chinese Academy of Sciences Beijing China Fujian Provincial Engineering Research Center for Public Service Big Data Mining and Application Fuzhou China

To solve the problem that a large number of noise labels lead to the reduction of the efficiency of existing aggregation Algorithmic efficiency and the difficulty of extending existing methods to the privacy protection framework, a noise label oriented privacy protection Federated learning aggregation algorithm PP-ASNL is proposed. This algorithm is mainly divided into two parts: a client-side noise label sample detection model and a server-side model rating aggregation mechanism. Simulation results show that the proposed algorithm has higher model accuracy and Rate of convergence than the existing methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：