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

Multi-task regression learning for survival analysis via prior information guided transductive matrix completion

Frontiers of Computer Science 2020年第5期14卷 99-112页

作者： Lei Chen Kai Shao Xianzhong Long Lingsheng Wang Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and TelecommunicationsNanjing210023China MIIT Key Laboratory of Pattern Analysis and Machine Intelligence Nanjing University of Aeronautics and AstronauticsNanjing211106China

Survival analysis aims to predict the occurrence time of a particular event of interest,which is crucial for the prognosis analysis of ***,due to the limited study period and potential losing tracks,the observed data inevitably involve some censored instances,and thus brings a unique challenge that distinguishes from the general regression *** addition,survival analysis also suffers from other inherent challenges such as the high-dimension and small-sample-size *** address these challenges,we propose a novel multi-task regression learning model,i.e.,prior information guided transductive matrix completion(PigTMC)model,to predict the survival status of the new ***,we use the multi-label transductive matrix completion framework to leverage the censored instances together with the uncensored instances as the training samples,and simultaneously employ the multi-task transductive feature selection scheme to alleviate the overfitting issue caused by high-dimension and small-sample-size *** addition,we employ the prior temporal stability of the survival statuses at adjacent time intervals to guide survival ***,we design an optimization algorithm with guaranteed convergence to solve the proposed PigTMC ***,the extensive experiments performed on the real microarray gene expression datasets demonstrate that our proposed model outperforms the previously widely used competing methods.

关键词： survival analysis matrix completion multi-task regression transductive learning multi-task feature selection

来源：评论

学校读者我要写书评

暂无评论

Learning Counterfactual Explanation of Graph Neural Networks Via Generative Flow Network

SSRN

引用

SSRN 2023年

作者： He, Kangjia Liu, Li Zhang, Youmin Wang, Ye Liu, Qun Wang, Guoyin School of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing400065 China Chongqing Key Laboratory of Computational Intelligence Chongqing China Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education Chongqing China

Counterfactual subgraphs explain Graph Neural Networks (GNNs) by answering the question: "How would the prediction change if a certain subgraph were absent in the input instance?" The differentiable proxy adjacency matrix is prevalent in current counterfactual subgraph discovery studies due to its ability to avoid exhaustive edge searching. However, a prediction gap exists when feeding the proxy matrix with continuous values and the thresholded discrete adjacency matrix to GNNs, compromising the optimization of the subgraph generator. Furthermore, the end-to-end learning schema adopted in the subgraph generator limits the diversity of counterfactual subgraphs. To this end, we propose CF-GFNExplainer, a flow-based approach for learning counterfactual subgraphs. CF-GFNExplainer employs a policy network with a discrete edge removal schema to construct counterfactual subgraph generation trajectories. Additionally, we introduce a reward and loss function designed to guide CF-GFNExplainer's optimization. The discrete adjacency matrix generated in each trajectory eliminates the prediction gap, enhancing the validity of the learned subgraphs. Furthermore, the multi-trajectories sampling strategy adopted in CF-GFNExplainer results in diverse counterfactual subgraphs. Extensive experiments conducted on synthetic and real-world datasets demonstrate the effectiveness of the proposed method in terms of validity and diversity. © 2023, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

An Encoder-Decoder Model Based On Spiking Neural Networks For Address Event Representation Object Recognition

引用

IEEE Transactions on Cognitive and Developmental systems 2025年

作者： Du, Sichun Zhu, Haodi Zhang, Yang Hong, Qinghui Hunan University College of Computer Science and Electronic Engineering Changsha418002 China Shenzhen University Computer Vision Institute School of Computer Science and Software Engineering National Engineering Laboratory for Big Data System Computing Technology Guangdong Key Laboratory of Intelligent Information Processing Shenzhen518060 China

