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

Weak Multi-Label data Stream Classification Under Distribution Changes in Labels

IEEE Transactions on Big data 2025年第3期11卷 1369-1380页

作者： Zou, Yizhang Hu, Xuegang Li, Peipei Hu, Jun Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data Ministry of Education School of Computer Science and Information Engineering Hefei230002 China National University of Singapore School of Computing 119077 Singapore

Multi-label stream classification aims to address the challenge of dynamically assigning multiple labels to sequentially arrived instances. In real situations, only partial labels of instances can be observed due to the expensive human annotations, and the problem of label distribution changes arises from multiple labels in a streaming mode, but few existing works jointly consider such challenges. Motivated by this, we propose the problem of weak multi-label stream classification (WMSC) and an online classification algorithm robust to weak labels. Specifically, we incrementally update the margin-based model using information from both the past model and the current incoming instance with partially observed labels. To increase the robustness to weak labels, we first adjust the classification margin of negative labels using the label causality matrix, which is constructed by the conditional probability of label pairs. Second, we introduce the label prototype matrix to regulate the margin by controlling the weighting parameter of the slack term. Additionally, to handle the potential distribution changes in labels, we utilize the instance-specific threshold via online thresholding to perform binary classification, which is formulated as a regression problem. Finally, theoretical analysis and empirical experimental results are presented to demonstrate the effectiveness of WMSC in classifying unobserved streaming instances. © 2015 IEEE.

关键词： Labeled data

来源：评论

学校读者我要写书评

暂无评论

Gupacker: Generalized Unpacking Framework for Android Malware

引用

IEEE Transactions on Information Forensics and Security 2025年 20卷 4338-4352页

作者： Zheng, Tao Hou, Qiyu Chen, Xingshu Ren, Hao Li, Meng Li, Hongwei Shen, Changxiang Sichuan University School of Cyber Science and Engineering Chengdu610065 China Sichuan University School of Cyber Science and Engineering Cyber Science Research Institute Key Laboratory of Data Protection and Intelligent Management Ministry of Education Chengdu610065 China Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Intelligent Interconnected Systems Laboratory of Anhui Province School of Computer Science and Information Engineering Hefei230002 China University of Padua Department of Mathematics HIT Center Padua35131 Italy University of Electronic Science and Technology of China School of Computer Science and Engineering Chengdu611731 China Sichuan University Cyber Science Research Institute Key Laboratory of Data Protection and Intelligent Management Ministry of Education Chengdu610065 China

Android malware authors often use packers to evade analysis. Although many unpacking tools have been proposed, they face two significant challenges: 1) They are easily impeded by anti-analysis techniques employed by packers, preventing efficient collection of hidden Dex data. 2) They are typically designed to unpack a specific packer and cannot handle malware packed with mixed packers. Consequently, many packed malware samples evade detection. To bridge this gap, we propose Gupacker , a novel generalized unpacking framework. Gupacker offers a generic solution for first-generation holistic packer by customizing the Android system source code. It identifies the type of packer and selects an appropriate unpacking function, constructs a deeper active call chain to achieve generic unpacking of second-generation function extraction packers, and uses JNI function and instruction monitoring to handle third-generation virtual obfuscation packer. On this basis, we counteract a diverse array of anti-analysis techniques. We conduct extensive experiments on 5K packed Android malware samples, comparing Gupacker with 2 commercial and 4 state-of-the-art academic unpacking tools. The results demonstrate that Gupacker significantly improves the efficiency of Android malware unpacking with acceptable system overhead. We analyze real packed applications based on Gupacker and found several are second-packed by attackers, including WPS for Android, with tens of millions of users. We receive and responsibly report 13 0day vulnerabilities and also assist in the remediation of all vulnerabilities. © 2005-2012 IEEE.

关键词： Android malware

来源：评论

学校读者我要写书评

暂无评论

MSMAE-Net: multi-semantic and multi-attention enhanced network for image forgery localization

引用

Signal, Image and Video Processing 2025年第7期19卷 1-11页

作者： Liao, Jianjun Su, Lichao Lu, Menghan Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China

