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

Unsupervised feature selection via multiple graph fusion and feature weight learning

science China(Information sciences) 2023年第5期66卷 56-72页

作者： Chang TANG Xiao ZHENG Wei ZHANG Xinwang LIU Xinzhong ZHU En ZHU School of Computer Science China University of Geosciences State Key Laboratory for Novel Software Technology Nanjing University School of Computer National University of Defense Technology National Supercomputing Center in Jinan Qilu University of Technology (Shandong Academy of Sciences) College of Mathematics Physics and Information Engineering Zhejiang Normal University

Unsupervised feature selection attempts to select a small number of discriminative features from original high-dimensional data and preserve the intrinsic data structure without using data labels. As an unsupervised learning task, most previous methods often use a coefficient matrix for feature reconstruction or feature projection, and a certain similarity graph is widely utilized to regularize the intrinsic structure preservation of original data in a new feature space. However, a similarity graph with poor quality could inevitably afect the final results. In addition, designing a rational and efective feature reconstruction/projection model is not easy. In this paper, we introduce a novel and efective unsupervised feature selection method via multiple graph fusion and feature weight learning（MGF2WL） to address these issues. Instead of learning the feature coefficient matrix, we directly learn the weights of diferent feature dimensions by introducing a feature weight matrix, and the weighted features are projected into the label space. Aiming to exploit sufficient relation of data samples, we develop a graph fusion term to fuse multiple predefined similarity graphs for learning a unified similarity graph, which is then deployed to regularize the local data structure of original data in a projected label space. Finally, we design a block coordinate descent algorithm with a convergence guarantee to solve the resulting optimization problem. Extensive experiments with sufficient analyses on various datasets are conducted to validate the efficacy of our proposed MGF2WL.

关键词： unsupervised feature selection graph fusion feature weight learning local structure preservation

来源：评论

学校读者我要写书评

暂无评论

Rendering discrete participating media using geometrical optics approximation

引用

Computational Visual Media 2022年第3期8卷 425-444页

作者： Jie Guo Bingyang Hu Yanjun Chen Yuanqi Li Yanwen Guo Ling-Qi Yan State Key Lab for Novel Software Technology Nanjing UniversityNanjing 210023China Department of Computer Science UC Santa BarbaraUSA

We consider the scattering of light in participating media composed of sparsely and randomly distributed discrete *** particle size is expected to range from the scale of the wavelength to several orders of magnitude greater,resulting in an appearance with distinct graininess as opposed to the smooth appearance of continuous *** fundamental issue in the physically-based synthesis of such appearance is to determine the necessary optical properties in every local *** these properties vary spatially,we resort to geometrical optics approximation(GOA),a highly efficient alternative to rigorous Lorenz–Mie theory,to quantitatively represent the scattering of a single *** enables us to quickly compute bulk optical properties for any particle size *** then use a practical Monte Carlo rendering solution to solve energy transfer in the discrete participating *** proposed framework is the first to simulate a wide range of discrete participating media with different levels of graininess,converging to the continuous media case as the particle concentration increases.

关键词： light scattering geometrical optics approximation(GOA) discrete participating media volume rendering

来源：评论

学校读者我要写书评

暂无评论

MSEs Credit Risk Assessment Model Based on Federated Learning and Feature Selection

引用

computers, Materials & Continua 2023年第6期75卷 5573-5595页

作者： Zhanyang Xu Jianchun Cheng Luofei Cheng Xiaolong Xu Muhammad Bilal School of Computer and Software Nanjing University of Information Science&TechnologyNanjing210044China State Key Laboratory Novel Software Technology Nanjing UniversityNanjing210023China Department of Computer and Electronics Systems Engineering Hankuk University of Foreign StudiesYongin-siGyeonggi-do17035Korea

