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

Attribute grouping-based naive Bayesian classifier

science China(Information sciences) 2025年第3期68卷 125-149页

作者： Yulin HE Guiliang OU Philippe FOURNIER-VIGER Joshua Zhexue HUANG Guangdong Laboratory of Artificial Intelligence and Digital Economy (SZ) College of Computer Science & Software Engineering Shenzhen University

The naive Bayesian classifier(NBC) is a supervised machine learning algorithm having a simple model structure and good theoretical interpretability. However, the generalization performance of NBC is limited to a large extent by the assumption of attribute independence. To address this issue, this paper proposes a novel attribute grouping-based NBC(AG-NBC), which is a variant of the classical NBC trained with different attribute groups. AG-NBC first applies a novel effective objective function to automatically identify optimal dependent attribute groups(DAGs). Condition attributes in the same DAG are strongly dependent on the class attribute, whereas attributes in different DAGs are independent of one another. Then,for each DAG, a random vector functional link network with a SoftMax layer is trained to output posterior probabilities in the form of joint probability density estimation. The NBC is trained using the grouping attributes that correspond to the original condition attributes. Extensive experiments were conducted to validate the rationality, feasibility, and effectiveness of AG-NBC. Our findings showed that the attribute groups chosen for NBC can accurately represent attribute dependencies and reduce overlaps between different posterior probability densities. In addition, the comparative results with NBC, flexible NBC(FNBC), tree augmented Bayes network(TAN), gain ratio-based attribute weighted naive Bayes(GRAWNB), averaged one-dependence estimators(AODE), weighted AODE(WAODE), independent component analysis-based NBC(ICA-NBC), hidden naive Bayesian(HNB) classifier, and correlation-based feature weighting filter for naive Bayes(CFW) show that AG-NBC obtains statistically better testing accuracies, higher area under the receiver operating characteristic curves(AUCs), and fewer probability mean square errors(PMSEs) than other Bayesian classifiers. The experimental results demonstrate that AG-NBC is a valid and efficient approach for alleviating the attribute i

关键词： naive Bayesian classifier attribute independence assumption attribute grouping dependent attribute group posterior probability class-conditional probability

来源：评论

学校读者我要写书评

暂无评论

AsyCo: an asymmetric dual-task co-training model for partial-label learning

引用

science China(Information sciences) 2025年第5期68卷 332-347页

作者： Beibei LI Yiyuan ZHENG Beihong JIN Tao XIANG Haobo WANG Lei FENG College of Computer Science Chongqing University State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences University of Chinese Academy of Sciences School of Software Technology Zhejiang University School of Computer Science and Engineering Nanyang Technological University

Partial-label learning(PLL) is a typical problem of weakly supervised learning, where each training instance is annotated with a set of candidate labels. Self-training PLL models achieve state-of-the-art performance but suffer from error accumulation problems caused by mistakenly disambiguated instances. Although co-training can alleviate this issue by training two networks simultaneously and allowing them to interact with each other, most existing co-training methods train two structurally identical networks with the same task, i.e., are symmetric, rendering it insufficient for them to correct each other due to their similar limitations. Therefore, in this paper, we propose an asymmetric dual-task co-training PLL model called AsyCo,which forces its two networks, i.e., a disambiguation network and an auxiliary network, to learn from different views explicitly by optimizing distinct tasks. Specifically, the disambiguation network is trained with a self-training PLL task to learn label confidence, while the auxiliary network is trained in a supervised learning paradigm to learn from the noisy pairwise similarity labels that are constructed according to the learned label confidence. Finally, the error accumulation problem is mitigated via information distillation and confidence refinement. Extensive experiments on both uniform and instance-dependent partially labeled datasets demonstrate the effectiveness of AsyCo.

关键词： machine learning weakly supervised learning partial-label learning co-training models candidate label sets

来源：评论

学校读者我要写书评

暂无评论

An infrastructure software perspective toward computation offloading between executable specifications and foundation models

引用

science China(Information sciences) 2025年第4期68卷 380-382页

作者： Dezhi RAN Mengzhou WU Yuan CAO Assaf MARRON David HAREL Tao XIE Key Laboratory of High Confidence Software Technologies (PKU) Ministry of Education School of Computer SciencePeking University School of Electronics Engineering and Computer Science Peking University Department of Computer Science and Applied Mathematics Weizmann Institute of Science

