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

31st IEEE International Conference on Software Analysis, Evolution and Reengineering, SANER 2024

作者： Chen, Kang Wen, Ming Jia, Haoxiang Wu, Rongxin Jin, Hai Wuhan430074 China Jin YinHu Laboratory Wuhan430074 China School of Informatics Xiamen University Xiamen361005 China School of Computer Science and Technology HUST Wuhan430074 China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab China Hubei Engineering Research Center on Big Data Security Hubei Key Laboratory of Distributed System Security China Cluster and Grid Computing Lab China

ISBN: (纸本)9798350330663

Software systems often encounter various errors or exceptions in practice, and thus proper error handling code is essential to ensure the reliability of software systems. Unfortunately, error handling code is often bug-prone, while sufficiently testing them is challenging as such code often cannot be triggered under normal conditions. Motivated by this, recent studies have proposed to leverage software fault injection (SFI) based fuzzing to discover potential bugs in complicated error handling code. Despite the promising results achieved, their effectiveness and efficiency are still compromised in practice due to the huge search space of error sites, inadequate fuzzing guidance, and the overhead induced by context-sensitive SFI. To achieve effective and efficient testing of error handling code, this study presents AFL-FI, which first utilizes a similarity-based method to identify suspicious error sites, and then incorporates the idea of error site coverage to guide the fuzzing process. Finally, the design of lightweight context-sensitive SFI enables AFL-FI to execute test cases efficiently. We evaluate AFL-FI on eight large-scale open-source projects, and the results show that it can outperform existing state-of-the-art fuzzing tools significantly in terms of branch code coverage. More importantly, AFL-FI has discovered 13 previously unknown bugs, and all of them have been confirmed while 12 of them have been fixed. Besides, our evaluation also demonstrates that all the key designs of AFL-F I are effective that contribute significantly to its overall performance. © 2024 IEEE.

关键词： Errors

来源：评论

学校读者我要写书评

暂无评论

FedLMT: Tackling System Heterogeneity of Federated Learning via Low-Rank Model Training with Theoretical Guarantees 41

FedLMT: Tackling System Heterogeneity of Federated Learning ...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Liu, Jiahao Zhou, Yipeng Wu, Di Hu, Miao Guizani, Mohsen Sheng, Quan Z. School of Computer Science and Engineering Sun Yat-sen University Guangzhou China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China School of Computing Faculty of Science and Engineering Macquarie University Sydney Australia Abu Dhabi United Arab Emirates

Federated learning (FL) is an emerging machine learning paradigm for preserving data privacy. However, diverse client hardware often has varying computation resources. Such system heterogeneity limits the participation of resource-constrained clients in FL, and hence degrades the global model accuracy. To enable heterogeneous clients to participate in and contribute to FL training, previous works tackle this problem by assigning customized sub-models to individual clients with model pruning, distillation, or low-rank based techniques. Unfortunately, the global model trained by these methods still encounters performance degradation due to heterogeneous sub-model aggregation. Besides, most methods are heuristic-based and lack convergence analysis. In this work, we propose the FedLMT framework to bridge the performance gap, by assigning clients with a homogeneous pre-factorized low-rank model to substantially reduce resource consumption without conducting heterogeneous aggregation. We theoretically prove that the convergence of the low-rank model can guarantee the convergence of the original full model. To further meet clients' personalized resource needs, we extend FedLMT to pFedLMT, by separating model parameters into common and custom ones. Finally, extensive experiments are conducted to verify our theoretical analysis and show that FedLMT and pFedLMT outperform other baselines with much less communication and computation costs. Copyright 2024 by the author(s)

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

The Classification of Motor Imagery EEG Signals Based on the Time-Frequency-Spatial Feature 10

The Classification of Motor Imagery EEG Signals Based on the...

引用

10th IEEE data Driven Control and Learning Systems Conference, DDCLS 2021

作者： Deng, Xin Zhang, Boxian Liu, Ke Wang, Jin Yang, Pengfei Hu, Chengxin Key Laboratory of Data Engineering and Visual Computing College of Computer Science and Technology Chongqing University of Posts and Telecommunication Chongqing400065 China

ISBN: (纸本)9781665424233

