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

arXiv 2025年

作者： Wang, Zhenglin Wu, Jialong Li, Pengfei Jiang, Yong Zhou, Deyu School of Computer Science and Engineering Key Laboratory of Computer Network and Information Integration Ministry of Education Southeast University China Tongyi Lab Alibaba Group China

Temporal reasoning is fundamental to human cognition and is crucial for various real-world applications. While recent advances in Large Language Models have demonstrated promising capabilities in temporal reasoning, existing benchmarks primarily rely on rule-based construction, lack contextual depth, and involve a limited range of temporal entities. To address these limitations, we introduce Chinese Time Reasoning (CTM), a benchmark designed to evaluate LLMs on temporal reasoning within the extensive scope of Chinese dynastic chronology. CTM emphasizes cross-entity relationships, pairwise temporal alignment, and contextualized and culturally-grounded reasoning, providing a comprehensive evaluation. Extensive experimental results reveal the challenges posed by CTM and highlight potential avenues for improvement. Copyright © 2025, The Authors. All rights reserved.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

MBC-DTA: A Multi-Scale Bilinear Attention with Contrastive Learning Framework for Drug-Target Binding Affinity Prediction

MBC-DTA: A Multi-Scale Bilinear Attention with Contrastive L...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Li, Huiting Zhang, Weiyu Shang, Yong Lu, Wenpeng Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Jinan China

ISBN: (纸本)9798350386226

Drug-target binding affinity prediction is critical to drug design. Some existing computational methods rely on single-scale data and cannot fully integrate the rich information of multi-scale data, such as molecular structures and network information. In this paper, we propose the MBC-DTA model, which effectively integrates multi-scale data, and models the complex interactions between atoms and amino acids. We introduce GCN and GAT, which effectively extract the feature representation of molecular structure scale and network scale. Afterwards, the features obtained from the molecular structure scale are fed into a bilinear attention network, which captures the intricate interaction information between drug-target pairs. Additionally, a cross-scale graph contrastive learning strategy is applied, optimizing the feature representations across different scales. Extensive experimental results on two benchmark datasets demonstrate that the MBC-DTA model outperforms existing state-of-the-art methods. © 2024 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

MemADet: A Representative Memory Bank Approach for Industrial Image Anomaly Detection

MemADet: A Representative Memory Bank Approach for Industria...

引用

2024 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2024

作者： Li, Min He, Jinghui Ying, Zuobin Li, Gang Zhou, Mingle Key Laboratory of Computing Power Network and Information Security Ministry of Education Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China City University of Macau Faculty of Data Science China

ISBN: (纸本)9781665410205

In the field of industrial production, anomaly detection is crucial for ensuring product quality and maintaining production efficiency. With the continuous advancement of computer vision technology, it has shown tremendous potential in industrial applications. However, the scarcity of labeled anomaly samples in real-world operating environments poses significant challenges for traditional anomaly detection techniques. To address this, we propose MemADet, a novel anomaly detection model that employs an unsupervised approach and leverages a representative memory bank. It employs a dynamic decision mechanism to control the representativeness of the features stored in the memory bank, and employs a weighted anomaly score calculation mechanism to further enhance the performance of image anomaly detection. Our evaluations indicate that MemADet performs robustly in industrial image anomaly detection across three datasets, with particularly no-table detection accuracy on the MVTec AD dataset. Its efficacy is further validated by competitive results on two additional datasets, highlighting its consistent and effective performance in various settings. © 2024 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Anomaly-Free Prior Guided Knowledge Distillation for Industrial Anomaly Detection

Anomaly-Free Prior Guided Knowledge Distillation for Industr...

引用

2024 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2024

作者： Li, Gang Chen, Tianjiao Li, Min Han, Delong Zhou, MingLe Key Laboratory of Computing Power Network and Information Security Ministry of Education Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China City University of Macau Faculty of Data Science China

ISBN: (纸本)9781665410205