Foundation models(FMs) [1] have revolutionized software development and become the core components of large software systems. This paradigm shift, however, demands fundamental re-imagining of software engineering theories and methodologies [2]. Instead of replacing existing software modules implemented by symbolic logic, incorporating FMs' capabilities to build software systems requires entirely new modules that leverage the unique capabilities of ***, while FMs excel at handling uncertainty, recognizing patterns, and processing unstructured data, we need new engineering theories that support the paradigm shift from explicitly programming and maintaining user-defined symbolic logic to creating rich, expressive requirements that FMs can accurately perceive and implement.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A survey on cross-user federated recommendation

引用

science China(Information sciences) 2025年第4期68卷 7-32页

作者： Enyue YANG Yudi XIONG Wei YUAN Weike PAN Qiang YANG Zhong MING College of Computer Science and Software Engineering Shenzhen University School of Electrical Engineering and Computer Science The University of Queensland WeBank AI Lab WeBank Department of Computer Science and Engineering Hong Kong University of Science and Technology College of Big Data and Internet Shenzhen Technology University Guangdong Laboratory of Artificial Intelligence and Digital Economy (SZ)

Recommender systems are effective in mitigating information overload, yet the centralized storage of user data raises significant privacy concerns. Cross-user federated recommendation(CUFR) provides a promising distributed paradigm to address these concerns by enabling privacy-preserving recommendations directly on user devices. In this survey, we review and categorize current progress in CUFR, focusing on four key aspects: privacy, security, accuracy, and efficiency. Firstly,we conduct an in-depth privacy analysis, discuss various cases of privacy leakage, and then review recent methods for privacy protection. Secondly, we analyze security concerns and review recent methods for untargeted and targeted *** untargeted attack methods, we categorize them into data poisoning attack methods and parameter poisoning attack methods. For targeted attack methods, we categorize them into user-based methods and item-based methods. Thirdly,we provide an overview of the federated variants of some representative methods, and then review the recent methods for improving accuracy from two categories: data heterogeneity and high-order information. Fourthly, we review recent methods for improving training efficiency from two categories: client sampling and model compression. Finally, we conclude this survey and explore some potential future research topics in CUFR.

关键词： cross-user federated recommendation federated recommendation federated learning recommender systems user privacy

来源：评论

学校读者我要写书评

暂无评论

Deep learning-based software engineering: progress,challenges, and opportunities

引用

science China(Information sciences) 2025年第1期68卷 57-144页

作者： Xiangping CHEN Xing HU Yuan HUANG He JIANG Weixing JI Yanjie JIANG Yanyan JIANG Bo LIU Hui LIU Xiaochen LI Xiaoli LIAN Guozhu MENG Xin PENG Hailong SUN Lin SHI Bo WANG Chong WANG Jiayi WANG Tiantian WANG Jifeng XUAN Xin XIA Yibiao YANG Yixin YANG Li ZHANG Yuming ZHOU Lu ZHANG School of Journalism and Communication Sun Yat-sen University School of Software Technology Zhejiang University School of Software Engineering Sun Yat-sen University School of Software Dalian University of Technology School of Computer Science and Technology Beijing Institute of Technology Key Laboratory of High Confidence Software Technologies (Peking University) Ministry of EducationSchool of Computer Science Peking University State Key Laboratory for Novel Software Technology Nanjing University School of Computer Science and Engineering Beihang University Institute of Information Engineering Chinese Academy of Sciences School of Computer Science Fudan University State Key Laboratory of Complex & Critical Software Environment (CCSE) School of Software Beihang University School of Computer and Information Technology Beijing Jiaotong University School of Computer Science and Technology Harbin Institute of Technology School of Computer Science Wuhan University Huawei Technologies

Researchers have recently achieved significant advances in deep learning techniques, which in turn has substantially advanced other research disciplines, such as natural language processing, image processing, speech recognition, and software engineering. Various deep learning techniques have been successfully employed to facilitate software engineering tasks, including code generation, software refactoring, and fault localization. Many studies have also been presented in top conferences and journals, demonstrating the applications of deep learning techniques in resolving various software engineering tasks. However,although several surveys have provided overall pictures of the application of deep learning techniques in software engineering,they focus more on learning techniques, that is, what kind of deep learning techniques are employed and how deep models are trained or fine-tuned for software engineering tasks. We still lack surveys explaining the advances of subareas in software engineering driven by deep learning techniques, as well as challenges and opportunities in each subarea. To this end, in this study, we present the first task-oriented survey on deep learning-based software engineering. It covers twelve major software engineering subareas significantly impacted by deep learning techniques. Such subareas spread out through the whole lifecycle of software development and maintenance, including requirements engineering, software development, testing, maintenance, and developer collaboration. As we believe that deep learning may provide an opportunity to revolutionize the whole discipline of software engineering, providing one survey covering as many subareas as possible in software engineering can help future research push forward the frontier of deep learning-based software engineering more systematically. For each of the selected subareas,we highlight the major advances achieved by applying deep learning techniques with pointers to the available datasets i