The effective features of the motor imagery (MI) electroencephalogram (EEG) signals plays a significant role to improve the classification accuracy for the brain-computer interface (BCI) system. Some traditional methods usually extract the frequency or spatial features without considering the related information between different channels that would affect the classification performance. This paper proposes a new method for feature extraction of EEG signals based on the fusion of time-frequency and spatial features. At the beginning, the common spatial pattern (CSP) algorithm is adopted to extract the spatial features. Then the discrete wavelet transform (DWT) and the wavelet packet decomposition (WPD) are used to extract the μ rhythm of the motor imagery EEG signals as the time-frequency features. After that, by combining the spatial and time-frequency features, the time-frequency-spatial feature is formed. Based on different kinds of features, the experimental data are classified by using the support vector machine (SVM), as well as the sparse representation classification (SRC) algorithm with the elastomeric network (EN) and L1 norm, respectively. The experimental results show that the SRC with EN has a better performance on either the time-frequency feature or spatial feature than the SRC with L1 norm does. In contrast, the SVM and the SRC with Ll norm perform better than the SRC with EN based on the time-frequency-spatial feature. The study concludes that the time-frequency-spatial feature cooperating with the certain classifiers can achieve the good classification effect for the MI EEG signals, which not only reduces the operation time but also improves the classification accuracy. © 2021 IEEE.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Gradient-Based Differential kWTA Network With Application to Competitive Coordination of Multiple Robots

引用

IEEE/CAA Journal of Automatica Sinica 2022年第8期9卷 1452-1463页

作者： Mei Liu Xiaoyan Zhang Mingsheng Shang Long Jin School of Information Science and Engineering Lanzhou UniversityLanzhou 730000 State Key Laboratory of Tibetan Intelligent Information Processing and Application Xining 810016China Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent TechnologyChinese Academy of SciencesChongqing 400714China Shenzhen Research Institute Lanzhou UniversityShenzhen 518063China

Aiming at the k-winners-take-all(kWTA)operation,this paper proposes a gradient-based differential kWTA(GDk WTA)*** obtaining the network,theorems and related proofs are provided to guarantee the exponential convergence and noise resistance of the proposed GD-kWTA ***,numerical simulations are conducted to substantiate the preferable performance of the proposed network as compared with the traditional ***,the GD-k WTA network,backed with a consensus filter,is utilized as a robust control scheme for modeling the competition behavior in the multi-robot coordination,thereby further demonstrating its effectiveness and feasibility.

关键词： Consensus filter k-winners-take-all(kWTA) multirobot coordination noise resistance

来源：评论

学校读者我要写书评

暂无评论

Accumulative Time Based Ranking Method to Reputation Evaluation in Information Networks

引用

Journal of Computer Science & Technology 2022年第4期37卷 960-974页

作者： Hao Liao Qi-Xin Liu Ze-Cheng Huang Ke-Zhong Lu Chi Ho Yeung Yi-Cheng Zhang National Engineering Laboratory on Big Data System Computing Technology College of Computer Science and SoftwareEngineeringShenzhen UniversityShenzhen 518060China Guangdong Province Key Laboratory of Popular High Performance Computers Shenzhen UniversityShenzhen 518060China Guangdong Province Engineering Center of China-Made High Performance Data Computing System College of ComputerScience and Software EngineeringShenzhen UniversityShenzhen 518060China Institute of Big Data Intelligent Management and Decision Shenzhen UniversityShenzhen 518060China Department of Science and Environmental Studies The Education University of Hong KongHong Kong 999077China Department of Physics University of FribourgFribourg 1700Switzerland

Due to over-abundant information on the Web, information filtering becomes a key task for online users to obtain relevant suggestions and how to extract the most related item is always a key topic for researchers in various fields. In this paper, we adopt tools used to analyze complex networks to evaluate user reputation and item quality. In our proposed Accumulative Time Based Ranking (ATR) algorithm, we take into account the growth record of the network to identify the evolution of the reputation of users and the quality of items, by incorporating two behavior weighting factors which can capture the hidden facts on reputation and quality dynamics for each user and item respectively. Our proposed ATR algorithm mainly combines the iterative approach to rank user reputation and item quality with temporal dependence compared with other reputation evaluation methods. We show that our algorithm outperforms other benchmark ranking algorithms in terms of precision and robustness on empirical datasets from various online retailers and the citation datasets among research publications. Therefore, our proposed method has the capability to effectively evaluate user reputation and item quality.

关键词： temporal network behavior dynamics reputation evaluation ranking algorithm

来源：评论

学校读者我要写书评

暂无评论

Short-Term Traffic Flow Prediction Based on Ensemble Machine Learning Strategies 10

Short-Term Traffic Flow Prediction Based on Ensemble Machine...