Federated learning has been used extensively in business inno-vation scenarios in various *** research adopts the federated learning approach for the first time to address the issue of bank-enterprise information asymmetry in the credit assessment ***,this research designs a credit risk assessment model based on federated learning and feature selection for micro and small enterprises(MSEs)using multi-dimensional enterprise data and multi-perspective enterprise *** proposed model includes four main processes:namely encrypted entity alignment,hybrid feature selection,secure multi-party computation,and global model ***,a two-step feature selection algorithm based on wrapper and filter is designed to construct the optimal feature set in multi-source heterogeneous data,which can provide excellent accuracy and *** addition,a local update screening strategy is proposed to select trustworthy model parameters for aggregation each time to ensure the quality of the global *** results of the study show that the model error rate is reduced by 6.22%and the recall rate is improved by 11.03%compared to the algorithms commonly used in credit risk research,significantly improving the ability to identify ***,the business operations of commercial banks are used to confirm the potential of the proposed model for real-world implementation.

关键词： Federated learning feature selection credit risk assessment MSEs

来源：评论

学校读者我要写书评

暂无评论

On the convergence and improvement of stochastic normalized gradient descent

引用

science China(Information sciences) 2021年第3期64卷 105-117页

作者： Shen-Yi ZHAO Yin-Peng XIE Wu-Jun LI National Key Laboratory for Novel Software Technology Department of Computer Science and TechnologyNanjing University

Non-convex models, like deep neural networks, have been widely used in machine learning applications. Training non-convex models is a difficult task owing to the saddle points of models. Recently,stochastic normalized gradient descent(SNGD), which updates the model parameter by a normalized gradient in each iteration, has attracted much attention. Existing results show that SNGD can achieve better performance on escaping saddle points than classical training methods like stochastic gradient descent(SGD).However, none of the existing studies has provided theoretical proof about the convergence of SNGD for non-convex problems. In this paper, we firstly prove the convergence of SNGD for non-convex ***, we prove that SNGD can achieve the same computation complexity as SGD. In addition, based on our convergence proof of SNGD, we find that SNGD needs to adopt a small constant learning rate for convergence guarantee. This makes SNGD do not perform well on training large non-convex models in practice. Hence, we propose a new method, called stagewise SNGD(S-SNGD), to improve the performance of SNGD. Different from SNGD in which a small constant learning rate is necessary for convergence guarantee,S-SNGD can adopt a large initial learning rate and reduce the learning rate by stage. The convergence of S-SNGD can also be theoretically proved for non-convex problems. Empirical results on deep neural networks show that S-SNGD achieves better performance than SNGD in terms of both training loss and test accuracy.

关键词： non-convex problems stochastic normalized gradient descent computation complexity

来源：评论

学校读者我要写书评

暂无评论

An Improved Framework for Pedestrian Tracking and Counting Based on DeepSORT 20th

An Improved Framework for Pedestrian Tracking and Counting...

引用

20th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2023

作者： Tao, Yanxin Zheng, Jiping College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China State Key Laboratory for Novel Software Technology Nanjing University Nanjing China

ISBN: (纸本)9789819970247

Due to the rapid growth in the demand for crowd analysis and monitoring methods, there is an urgent need for pedestrian tracking and counting methods that are more efficient, accurate, and reliable. However, the existing trackers and counters rarely have the three characteristics of efficiency, accuracy and reliability simultaneously. Therefore, we propose a framework named FR-DeepSORT for tracking and counting pedestrians based on DeepSORT. FR-DeepSORT first selects the YOLOv5 network as the object detector. Then the Re-ID information is combined with IoU to construct a cost matrix to improve the tracker by introducing FastReID. Finally, FR-DeepSORT introduces vector cross product and combines the tracking results to monitor the pedestrian crossing dynamics. The experimental results on the MOT tracking benchmark datasets show that the accuracy of our tracker is 89.38%, and the IDF1 value is 82.45%, which are competitive and more reliable to existing tracking methods. The counter error rate is also superior in the real-time dynamic statistical accuracy of the crowd. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd 2024.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Meaningful Update and Repair of Markov Decision Processes for Self-Adaptive Systems

引用

Journal of computer science & technology 2022年第1期37卷 106-127页

作者： Wen-Hua Yang Min-Xue Pan Yu Zhou Zhi-Qiu Huang College of Computer Science and Technology Nanjing University of Aeronautics and AstronauticsNanjing 211106China State Key Laboratory for Novel Software Technology Nanjing UniversityNanjing 210093China Collaborative Innovation Center of Novel Software Technology and Industrialization Nanjing UniversityNanjing 210023China