关键词： deep learning software engineering software benchmark software artifact representation survey

来源：评论

学校读者我要写书评

暂无评论

Clustered Reinforcement Learning

引用

Frontiers of computer science 2025年第4期19卷 43-57页

作者： Xiao MA Shen-Yi ZHAO Zhao-Heng YIN Wu-Jun LI National Key Laboratory for Novel Software Technology Department of Computer Science and TechnologyNanjing UniversityNanjing 210023China Department of Electrical Engineering and Computer Sciences University of CaliforniaBerkeleyCA 94720-1770USA

Exploration strategy design is a challenging problem in reinforcement learning(RL),especially when the environment contains a large state space or sparse *** exploration,the agent tries to discover unexplored(novel)areas or high reward(quality)*** existing methods perform exploration by only utilizing the novelty of *** novelty and quality in the neighboring area of the current state have not been well utilized to simultaneously guide the agent’s *** address this problem,this paper proposes a novel RL framework,called clustered reinforcement learning(CRL),for efficient exploration in *** adopts clustering to divide the collected states into several clusters,based on which a bonus reward reflecting both novelty and quality in the neighboring area(cluster)of the current state is given to the *** leverages these bonus rewards to guide the agent to perform efficient ***,CRL can be combined with existing exploration strategies to improve their performance,as the bonus rewards employed by these existing exploration strategies solely capture the novelty of *** on four continuous control tasks and six hard-exploration Atari-2600 games show that our method can outperform other state-of-the-art methods to achieve the best performance.

关键词： deep reinforcement learning exploration count-based method clustering K-means

来源：评论

学校读者我要写书评

暂无评论

An Experimental Study on Dynamic Lifelong Learning with GPT for Mitigating Catastrophic Forgetting in Aspect-Based Sentiment Analysis

引用

IEEE Access 2025年 13卷 90316-90332页

作者： Huang, Huang Asemi, Adeleh Universiti Malaya Faculty of Computer Science Information Technology Department of Software Engineering Kuala Lumpur Malaysia

GPT is widely recognized as one of the most versatile and powerful large language models, excelling across diverse domains. However, its significant computational demands often render it economically unfeasible for individuals and small businesses, underscoring the need for efficient, domainspecific alternatives. In Aspect-Based Sentiment Analysis (ABSA), existing models are typically optimized for single domains, facing challenges in performing effectively across multiple domains. A key issue, known as "catastrophic forgetting," arises when models trained on one domain lose previously learned knowledge upon exposure to new domain data. This leads to two significant problems: limited cross-domain generalization and difficulty in retaining prior knowledge while learning domain-specific information. To address these challenges, we introduce the Dynamic Lifelong Learning Aspect-Based Sentiment Analysis GPT (DllaGPT), a model designed to handle multiple domains while mitigating catastrophic forgetting. Leveraging datasets from four ABSA domains—Laptops, Restaurants, Tweets, and Finance—this study fine-tunes a pretrained GPT model from HuggingFace sequentially across domains. DllaGPT employs a mechanism to retain real data from earlier domains during new domain training, effectively preserving prior knowledge. Experimental results highlight that DllaGPT achieves an average accuracy of 0.85 and a Backward Transfer (BWT) score of -0.09 across the four domains, showcasing its high accuracy and robust lifelong learning capabilities. © 2025 Institute of Electrical and Electronics Engineers Inc.. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

A multi-projection recurrent model for hypernym detection and discovery

引用

Frontiers of computer science 2025年第4期19卷 29-42页

作者： Xuefeng ZHANG Junfan CHEN Zheyan LUO Yuhang BAI Chunming HU Richong ZHANG School of Computer Science and Engineering Beihang UniversityBeijing 100191China School of Software Beihang UniversityBeijing 100191China Zhongguancun Laboratory Beijing 100094China