Address event representation (AER) object recognition task has attracted extensive attention in neuromorphic vision processing. The spike-based and event-driven computation inherent in the spiking neural network (SNN) provides an energy-saving solution for AER object recognition. However, SNN with spike timing dependent plasticity (STDP) learning rule has not achieved satisfying AER object recognition performance. This work proposes an SNN-based encoder-decoder model to improve the recognition performance of AER objects. An STDP-based locally connected spiking neural network (LC-SNN) is proposed as an encoder to extract rich spatiotemporal features from AER event flows more flexibly. After the encoder extracts and learns primary features, we propose a fully connected spiking neural network (FC-SNN) based on the reward-modulated spike-timing-dependent plasticity (R-STDP) learning rule as a decoder to learn higher-level features for classification. In addition, we improved the winner-take-all (WTA) mechanisms and R-STDP learning rule in the decoder based on the reward and punish decision, enabling the network to perform better. The experiments are performed on the N-MNIST, MNIST-DVS, and the DVS Gesture datasets, improving the accuracy of the best existing plasticity-based SNN by 0.19%, 0.27% and 1.35%, respectively. © 2016 IEEE.

关键词： Decoding

来源：评论

学校读者我要写书评

暂无评论

A Large-Scale Empirical Study on Semantic Versioning in Golang Ecosystem 23

A Large-Scale Empirical Study on Semantic Versioning in Gola...

引用

Proceedings of the 38th IEEE/ACM International Conference on Automated Software Engineering

作者： Wenke Li Feng Wu Cai Fu Fan Zhou School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China AND Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security Platform and Content Group Tencent Technology (Shenzhen) Co.Ltd Shenzhen China

ISBN: (纸本)9798350329964

Third-party libraries (TPLs) have become an essential component of software, accelerating development and reducing maintenance costs. However, breaking changes often occur during the upgrades of TPLs and prevent client programs from moving forward. Semantic versioning (SemVer) has been applied to standardize the versions of releases according to compatibility, but not all releases follow SemVer compliance. Lots of work focuses on SemVer compliance in ecosystems such as Java and JavaScript beyond Golang (Go for short). Due to the lack of tools to detect breaking changes and dataset for Go, developers of TPLs do not know if breaking changes occur and affect client programs, and developers of client programs may hesitate to upgrade dependencies in terms of breaking *** bridge this gap, we conduct the first large-scale empirical study in the Go ecosystem to study SemVer compliance in terms of breaking changes and their impact. In detail, we propose GoSVI (Go Semantic Versioning Insight) to detect breaking changes and analyze their impact by resolving identifiers in client programs and comparing their types with breaking changes. Moreover, we collect the first large-scale Go dataset with a dependency graph from GitHub, including 124K TPLs and 532K client programs. Based on the dataset, our results show that 86.3% of library upgrades follow SemVer compliance and 28.6% of no-major upgrades introduce breaking changes. Furthermore, the tendency to comply with SemVer has improved over time from 63.7% in 2018/09 to 92.2% in 2023/03. Finally, we find 33.3% of downstream client programs may be affected by breaking changes. These findings provide developers and users of TPLs with valuable insights to help make decisions related to SemVer.

关键词： semantic versioning

来源：评论

学校读者我要写书评

暂无评论

A Novel Hybrid Method for Fault Diagnosis of Industrial Equipment Based on Vibration Signals 14

A Novel Hybrid Method for Fault Diagnosis of Industrial Equi...

引用

14th IEEE Global Reliability and Prognostics and Health Management Conference, PHM-Hangzhou 2023

作者： Tao, Sen Wang, Kai Zeng, Peng Yu, Tianda Wu, Hao Key Laboratory of Networked Control Systems Chinese Academy of Sciences Shenyang110169 China Shenyang Institute of Automation Chinese Academy of Sciences Shenyang110169 China Institutes for Robotics and Intelligent Manufacturing Chinese Academy of Sciences Shenyang110169 China University of Chinese Academy of Sciences Beijing100049 China Nuclear Power Institute of China Chengdu610213 China State Key Laboratory of Power Transmission Equipment & System Security and New Technology Chongqing University Chongqing400044 China

ISBN: (纸本)9798350301359