The popularization of modern digital image technology has brought convenience to us, but it also poses many risks. The advancement of image editing software allows anyone to modify image content effortlessly. If these modified images are abused, they can severely impact societal safety and stability. To address these risks, we propose an end-to-end multi-scale collaborative enhancement image forgery localization network, termed MSMAE-Net. The method first employs a multi-branch feature extractor to initially capture both global and local information, with each branch optimized for different contextual information and features of the image. Next, to enhance the model’s ability to capture forged traces at various levels while maintaining the correlation between different spatial hierarchies, a boundary information aggregation module is designed. By constructing multiple branches with different receptive fields and collaborative learning with each other, a nested collaborative enhancement branch is designed to make the backbone network pay more attention to key features, so as to obtain better feature representation capability. Furthermore, to further fuse different semantic information, a novel strongly compatible semantic attention fusion module is proposed in this paper. Finally, an attention enhancement module is introduced in the localization of forgery regions to adaptively concentrate on key forged areas in the image and effectively capture the relationships between different pixels. In the experiments, we demonstrate that MSMAE-Net exhibits significant advantages in both localization accuracy and robustness in complex forgery scenarios when compared to other SOTA image forgery detection methods. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2025.

关键词： Photointerpretation

来源：评论

学校读者我要写书评

暂无评论

Bayesian Network Reconstruction and Iterative Divergence Problem Solving Method Based on Norm Minimization

引用

Computer Modeling in engineering & Sciences 2025年第4期143卷 617-637页

作者： Kuo Li Aimin Wang Limin Wang Yuetan Zhao Xinyu Zhu Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin UniversityChangchun130012China College of Software Jilin UniversityChangchun130012China

A Bayesian network reconstruction method based on norm minimization is proposed to address the sparsity and iterative divergence issues in network reconstruction caused by noise and missing *** method achieves precise adjustment of the network structure by constructing a preliminary random network model and introducing small-world network characteristics and combines L1 norm minimization regularization techniques to control model complexity and optimize the inference process of variable *** the experiment of game network reconstruction,when the success rate of the L1 norm minimization model’s existence connection reconstruction reaches 100%,the minimum data required is about 40%,while the minimum data required for a sparse Bayesian learning network is about 45%.In terms of operational efficiency,the running time for minimizing the L1 normis basically maintained at 1.0 s,while the success rate of connection reconstruction increases significantly with an increase in data volume,reaching a maximum of 13.2 ***,in the case of a signal-to-noise ratio of 10 dB,the L1 model achieves a 100% success rate in the reconstruction of existing connections,while the sparse Bayesian network had the highest success rate of 90% in the reconstruction of non-existent *** the analysis of actual cases,the maximum lift and drop track of the research method is 0.08 *** mean square error is 5.74 cm^(2).The results indicate that this norm minimization-based method has good performance in data efficiency and model stability,effectively reducing the impact of outliers on the reconstruction results to more accurately reflect the actual situation.

关键词： Bayesian norm minimization network reconstruction iterative divergence sparsity

来源：评论

学校读者我要写书评

暂无评论

Histological Image Diagnosis of Breast Cancer Based on Multi-Attention Convolution Neural Network

引用

Journal of Shanghai Jiaotong university(Science) 2025年第1期30卷 91-106页

作者： XU Wangwang XU Liangfeng LIU Ninghui LU Na Key Laboratory of Knowledge Engineering with Big Data(Hefei University of Technology) Ministry of EducationHefei230601China School of Computer and Information Hefei University of TechnologyHefei230601China First Affiliated Hospital of Anhui Medical University Hefei230022China

Breast cancer is a serious and high morbidity disease in women,and it is the main cause of cancer death in ***,getting tested and diagnosed early can reduce the risk of *** present,there are clinical examinations,imaging screening and biopsies,among which histopathological examination is the gold ***,the process is complicated and time-consuming,and misdiagnosis may *** paper puts forward a classification framework based on deep learning,introducing multi-attention mechanism,selecting kernel convolution instead of ordinary convolution,and using different weights and combinations to pay attention to the accuracy index and growth rate of the *** addition,we also compared the learning rate *** function can fine-tune the learning rate to achieve good performance,using label softening to reduce the loss error caused by model error recognition in the label,and assigning different category weights in the loss function to balance the positive and negative *** used the BreakHis data set to automatically classify histological images into benign and malignant,four categories and eight *** results showed that the accuracy of binary classifications ranged from 98.23%to 98.83%,and that of multiple classifications ranged from 97.89%to 98.11%.

关键词： breast cancer deep learning attentional mechanism classification diagnosis

来源：评论

学校读者我要写书评

暂无评论

Byzantine-robust distributed support vector machine

引用

Science china Mathematics 2025年第3期68卷 707-728页