Hypernym detection and discovery are fundamental tasks in natural language *** former task aims to identify all possible hypernyms of a given hyponym term,whereas the latter attempts to determine whether the given two terms hold a hypernymy relation or *** research on hypernym detection and discovery tasks projects a term into various semantic spaces with single mapping *** their success,these methods may not be adequate in capturing complex semantic relevance between hyponym/hypernymy pairs in two ***,they may fall short in modeling the hierarchical structure in the hypernymy relations,which may help them learn better term ***,the polysemy phenomenon that hypernyms may express distinct senses is *** this paper,we propose a Multi-Projection Recurrent model(MPR)to simultaneously capture the hierarchical relationships between terms and deal with diverse senses caused by the polysemy ***,we build a multi-projection mapping block to deal with the polysemy phenomenon,which learns various word senses by multiple ***,we adopt a hierarchy-aware recurrent block with the recurrent operation followed by a multi-hop aggregation module to capture the hierarchical structure of hypernym *** on 11 benchmark datasets in various task settings illustrate that our multi-projection recurrent model outperforms the *** experimental analysis and case study demonstrate that our multi-projection module and the recurrent structure are effective for hypernym detection and discovery tasks.

关键词： natural language processing hypernym detection recurrent model

来源：评论

学校读者我要写书评

暂无评论

DevDynaP: A Dynamic Local Community Detection Algorithm

引用

SN computer science 2025年第4期6卷 1-11页

作者： Bakhtar, Sahar Harutyunyan, Hovhannes A. Department of Computer Science and Software Engineering Concordia University Montreal Canada

Recent years have witnessed the rapid growth of social network services. Real-world social networks are huge and changing over time. Consequently, the problems in this area have become more complex. Community detection is one of the most important problems in social networks. A good community can be defined as a group of nodes that are highly connected to each other and loosely connected to the nodes outside the community. Regarding the fact that social networks are huge in size, having complete information about the whole network is almost impossible. As a result, the problem of local community detection has become more popular in recent years. However, the problem of community detection in dynamic networks is well-investigated, the local community detection is not widely addressed by researchers in dynamic networks. In this paper, a dynamic local community detection algorithm is proposed. The purpose of the proposed algorithm is to explore the network as fast as possible and detect communities as well. Experimental results show that the proposed algorithm discovers the unknown parts of networks faster than similar algorithms. Also, the detected communities by the proposed algorithm outperform that of the compared algorithm in different snapshots. © The Author(s), under exclusive licence to Springer Nature Singapore Pte Ltd. 2025.

关键词： Dynamic social network Geodesic distance metric Local community detection Modularity

来源：评论

学校读者我要写书评

暂无评论

Enhancing Voice Phishing Detection Using Multilingual Back-Translation and SMOTE: An Empirical Study

引用

IEEE Access 2025年 13卷 37946-37965页

作者： Boussougou, Milandu Keith Moussavou Hamandawana, Prince Park, Dong-Joo Soongsil University Department of Computer Science and Engineering Seoul06978 Korea Republic of Ajou University Department of Software and Computer Engineering Suwon16499 Korea Republic of Soongsil University School of Computer Science and Engineering Seoul06978 Korea Republic of

With the widespread global trend of voice phishing or vishing attacks, the development of effective detection models using artificial intelligence (AI) has been hindered by the lack of high-quality and large volumes of data. This lack of data reflecting a real vishing scenario often leads to imbalanced datasets and biased detection models. Therefore, we present in this paper a data augmentation (DA) method for expanding the imbalanced Korean call content vishing (KorCCVi) dataset to address the existing data asymmetry problem and enhance the performance of Korean vishing detection. The proposed approach for DA involves using the back-translation (BT) method with three different intermediate languages: English, Chinese, and Japanese. The proposed method offers several advantages over the traditional synthetic minority oversampling technique (SMOTE), which is the main technique used to compare with our multilingual BT approach. Using these two DA techniques, several machine learning (ML) and deep learning (DL) models were trained on the original imbalanced dataset, the dataset balanced with SMOTE and its variants, and the dataset augmented with our method. We analyzed the impact of these DA methods on the performance of the models, demonstrated the benefits of each approach, and suggested the most suitable approach. The performance of the trained models was evaluated using the accuracy, precision, recall, and F1-score metrics. The experimental results demonstrated that the proposed multilingual BT method effectively expands the dataset while preserving its contextual and linguistic characteristics. The average performance of the models revealed that those trained on the augmented dataset outperformed the other models. They achieved F1-scores of 98.91% for the back-translated data, 98.14% for the original data, and 97.23% for SMOTE. © 2025 The Authors. This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecomm

关键词： Phishing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：