引用

10th IEEE data Driven Control and Learning Systems Conference, DDCLS 2021

作者： Zeng, Ximu Wang, Yixiong Deng, Xin Wang, Jin Key Laboratory of Data Engineering and Visual Computing College of Computer Science and Technology Chongqing University of Posts and Telecommunication Chongqing400065 China

ISBN: (纸本)9781665424233

In order to solve the problem of traffic congestion, many city governments have begun to develop intelligent transportation systems. As a research hotspot in the field of intelligent transportation, the short-term traffic flow prediction is of great significance to traffic diversion and route planning. In the recent big data era, the machine learning (ML) algorithms have been applied to mining deep information in the data. However, the performance of a single ML model is usually not good. The ensemble learning can improve accuracy in most cases. In this paper, we propose a new short-term traffic flow prediction model. This paper regards the traffic prediction problem as a regression prediction problem, rather than a time series forecasting problem. The proposed model combines the prediction results of the XGBoost, LightGBM and CatBoost models through the ensemble machine learning strategy. With the experiments on real traffic data in Xi'an city, this paper has obtained the comparison of predictive performance of the models. Compared with single models such as the ARIMA, LSTM, XGBoost, LightGBM and CatBoost models, the results show the proposed model is more accurate and more suitable for short-time traffic status prediction. key Words: traffic prediction, ensemble learning, XGBoost, LightGBM, CatBoost © 2021 IEEE.

关键词： Traffic congestion

来源：评论

学校读者我要写书评

暂无评论

Machine Learning is All You Need: A Simple Token-Based Approach for Effective Code Clone Detection 24

Machine Learning is All You Need: A Simple Token-Based Appro...

引用

44th ACM/IEEE International Conference on Software engineering, ICSE 2024

作者： Feng, Siyue Suo, Wenqi Wu, Yueming Zou, Deqing Liu, Yang Jin, Hai Huazhong University of Science and Technology China Nanyang Technological University Singapore Hubei Engineering Research Center on Big Data Security Cluster and Grid Computing Lab National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security China Jinyinhu Laboratory Wuhan430074 China School of Cyber Science and Engineering Hust Wuhan430074 China School of Computer Science and Technology Hust Wuhan430074 China

ISBN: (纸本)9798400702174

As software engineering advances and the code demand rises, the prevalence of code clones has increased. This phenomenon poses risks like vulnerability propagation, underscoring the growing importance of code clone detection techniques. While numerous code clone detection methods have been proposed, they often fall short in real-world code environments. They either struggle to identify code clones effectively or demand substantial time and computational resources to handle complex clones. This paper introduces a code clone detection method namely Toma using tokens and machine learning. Specifically, we extract token type sequences and employ six similarity calculation methods to generate feature vectors. These vectors are then input into a trained machine learning model for classification. To evaluate the effectiveness and scalability of Toma, we conduct experiments on the widely used BigCloneBench dataset. Results show that our tool outperforms token-based code clone detectors and most tree-based clone detectors, demonstrating high effectiveness and significant time savings. © 2024 ACM.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Batch Selection for Multi-Label Classification Guided by Uncertainty and Dynamic Label Correlations

arXiv

引用

arXiv 2024年

作者： Zhou, Ao Liu, Bin Wang, Jin Tsoumakas, Grigorios Key Laboratory of Data Engineering and Visual Computing School of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing China School of Informatics Aristotle University of Thessaloniki Thessaloniki Greece

The accuracy of deep neural networks is significantly influenced by the effectiveness of mini-batch construction during training. In single-label scenarios, such as binary and multi-class classification tasks, it has been demonstrated that batch selection algorithms preferring samples with higher uncertainty achieve better performance than difficulty-based methods. Although there are two batch selection methods tailored for multi-label data, none of them leverage important uncertainty information. Adapting the concept of uncertainty to multi-label data is not a trivial task, since there are two issues that should be tackled. First, traditional variance or entropy-based uncertainty measures ignore fluctuations of predictions within sliding windows and the importance of the current model state. Second, existing multi-label methods do not explicitly exploit the label correlations, particularly the uncertainty-based label correlations that evolve during the training process. In this paper, we propose an uncertainty-based multi-label batch selection algorithm. It assesses uncertainty for each label by considering differences between successive predictions and the confidence of current outputs, and further leverages dynamic uncertainty-based label correlations to emphasize instances whose uncertainty is synergistically expressed across multiple labels. Empirical studies demonstrate the effectiveness of our method in improving the performance and accelerating the convergence of various multi-label deep learning models. Copyright © 2024, The Authors. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