In industrial manufacturing, visual anomaly detection is critical for maintaining product quality by detecting and preventing production anomalies. Anomaly detection methods based on knowledge distillation demonstrate promising performance in addressing the unpredictability and diversity of anomalies. However, they suffer from a lack of effective guidance from anomaly-free priors when handling anomalous features and underutilize multi-scale features during the segmentation scoring stage, yielding suboptimal detection results. To alleviate these issues, we propose an Anomaly-free Prior Guided knowledge distillation (APG) for industrial anomaly detection. Firstly, it filters the abnormal features by training the de-noising target network with knowledge distillation structure. Concurrently, we propose the Prior Perception Propagation Module (P3M), which extracts more efficient anomaly-free features by imposing constraints on anomalous features. Secondly, we propose the Multi-scale Prior Guided Fusion Module (MPGFM) to improve anomaly detection accuracy by utilizing anomaly-free features from the target network as priors to guide the generation and fusion of cross-scale differential features. Finally, the Global Perception Enhancement Module (GPEM) is proposed to construct an anomaly scoring network, leveraging comprehensive scene features to enhance the detection and localization performance of numerous small-target anomalies in industrial manufacturing. Extensive experiments on the MVTecAD and BTAD datasets show that the proposed method demonstrates a consistent and significant outperformance against competing methods. © 2024 IEEE.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

A deep learning model enabled multi-event recognition for distributed optical fiber sensing

引用

Science China(information Sciences) 2024年第3期67卷 291-307页

作者： Yujiao LI Xiaomin CAO Wenhao NI Kuanglu YU Institute of Information Science School of Computer and Information TechnologyBeijing Jiaotong University Beijing Key Laboratory of Advanced Information Science and Network Technology Beijing Jiaotong University

Fiber optic sensors that utilize backscattered light offer distributed real-time measurements and have been seen tremendous improvements in sensing distance and spatial resolution over the last ***, these improvements in sensor capabilities lead to a significant increase in the amount of data that needs to be processed. Traditional processing schemes are no longer adequate, so the development of novel signal processing methods is critical. Phase-sensitive optical time domain reflectometry(Φ-OTDR) is now applied in various applications for multi-event recognition, and it would usually be difficult, sometimes even unrealistic to label all the acquired samples due to its real-time and seamless monitoring nature. To fully take advantage of the information contained within the large number of unlabeled samples, which were formerly not utilized and hence wasted, we propose a semi-supervised model to boost the event classification performance of Φ-OTDR. The model extracts respectively the temporal features and the spatial bidirectional features together with a dual attention mechanism. Its classification accuracy has been improved up to 96.9%with only 1230 labeled samples. In addition, our model shows significant advantages when the number of labeled samples is reduced. Importantly, our method improves the accuracy of multi-event classification without any modification to the optical setup.

关键词： Φ-OTDR event recognition semi-supervised learning mean teacher MT-ACNN-SA-BiLSTM

来源：评论

学校读者我要写书评

暂无评论

Binary decomposition: a problem transformation perspective for open-set semi-supervised learning 24

Binary decomposition: a problem transformation perspective f...

引用

Proceedings of the 41st International Conference on Machine Learning

作者： Jun-Yi Hang Min-Ling Zhang School of Computer Science and Engineering Southeast University Nanjing China and Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education China

Semi-supervised learning (SSL) is a classical machine learning paradigm dealing with labeled and unlabeled data. However, it often suffers performance degradation in real-world open-set scenarios, where unlabeled data contains outliers from novel categories that do not appear in labeled data. Existing studies commonly tackle this challenging open-set SSL problem with detect-and-filter strategy, which attempts to purify unlabeled data by detecting and filtering outliers. In this paper, we propose a novel binary decomposition strategy, which refrains from error-prone procedure of outlier detection by directly transforming the original open-set SSL problem into a number of standard binary SSL problems. Accordingly, a concise yet effective approach named BDMatch is presented. BDMatch confronts two attendant issues brought by binary decomposition, i.e. class-imbalance and representation-compromise, with adaptive logit adjustment and label-specific feature learning respectively. Comprehensive experiments on diversified benchmarks clearly validate the superiority of BDMatch as well as the effectiveness of our binary decomposition strategy.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Compositional metric learning for multi-label classification

引用

Frontiers of computer Science 2021年第5期15卷 1-12页

作者： Yan-Ping SUN Min-Ling ZHANG School of Computer Science and Engineering Southeast UniversityNanjing 210096China Key Laboratory of Computer Network and Information Integration(Southeast University) Ministry of EducationChina Collaborative Innovation Center for Wireless Communications Technology Nanjing 211100China

Multi-label classification aims to assign a set of proper labels for each instance,where distance metric learning can help improve the generalization ability of instance-based multi-label classification *** multi-label metric learning techniques work by utilizing pairwise constraints to enforce that examples with similar label assignments should have close distance in the embedded feature *** this paper,a novel distance metric learning approach for multi-label classification is proposed by modeling structural interactions between instance space and label *** one hand,compositional distance metric is employed which adopts the representation of a weighted sum of rank-1 PSD matrices based on com-ponent *** the other hand,compositional weights are optimized by exploiting triplet similarity constraints derived from both instance and label *** to the compositional nature of employed distance metric,the resulting problem admits quadratic programming formulation with linear optimization complexity *** number of training *** also derive the generalization bound for the proposed approach based on algorithmic robustness analysis of the compositional *** experiments on sixteen benchmark data sets clearly validate the usefulness of compositional metric in yielding effective distance metric for multi-label classification.