Industrial equipment reliability is a critical issue that smart manufacturing systems must address. Implementation of online fault diagnosis for industrial equipment is a promising technology that can improve equipment reliability. Vibration analysis is a popular technique for equipment condition monitoring. For the non-linear and non-stationary features of industrial vibration signals, a hybrid model based on wavelet transform (WT), support vector machine (SVM), and grey wolf optimization algorithm (GWO) is proposed. The time-frequency domain features of fault signals are extracted by wavelet transform to solve the non-linearity of signals, and the obtained feature vectors are input into SVM for classification. Aiming at the problem of setting penalty coefficient and kernel function parameters, GWO is introduced to seek hyperparameters by using the hunting principle of wolves. In the experimental part, firstly, the comparison of the GWO-WT-SVM, GWO-SVM and SVM models was carried out. Secondly, Comparison with classical classification algorithms is made. Apparently, the GWO-WT-SVM model achieves higher accuracy than other models in bearing fault diagnosis. © 2023 IEEE.

关键词： component Fault diagnosis GWO PHM SVM

来源：评论

学校读者我要写书评

暂无评论

Indoor Navigation Mechanism based on 5G network for Large Parking Garage

Indoor Navigation Mechanism based on 5G network for Large Pa...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Xiaolong Xu Qun Ding Licheng Lin School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China Jiangsu Key Laboratory Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

With the increase of car ownership in China, the problem of difficult parking in cities has become more and more serious. In large parking garage, finding an ideal parking space has become a daily problem for people; especially during the peak usage period of parking garage, a large number of vehicles will be driven into the parking garage, which will bring congestion, and at the same time, the demand of a large number of users in the area will lead to network congestion under 4G network, and users cannot access the network to check and find parking spaces. Therefore, this paper proposes a global optimal navigation mechanism with 5G network based on the above mentioned problems by analyzing the congestion situation during the peak usage of the parking garage. This mechanism uses an optimal parking space selection model and a global optimal scheduling model that can avoid congestion. Based on the model proposed in this paper, we construct a navigation planning system based on mobile, front-end and back-end. With the ultra-low latency, ultrahigh transmission efficiency and reliability of 5G network, the mobile port can select the optimal parking space according to the user's preference, and the back-end can show the parking space and congestion in the parking garage in real time according to the actual situation of the parking garage. Finally, the performance of the model and system proposed in this paper is verified through experiments.

关键词：

来源：评论

学校读者我要写书评

暂无评论

ANIMC: A Soft Approach for Autoweighted Noisy and Incomplete Multiview Clustering

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2022年第2期3卷 192-206页

作者： Fang, Xiang Hu, Yuchong Zhou, Pan Wu, Dapeng Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering The School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China Key Laboratory of Information Storage System Ministry of Education of China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China Department of Electrical and Computer Engineering University of Florida GainesvilleFL32611 United States

Multiview clustering has wide real-world applications because it can process data from multiple sources. However, these data often contain missing instances and noises, which are ignored by most multiview clustering methods. Missing instances may make these methods difficult to use directly, and noises will lead to unreliable clustering results. In this article, we propose a novel autoweighted noisy and incomplete multiview clustering (ANIMC) approach via a soft autoweighted strategy and a doubly soft regular regression model. First, by designing adaptive semiregularized nonnegative matrix factorization, the soft autoweighted strategy assigns a proper weight to each view and adds a soft boundary to balance the influence of noises and incompleteness. Second, by proposing θ-norm, the doubly soft regularized regression model adjusts the sparsity of our model by choosing different θ. Compared with previous methods, ANIMC has three unique advantages: 1) it is a soft algorithm to adjust our approach in different scenarios, thereby improving its generalization ability;2) it automatically learns a proper weight for each view, thereby reducing the influence of noises;3) it performs doubly soft regularized regression that aligns the same instances in different views, thereby decreasing the impact of missing instances. Extensive experimental results show its superior advantages over other state-of-the-art works. © 2020 IEEE.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Study on Pedestrian Evacuation Model Base on Reinforcement Learning

SSRN

引用

SSRN 2024年

作者： Rui, Zhu Hu, Jun Ling, Fan Qi, Zhang Juan, Wei School of Computing and Artificial Intelligence Southwest Jiaotong University Chengdu611756 China Key Laboratory of Interior Layout Optimization and Security Institutions of Higher Education of Sichuan Province Chengdu Normal University Chengdu611130 China School of Intelligent Manufacturing Chengdu Technological University Chengdu611730 China Key Laboratory of Multidimensional Data Sensing and Intelligent Information Processing Dazhou Key Laboratory Dazhou635000 China