Self-adaptive systems are able to adjust their behaviour in response to environmental condition changes and are widely deployed as *** as a promising way to handle the ever-growing complexity of software systems,they have seen an increasing level of interest and are covering a variety of applications,e.g.,autonomous car systems and adaptive network *** approaches for the construction of self-adaptive systems have been developed,and probabilistic models,such as Markov decision processes(MDPs),are one of the ***,the majority of them do not deal with the problems of the underlying MDP being obsolete under new environments or unsatisfactory to the given *** results in the generated policies from such MDP failing to guide the self-adaptive system to run correctly and meet *** this article,we propose a systematic approach to updating an obsolete MDP by exploring new states and transitions and removing obsolete ones,and repairing an unsatisfactory MDP by adjusting its structure in a more meaningful way rather than arbitrarily changing the transition probabilities to values not in line with *** results show that the MDPs updated and repaired by our approach are more competent in guiding the self-adaptive systems’correct running compared with the original ones.

关键词： self-adaptive system Markov decision process model repair

来源：评论

学校读者我要写书评

暂无评论

When debugging encounters artificial intelligence: state of the art and open challenges

引用

science China(Information sciences) 2024年第4期67卷 42-84页

作者： Yi SONG Xiaoyuan XIE Baowen XU School of Computer Science Wuhan University State Key Laboratory of Novel Software Technology Nanjing University

Both software debugging and artificial intelligence techniques are hot topics in the current field of software engineering. Debugging techniques, which comprise fault localization and program repair, are an important part of the software development lifecycle for ensuring the quality of software systems. As the scale and complexity of software systems grow, developers intend to improve the effectiveness and efficiency of software debugging via artificial intelligence(artificial intelligence for software debugging, AI4SD). On the other hand, many artificial intelligence models are being integrated into safety-critical areas such as autonomous driving, image recognition, and audio processing, where software debugging is highly necessary and urgent(software debugging for artificial intelligence, SD4AI). An AI-enhanced debugging technique could assist in debugging AI systems more effectively, and a more robust and reliable AI approach could further guarantee and support debugging techniques. Therefore, it is important to take AI4SD and SD4AI into consideration comprehensively. In this paper, we want to show readers the path, the trend, and the potential that these two directions interact with each other. We select and review a total of 165 papers in AI4SD and SD4AI for answering three research questions, and further analyze opportunities and challenges as well as suggest future directions of this cross-cutting area.

关键词： software debugging fault localization program repair artificial intelligence machine learning

来源：评论

学校读者我要写书评

暂无评论

DeepTD: Diversity-Guided Deep Neural Network Test Generation 9th

DeepTD: Diversity-Guided Deep Neural Network Test Generation

引用

9th International Symposium on Dependable software Engineering: Theories, Tools and Applications, SETTA 2023

作者： Zhu, Jin Tao, Chuanqi Guo, Hongjing Ju, Yue College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China Ministry Key Laboratory for Safety-Critical Software Development and Verification Nanjing China State Key Laboratory for Novel Software Technology Nanjing China Collaborative Innovation Center of Novel Software Technology and Industrialization Nanjing China

ISBN: (纸本)9789819986637

Coverage-guided Fuzz Testing (CGF) techniques have been applied to deep neural network (DNN) testing in recent years, generating a significant number of test samples to uncover inherent defects in DNN models. However, the effectiveness of CGF techniques that utilize structured coverage metrics as coverage criteria is currently being questioned. A few unstructured coverage metrics, such as surprise adequacy, only take into account the diversity of the test samples against the training set, while ignoring the diversity of the test samples themselves. In addition to this, the existing surprise adequacy metrics have some limitations in their applications. Therefore, this paper proposes DeepTD, a diversity-guided deep neural networks test generation method. Firstly, DeepTD selects high-loss test samples from each class on average, ensuring these test seeds possess a strong ability to reveal model errors. Then, DeepTD transforms these test seeds to enhance the diversity of the generated samples. Finally, Cluster-based Surprise Adequacy is designed to guide the generation of test samples. To evaluate the effectiveness of DeepTD, six DNN models are selected as subjects, covering two well-known image datasets. Experimental results demonstrate that the Cluster-based Surprise Adequacy outperforms the two existing metrics not only in computational efficiency but also in discovering more model defects. What’s more, the test samples generated by DeepTD are on average 6.04% and 3.24% more effective for model retraining in MNIST and CIFAR10 compared to baseline methods, respectively. © 2024, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Coverage-guided fuzz testing Deep neural network Test generation Test samples diversity