BERD+: A Generic Sequential Recommendation Framework by Eliminating Unreliable data with Item- and Attribute-level Signals

引用

ACM Transactions on Information Systems 2023年第2期42卷 1-33页

作者： Sun, Yatong Yang, Xiaochun Sun, Zhu Wang, Bin School of Computer Science and Engineering Northeastern University School of Computing Macquarie University China Australia Institute of High Performance Computing Centre for Frontier AI Research A*STAR Singapore School of Computer Science and Engineering Northeastern University China National Frontiers Science Center for Industrial Intelligence and Systems Optimization China Key Laboratory of Data Analytics and Optimization for Smart Industry [Northeastern University Ministry of Education China

A preliminary work of our study was published at IJCAI’21 [47], which is substantially extended in the following aspects: (1) In Section 1, we analyze the necessity of introducing item attributes for detecting unreliable instances, together with the problems and challenges that attributes may bring in. (2) In Section 2, we add discussions about the limitations of existing attribute-aware recommender systems (Section 2.2) and denoising methods (Section 2.3) in the context of detecting unreliable instances. (3) In Section 4.2, we further conduct an in-depth analysis at the attribute level to demonstrate the capability of attributes for rectifying instance loss and uncertainty, as well as the disturbance caused by attributes. (4) We generalize BERD to a generic framework BERD+ in Section 5.1, equipped with novel modules, i.e., HU-GCN (Section 5.2) and EPE (Section 5.4), which properly incorporate item attributes while reducing their disturbance for rectifying instance uncer tainty (Section 5.5) and loss (Section 5.6). The generic BERD+ can be flexibly plugged into existing SRSs for performance enhanced recommendation via eliminating unreliable data. (5) In Section 6.2, we apply our BERD+ framework to seven state-of-the-art SRSs on five real-world datasets to illustrate its superiority. (6) To avoid unfair comparison caused by item attributes, we build and compare with the baseline that combines the original BERD and an advanced attribute-aware recommender system, KSR [19]. (7) For more comprehensive comparison, in Section 6.2.2, we compare BRED+ with two state-of-the-art denoising approaches;in Section 6.2.3, to examine the efficacy of HU-GCN and EPE, we compare HU-GCN with various attribute embedding techniques, i.e., variants of graph neural networks, and compare EPE with different attribute fusing methods, i.e., adding, concatenation, and weighted sum. (8) In Section 6.2.4, a detailed ablation study is conducted to verify the effectiveness of each module of BERD+. (

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

A Fine-Grained Anomaly Detection Method Fusing Isolation Forest and Knowledge Graph Reasoning 19th

A Fine-Grained Anomaly Detection Method Fusing Isolation For...

引用

19th International Conference on Web Information Systems and Applications, WISA 2022

作者： Xu, Jie Zhou, Jiantao College of Computer Science Engineering Research Center of Ecological Big Data Ministry of Education National and Local Joint Engineering Research Center of Mongolian Intelligent Information Processing Technology Inner Mongolia Cloud Computing and Service Software Engineering Laboratory Inner Mongolia Social Computing and Data Processing Key Laboratory Inner Mongolia Discipline Inspection and Supervision Big Data Key Laboratory Inner Mongolia Big Data Analysis Technology Engineering Laboratory Inner Mongolia University Hohhot China

ISBN: (纸本)9783031203084

Anomaly detection aims to find outliers data that do not conform to expected behaviors in a specific scenario, which is indispensable and critical in current safety environments related studies. However, when performing outlier detection on a large-scale multidimensional dataset, most of the traditional methods make no distinctions between classes of outliers and lack the reasoning ability and the explainability of the analysis results, which leads to the low accuracy of global outlier detection and the inability to effectively identify local outliers. In this paper, we propose a fine-grained anomaly detection method which well utilizes isolation forest and knowledge graph reasoning tactics. First, a better extracting data feature method and a more reasonable weighted strategy are used to find global outliers based on the traditional isolation forest algorithm, and then we construct a custom rule base according to the in-depth research and analysis of global abnormal data, and at last the ontology knowledge is reasoned based on such rule base to achieve the detection of local outliers. Through analysis of extensive experiment results, our method could effectively discover more abnormal data without big loss of time costs, has strong generalization, and correspondingly improves the performance for abnormal detection. © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：