This paper proposed a pedestrian evacuation model combined with reinforcement learning in order to study how to better guide pedestrians to complete evacuation in specific indoor scenes. This model introduced the way of establishing a scene in cellular automata and formulated reward rules according to the characteristics of the scene. It fitted the psychological activities of pedestrians in the actual evacuation process and trained the strategy of pedestrians at the overall level through the Q-learning algorithm from the reinforcement learning area. A speed control mechanism combined with real statistical data was introduced to simulate the speed attenuation. A simulation platform was built to compare the evacuation conditions under different scenarios and the different total numbers of pedestrians. The research showed that the model could automatically realize the exit selection function of pedestrians and part of conformity behavior. In the same evacuation scenario, this model could show adaptability for the different total numbers of pedestrians. © 2024, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Gradient Boosting-Accelerated Evolution for Multiple-Fault Diagnosis

Gradient Boosting-Accelerated Evolution for Multiple-Fault D...

引用

Design, Automation and Test in Europe Conference and Exhibition

作者： Hongfei Wang Chenliang Luo Deqing Zou Hai Jin Wenjie Cai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Wuhan China Hubei Engineering Research Center on Big Data Security Hubei Key Laboratory of Distributed System Security School of Cyber Science and Engineering Wuhan China Huazhong University of Science and Technology Wuhan China Cluster and Grid Computing Lab School of Computer Science and Technology Wuhan China College of Public Administration Wuhan China

ISBN: (数字)9783981926385

ISBN: (纸本)9798350348606

Logic diagnosis is a key step in yield learning. Multiple faults diagnosis is challenging because of several reasons, including error masking, fault reinforcement, and huge search space for possible fault combinations. This work proposes a two-phase method for multiple-fault diagnosis. The first phase efficiently reduces the potential number of fault candidates through machine learning. The second phase obtains the final diagnosis results, by formulating the task as an combinational optimization problem that is later iteratively solved using binary evolution computation. Experiments shows that our method outperforms two existing methods for multiple-fault diagnosis, and achieves better diagnosability (improved by $1.87\times$ ) and resolution (improved by $1.42\times$ ) compared with a state-of-the-art commercial diagnosis tool.

关键词： Fault diagnosis Adaptation models Computational modeling Fitting Filtering algorithms Boosting Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

FP-WDDQN: An improved deep reinforcement learning algorithm for adaptive traffic signal control

FP-WDDQN: An improved deep reinforcement learning algorithm ...

引用

IEEE International Conference on data Mining Workshops (ICDM Workshops)

作者： Xiao Zhang Xiaolong Xu Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China

Current adaptive traffic signal control methods based on centralized deep reinforcement learning are not applicable in large-scale adaptive traffic control environment. The scalability problem is overcome by assigning global control to each local RL agent through multi-intelligence reinforcement learning, but the environment now becomes partially visible ami non-stationarity from the perspective of each local agent due to limited communication between agents. In this paper, we propose a multi-agent framework called Forgetful Priority Weighed Double Deep Q-learning (FP-WDDQN). We firstly extend Weighted Double Deep Q-Learning(WDDQN) to the multi agent domain, so as to reduce the error caused by the algorithm's underestimation of the target network and get more accurate Q-value. Then we propose a new algorithm based on Forgetful Experience Mechanism(FEM) and Priority Experience Replay Mechanism(PERM). This mechanism makes WDDQN choose experience based on Temporal Difference (TD) error and Identify the importance of experience with FEM. It makes WDDQN preferentially select experience with high TD-error in the process of sampling and training its network based on FEM and TD-error, which improved the model training efficiency and stabilized the learning process. In this paper, we construct an urban traffic network with seven intersections in the simulation platform called Simulation of Urban MObility(SUMO), and the proposed FP-WDDQN is compared against Independent Double Deep Q-learning(IDDQN), WDDQN and Multi-agent Advantage Actor Critic (MA2C) under the condition of simulating the traffic dynamics of peak hours. Experiment shows FP-WDDQN has better performance than other algorithms in vehicle speed, intersection delay and intersection waiting queue length.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：