作者： Xiaozhou Wang Weidong Liu Xiaojun Mao School of Statistics East China Normal UniversityShanghai 200062China Key Laboratory of Advanced Theory and Application in Statistics and Data Science(Ministry of Education) East China Normal UniversityShanghai 200062China School of Mathematical Sciences Shanghai Jiao Tong UniversityShanghai 200240China Key Laboratory of Artificial Intelligence(Ministry of Education) Shanghai Jiao Tong UniversityShanghai 200240China Key Laboratory of Scientific and Engineering Computing(Ministry of Education) Shanghai Jiao Tong UniversityShanghai 200240China

The development of information technology brings diversification of data sources and large-scale data sets and calls for the exploration of distributed learning algorithms. In distributed systems, some local machines may behave abnormally and send arbitrary information to the central machine(known as Byzantine failures), which can invalidate the distributed algorithms based on the assumption of faultless systems. This paper studies Byzantine-robust distributed algorithms for support vector machines(SVMs) in the context of binary classification. Despite a vast literature on Byzantine problems, much less is known about the theoretical properties of Byzantine-robust SVMs due to their unique challenges. In this paper, we propose two distributed gradient descent algorithms for SVMs. The median and trimmed mean operations in aggregation can effectively defend against Byzantine failures. Theoretically, we show the convergence of the proposed estimators and provide the statistical error rates. After a certain number of iterations, our estimators achieve near-optimal rates. Simulation studies and real data analysis are conducted to demonstrate the performance of the proposed Byzantine-robust distributed algorithms.

关键词： Byzantine robustness convergence distributed learning support vector machine

来源：评论

学校读者我要写书评

暂无评论

An Evolutionary Multitasking Algorithm for Efficient Multiobjective Recommendations

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年第3期6卷 518-532页

作者： Tian, Ye Ji, Luke Hu, Yiwei Ma, Haiping Wu, Le Zhang, Xingyi Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Hefei230601 China Anhui University Institutes of Physical Science and Information Technology Hefei230601 China Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data Hefei230029 China

Represented by evolutionary algorithms and swarm intelligence algorithms, nature-inspired metaheuristics have been successfully applied to recommender systems and amply demonstrated effectiveness, in particular, for multiobjective recommendation. Owing to the population-based search paradigm, these algorithms can produce a number of recommendation lists, making diverse tradeoffs between multiple metrics and meeting the requirements of accuracy, novelty, diversity, and other user preferences. However, these algorithms are criticized for the low efficiency of the optimization process, especially when the number of users is large. To address this issue, this article proposes an evolutionary multitasking-based recommendation method, where each task corresponds to a user and all the tasks are optimized simultaneously, thus highly improving the efficiency of recommendation. To enhance the convergence speed, all the users are divided into multiple populations according to the similarity between their preferences, where each population evolves with internal knowledge transfer between users, and all the populations evolve with external knowledge transfer between populations. Experimental results on various datasets verify that the proposed method can better balance between multiple metrics than classical and deep neural network-based recommendation methods and exhibits significantly higher efficiency than evolutionary multiobjective optimization-based recommendation methods. © 2024 IEEE. All rights reserved.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

A Method for Fast Feature Selection Utilizing Cross-Similarity within the Context of Fuzzy Relations

引用

Computers, Materials & Continua 2025年第4期83卷 1195-1218页

作者： Wenchang Yu Xiaoqin Ma Zheqing Zhang Qinli Zhang School of Big Data and Artificial Intelligence Chizhou UniversityChizhou247000China Anhui Education Big Data Intelligent Perception and Application Engineering Research Center Anhui Provincial Joint Construction Key Laboratory of Intelligent Education Equipment and TechnologyChizhou247000China

Feature selection methods rooted in rough sets confront two notable limitations:their high computa-tional complexity and sensitivity to noise,rendering them impractical for managing large-scale and noisy *** primary issue stems from these methods’undue reliance on all *** overcome these challenges,we introduce the concept of cross-similarity grounded in a robust fuzzy relation and design a rapid and robust feature selection ***,we construct a robust fuzzy relation by introducing a truncation ***,based on this fuzzy relation,we propose the concept of cross-similarity,which emphasizes the sample-to-sample similarity relations that uniquely determine feature importance,rather than considering all such relations *** studying the manifestations and properties of cross-similarity across different fuzzy granularities,we propose a forward greedy feature selection algorithm that leverages cross-similarity as the foundation for information *** algorithm significantly reduces the time complexity from O(m2n2)to O(mn2).Experimental findings reveal that the average runtime of five state-of-the-art comparison algorithms is roughly 3.7 times longer than our algorithm,while our algorithm achieves an average accuracy that surpasses those of the five comparison algorithms by approximately 3.52%.This underscores the effectiveness of our *** paper paves the way for applying feature selection algorithms grounded in fuzzy rough sets to large-scale gene datasets.