关键词： machine learning multi-label learning metric learning compositional metric positive semidefinite matrix decomposition

来源：评论

学校读者我要写书评

暂无评论

Feature Augmented Meta-Learning on Domain Generalization for Evolving Malware Classification 24th

Feature Augmented Meta-Learning on Domain Generalization fo...

引用

24th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2024

作者： Wang, Fangwei Chen, Yinhe Song, Ruixin Li, Qingru Wang, Changguang Key Laboratory of Network and Information Security of Hebei Province College of Computer and Cyber Security Hebei Normal University Shijiazhuang050024 China College of Computer Science and Technology Guizhou University Guiyang550025 China

ISBN: (纸本)9789819615278

The proliferation of malware has resulted in substantial harm to various sectors and economies. Various deep learning-based malware classification methods have been suggested as a means of mitigating malware threats. These methods typically operate under the assumption of independent and identically distributed training and test data. However, this assumption becomes invalid with the evolving malware family. While domain adaptation models offer a potential solution to this issue, their implementation is hindered by the difficulty of collecting new malware variants. In order to address the previously mentioned problem, we suggest an image-based technique for categorizing malware families utilizing domain generalization. Initially, malware is transformed into gray-scale images that depict byte patterns of the malware. Subsequently, these gray-scale images are fed into a model incorporating convolutional block attention to extract features. Furthermore, data augmentation is implemented at the feature level to broaden the distribution of the source domain and enhance the model’s generalization capabilities. Finally, meta-learning is utilized as a training approach to effectively extract domain-invariant representations. A series of experiments are conducted on the BIG2015 and BenchMFC-G1P1P2. The proposed method demonstrates a higher accuracy rate of 88.66% on the BIG2015 and 80.25% on the BenchMFC-G1P1P2, which is better than the existing methods. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Domain Generalization Domain Shift Feature Argumentation Malware Classification

来源：评论

学校读者我要写书评

暂无评论

DBKEM-AACS: a distributed key escrow model in blockchain with anonymous authentication and committee selection

引用

Science China(information Sciences) 2023年第3期66卷 289-290页

作者： Axin XIANG Hongfeng GAO Youliang TIAN Liang WAN College of Computer Science and Technology Guizhou University Institute of Cryptography and Data Security Guizhou University Network and Information Management Center Guizhou University State Key Laboratory of Public Big Data Guizhou University Institute of Computer Software and Theory Guizhou University

Dear editor, key security is of great practical significance and demand to guarantee the security of digital assets in the blockchain system. At present, users prefer to escrow their assets on centralized institutions, but this phenomenon has gone against the unique characteristics of decentralization and anonymity in the blockchain. Among them, the suspense incidents of assets lock or lost are enough to prove that the security of escrowed keys on the exchanges is questionable.

关键词：

来源：评论

学校读者我要写书评

暂无评论

RankMatch: A Novel Approach to Semi-Supervised Label Distribution Learning Leveraging Inter-label Correlations

arXiv

引用

arXiv 2023年

作者： Kou, Zhiqiang Xie, Yucheng Wang, Jing Jia, Yuheng Shi, Boyu Geng, Xin MOE Key Laboratory of Computer Network and Information Integration School of Computer Science and Engineering Southeast University Nanjing China

This paper introduces RankMatch, an innovative approach for Semi-Supervised Label Distribution Learning (SSLDL). Addressing the challenge of limited labeled data, RankMatch effectively utilizes a small number of labeled examples in conjunction with a larger quantity of unlabeled data, reducing the need for extensive manual labeling in Deep Neural network (DNN) applications. Specifically, RankMatch introduces an ensemble learning-inspired averaging strategy that creates a pseudo-label distribution from multiple weakly augmented images. This not only stabilizes predictions but also enhances the model’s robustness. Beyond this, RankMatch integrates a pairwise relevance ranking (PRR) loss, capturing the complex inter-label correlations and ensuring that the predicted label distributions align with the ground truth. We establish a theoretical generalization bound for RankMatch, and through extensive experiments, demonstrate its superiority in performance against existing SSLDL methods. Copyright © 2023, The Authors. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：