来源：评论

学校读者我要写书评

暂无评论

AutoAC: Towards Automated Attribute Completion for Heterogeneous Graph Neural Network 39

AutoAC: Towards Automated Attribute Completion for Heterogen...

引用

39th IEEE International Conference on Data Engineering, ICDE 2023

作者： Zhu, Guanghui Zhu, Zhennan Wang, Wenjie Xu, Zhuoer Yuan, Chunfeng Huang, Yihua Nanjing University State Key Laboratory for Novel Software Technology Nanjing China Nanjing University Department of Computer Science and Technology Nanjing China

ISBN: (纸本)9798350322279

Many real-world data can be modeled as heterogeneous graphs that contain multiple types of nodes and edges. Meanwhile, due to excellent performance, heterogeneous graph neural networks (GNNs) have received more and more attention. However, the existing work mainly focuses on the design of novel GNN models, while ignoring another important issue that also has a large impact on the model performance, namely the missing attributes of some node types. The handcrafted attribute completion requires huge expert experience and domain knowledge. Also, considering the differences in semantic characteristics between nodes, the attribute completion should be fine-grained, i.e., the attribute completion operation should be node-specific. Moreover, to improve the performance of the downstream graph learning task, attribute completion and the training of the heterogeneous GNN should be jointly optimized rather than viewed as two separate processes. To address the above challenges, we propose a differentiable attribute completion framework called AutoAC for automated completion operation search in heterogeneous GNNs. We first propose an expressive completion operation search space, including topology-dependent and topology-independent completion operations. Then, we propose a continuous relaxation schema and further propose a differentiable completion algorithm where the completion operation search is formulated as a bi-level joint optimization problem. To improve the search efficiency, we leverage two optimization techniques: discrete constraints and auxiliary unsupervised graph node clustering. Extensive experimental results on real-world datasets reveal that AutoAC outperforms the SOTA handcrafted heterogeneous GNNs and the existing attribute completion method. © 2023 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Towards optimized tensor code generation for deep learning on sunway many-core processor

引用

Frontiers of computer science 2024年第2期18卷 1-15页

作者： Mingzhen LI Changxi LIU Jianjin LIAO Xuegui ZHENG Hailong YANG Rujun SUN Jun XU Lin GAN Guangwen YANG Zhongzhi LUAN Depei QIAN State Key Laboratory of Software Development Environment Beijing 100191China School of Computer Science and Engineering Beihang UniversityBeijing 100191China National University of Singapore Singapore 119077Singapore State Key Laboratory of Mathematical Engineering and Advanced Computing Wuxi 214000China Science and Technology on Special System Simulation Laboratory Beijing Simulation Center Beijing 100854China Department of Computer Science and Technology Tsinghua UniversityBeijing 100084China

The flourish of deep learning frameworks and hardware platforms has been demanding an efficient compiler that can shield the diversity in both software and hardware in order to provide application *** the existing deep learning compilers,TVM is well known for its efficiency in code generation and optimization across diverse hardware *** the meanwhile,the Sunway many-core processor renders itself as a competitive candidate for its attractive computational power in both scientific computing and deep learning *** paper combines the trends in these two ***,we propose swTVM that extends the original TVM to support ahead-of-time compilation for architecture requiring cross-compilation such as *** addition,we leverage the architecture features during the compilation such as core group for massive parallelism,DMA for high bandwidth memory transfer and local device memory for data locality,in order to generate efficient codes for deep learning workloads on *** experiment results show that the codes generated by swTVM achieve 1.79x improvement of inference latency on average compared to the state-of-the-art deep learning framework on Sunway,across eight representative *** work is the first attempt from the compiler perspective to bridge the gap of deep learning and Sunway processor particularly with productivity and efficiency in *** believe this work will encourage more people to embrace the power of deep learning and Sunwaymany-coreprocessor.

关键词： sunway processor deep learning compiler code generation performance optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：