关键词： Fuzzy rough sets feature selection cross-similarity fuzzy relations

来源：评论

学校读者我要写书评

暂无评论

Retrieval-Augmented Fine-Tuning for Improving Retrieve-and-Edit Based Assertion Generation

引用

IEEE Transactions on Software engineering 2025年第5期51卷 1591-1614页

作者： Li, Hongyan Sun, Weifeng Yan, Meng Xu, Ling Li, Qiang Zhang, Xiaohong Zhang, Hongyu Chongqing University Key Laboratory of Dependable Service Computing in Cyber Physical Society Ministry of Education Chongqing400044 China Chongqing University School of Big Data and Software Engineering Chongqing400044 China

Unit Testing is crucial in software development and maintenance, aiming to verify that the implemented functionality is consistent with the expected functionality. A unit test is composed of two parts: a test prefix, which drives the unit under test to a particular state, and a test assertion, which determines what the expected behavior is under that state. To reduce the effort of conducting unit tests manually, Yu et al. proposed an integrated approach (integration for short), combining information retrieval with a deep learning-based approach to generate assertions for test prefixes, and obtained promising results. In our previous work, we found that the overall performance of integration is mainly due to its success in retrieving assertions. Moreover, integration is limited to specific types of edit operations and struggles to understand the semantic differences between the retrieved focal-test (focal-test includes a test prefix and a unit under test) and the input focal-test. Based on these insights, we then proposed a retrieve-and-edit approach named EDITAS to learn the assertion edit patterns to improve the effectiveness of assertion generation in our prior study. Despite being promising, we find that the effectiveness of EDITAS can be further improved. Our analysis shows that: ① The editing ability of EDITAS still has ample room for improvement. Its performance degrades as the edit distance between the retrieval assertion and ground truth increases. Specifically, the average accuracy of EDITAS is 12.38% when the edit distance is greater than 5. ② EDITAS lacks a fine-grained semantic understanding of both the retrieved focal-test and the input focal-test themselves, which leads to many inaccurate token modifications. In particular, an average of 25.57% of the incorrectly generated assertions that need to be modified are not modified, and an average of 6.45% of the assertions that match the ground truth are still modified. Thanks to pre-trained models employing

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

Face Reconstruction-Based Generalized Deepfake Detection Model with Residual Outlook Attention

引用

ACM Transactions on Multimedia Computing, Communications and Applications 2025年第4期21卷 1-19页

作者： Shi, Zenan Liu, Wenyu Chen, Haipeng College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China

With the continuous development of deep counterfeiting technology, the information security in our daily life is under serious threat. While existing face forgery detection methods exhibit impressive accuracy when applied to datasets such as FaceForensics++ and Celeb-DF, they falter significantly when confronted with out-of-domain scenarios. This causes specialization of learned representations to known forgery patterns presented in the training set, rendering it difficult to detect forgeries with unknown patterns. To address this challenge, we propose a novel end-to-end Face Reconstruction-Based Generalized Deepfake Detection (FRG2D) model with Residual Outlook Attention (ROA), which emphasizes the robust visual representations of genuine faces and discerns the subtle differences between authentic and manipulated facial images. Our methodology entails reconstructing authentic face images using an encoder-decoder architecture based on U-net, facilitating a deeper understanding of disparities between genuine and manipulated facial images. Furthermore, we integrate the convolutional block attention module (CBAM) and channel attention block (CAB) to selectively focus the network's attention on salient features within real face images. Furthermore, we employ ROA to guide the network's focus towards precise features within manipulated facial images. Simultaneously, the computed reconstruction differences obtained through ROA serves as the ultimate representation fed into the classifier for face forgery detection. Both the reconstruction and classification learning processes are optimized end-to-end. Through extensive experimentation, our model demonstrated a substantial improvement in deepfake detection across unknown domains, while maintaining a high accuracy within the known domain. © 2025 Copyright held by the owner/author(s). Publication rights licensed to ACM.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：