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

A novel observation points‐based positive‐unlabeled learning algorithm

CAAI Transactions on Intelligence Technology 2023年第4期8卷 1425-1443页

作者： Yulin He Xu Li Manjing Zhang Philippe Fournier‐Viger Joshua Zhexue Huang Salman Salloum Guangdong Laboratory of Artificial Intelligence and Digital Economy(SZ) ShenzhenChina College of Computer Science and Software Engineering Shenzhen UniversityShenzhenChina School of Computing National University of SingaporeSingaporeSingapore

In this study,an observation points‐based positive‐unlabeled learning algorithm(hence called OP‐PUL)is proposed to deal with positive‐unlabeled learning(PUL)tasks by judiciously assigning highly credible labels to unlabeled *** proposed OP‐PUL algorithm has three ***,an observation point classifier ensemble(OPCE)algorithm is constructed to divide unlabeled samples into two categories,which are temporary positive and permanent negative ***,a temporary OPC(TOPC)is trained based on the combination of original positive samples and permanent negative samples and then the permanent positive samples that are correctly classified with TOPC are retained from the temporary positive ***,a permanent OPC(POPC)is finally trained based on the combination of original positive samples,permanent positive samples and permanent negative *** exhaustive experimental evaluation is conducted to validate the feasibility,rationality and effectiveness of the OP‐PUL algorithm,using 30 benchmark PU data *** show that(1)the OP‐PUL algorithm is stable and robust as unlabeled samples and positive samples are increased in unlabeled data sets and(2)the permanent positive samples have a consistent probability distribution with the original positive ***,a statistical analysis reveals that POPC in the OP‐PUL algorithm can yield better PUL performances on the 30 data sets in comparison with four well‐known PUL *** demonstrates that OP‐PUL is a viable algorithm to deal with PUL tasks.

关键词： artificial intelligence datamining,machine learning

来源：评论

学校读者我要写书评

暂无评论

PAIR: Protein-aptamer interaction prediction based on language models and contrastive learning framework

PAIR: Protein-aptamer interaction prediction based on langua...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Zhang, Jun Yan, Zhiqiang Zeng, Hao Zhu, Zexuan Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen China Shenzhen University College of Computer Science and Software Engineering Shenzhen China

ISBN: (纸本)9798350386226

Aptamers are single-stranded DNA or RNA oligonucleotides that selectively bind to specific targets, making them valuable for drug design and diagnostic applications. Identifying the interactions between aptamers and target proteins is crucial for these applications. The systematic evolution of ligands by exponential enrichment process, traditionally used for this purpose, is challenging and time-consuming. The resulting aptamers often suffer from limitations in stability and diversity. Computational approaches have shown promise in aiding the discovery of high-performance aptamers, but existing methods are usually constrained by insufficient training data and limited generalizability. Recently, advancements in pre-training large language models have offered a new avenue to mitigate the dependency on large datasets. In this study, we propose a novel method to predict aptamer-protein interactions using large language models within a contrastive learning framework. Experimental results demonstrate that our method exhibits superior generalization and outperforms existing approaches. This method holds promise as a powerful tool for predicting aptamer-protein interactions. © 2024 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

RGCNU: Recurrent Graph Convolutional Network With Uncertainty Estimation for Remaining Useful Life Prediction

引用

IEEE/CAA Journal of Automatica Sinica 2023年第7期10卷 1640-1642页

作者： Qiwu Zhu Qingyu Xiong Zhengyi Yang Yang Yu School of Big Data&Software Engineering Chongqing UniversityChongqing 400044 Key Laboratory of Dependable Service Computing in Cyber Physical Society Ministry of EducationChongqing 400044China School of Biology and Engineering Guizhou Medical UniversityGuiyang 550025China

Dear Editor,This letter focuses on the problem of remaining useful life(RUL)prediction of equipment. Existing graph neural network(GCN)-based approaches merely provide the point estimation of RUL. However,the estimated RUL often varies widely due to the model parameters and the noise in data. It is important to know the uncertainty in predictions for reliable risk analysis and maintenance decision *** map the relationship between noisy condition monitoring data and RUL with uncertainty.

关键词： letter estimation prediction

来源：评论

学校读者我要写书评

暂无评论

Exploring implicit influence for social recommendation based on GNN

引用

Soft computing 2024年第19期28卷 11001-11014页

作者： Liu, Zhewei Yang, Peilin Hao, Qingbo Zheng, Wenguang Xiao, Yingyuan Engineering Research Center of Learning-Based Intelligent System Ministry of Education Tianjin University of Technology Tianjin China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin University of Technology Tianjin China

In recent years, the method of using graph neural networks (GNN) to learn users’ social influence has been widely applied to social recommendation and has shown effectiveness, but several important challenges have not been well addressed: (i) Most work fails to consider the user interests (historical user-item interactions) when first building user-user social relationships, which can make it difficult to capture accurate user embedding and thus prevent the model from better exploring the users’ social influence;(ii) Most of the current methods do not build social neighbors (with the same item-user interaction) that belong to the item and do not aggregate information from the perspective of social neighbors, which makes it possible for the item to lose a lot of details when expressing the user’s interest factors. Therefore, to address the above challenges, we propose Exploring Implicit Influence for Social Recommendation Based on GNN (EIIGNN). First, we construct the initial user embedding with user-item interaction information and use the implicit modeling module in user modeling to explore the implicit influence of interest factors on users. In addition, EIIGNN models the social graph structure of item (an item-item graph) so that item can aggregate information from the perspective of their social neighbors, which helps the model learn a more accurate representation of the item. Finally, extensive experimental results on two real-world datasets clearly demonstrate the effectiveness of EIIGNN. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2024.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

FBI-Net: Frequency Band Integration Network for Infrared Small Target Segmentation

FBI-Net: Frequency Band Integration Network for Infrared Sma...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Xin, Biqiao Li, Qiang Mao, Qianchen Wang, Jinbao Wang, Bingshu School of Software Northwestern Polytechnical University Xi'an China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China

ISBN: (纸本)9798350368741

Small targets in infrared imagery exhibit challenging characteristics due to their minimal semantic information and the extremely imbalanced distribution between the targets and the background. In this paper, we propose a frequency band integration network to extract salient features of infrared small targets in both the spatial and frequency domains. To excavate the high-frequency features of the small targets, we propose a frequency decoupling-fusion module. To decrease the semantic loss that occurs in deep networks, we propose a semantic injection mechanism to assist in retaining critical information from shallow layers. Experimental results show that our proposed method reaches higher prediction accuracy and robustness in the infrared small target segmentation task compared with other state-of-the-art approaches. © 2025 IEEE.

关键词： Feature Fusion Infrared Small Target Segmentation Semantic Injection Wavelet Transformation

来源：评论

学校读者我要写书评

暂无评论

EEiF: Efficient Isolated Forest with e Branches for Anomaly Detection 24

EEiF: Efficient Isolated Forest with e Branches for Anomaly ...

引用

24th IEEE International Conference on Data Mining, ICDM 2024

作者： Zhang, Yifan Xiang, Haolong Zhang, Xuyun Xu, Xiaolong Fan, Wei Zhang, Qin Qi, Lianyong School of Software Nanjing University of Information Science and Technology China Jiangsu Province Engineering Research Center of Advanced Computing and Intelligent Services China School of Computing Macquarie University Australia University of Oxford Uffield Department of Women's & Reproductive Health United Kingdom College of Computer Science and Software Engineering Shenzhen University China Faculty of Science and Engineering China

ISBN: (纸本)9798331506681

Anomaly detection is a popular research topic in Artificial Intelligence and has been widely applied in network security, financial fraud detection, and industrial equipment failure detection. Isolation forest based methods are the base algorithms to detect anomalies in these scenarios for their simplicity and efficiency, which has been further exploited with multi-folk trees and learning mechanisms to realize the optimal isolation forest for high detection accuracy. However, the optimal isolation forest is time-consuming with the learning mechanisms, resulting in the task failing of time-constrained applications. Moreover, the original optimal isolation forest fails to construct the optimal tree structure restricted by the time complexity. To address the above challenges, we propose an efficient anomaly detection method called EEIF, which realizes the real e-folk structure of the optimal isolation forest in our practical algorithm design. Specifically, we design a distribution that perfectly matches the e-branch theory to construct the optimal isolation forest. Then, we design an FR clustering scheme to achieve fast training of the isolation forest with learning to hash and provide related proofs of accuracy and efficiency. Besides, a parallel algorithm is integrated into our method to reduce prediction time. Finally, extensive experiments are conducted on a large amount of real-world datasets and the results demonstrate that our method significantly improves efficiency while ensuring effectiveness, compared with the state-of-the-art methods. © 2024 IEEE.

关键词： Anomaly Detection Efficient FR clustering Parallel Algorithm

来源：评论

学校读者我要写书评

暂无评论

A survey on federated learning:a perspective from multi-party computation

引用

Frontiers of Computer Science 2024年第1期18卷 93-103页

作者： Fengxia LIU Zhiming ZHENG Yexuan SHI Yongxin TONG Yi ZHANG Institute of Artificial Intelligence and Key Laboratory of Mathematics Informatics Behavioral Semantics Beihang UniversityBeijing 100191China State Key Laboratory of Software Development Environment and Advanced Innovation Center for Future Blockchain and Privacy Computing Beihang UniversityBeijing 100191China Pengcheng Laboratory Shenzhen 518055China Zhongguancun Laboratory Beijing 100190China Institute for Mathematical Sciences and Engineering Research Center of Financial Computing and Digital Engineering Renmin University of ChinaBeijing 100872China

Federated learning is a promising learning paradigm that allows collaborative training of models across multiple data owners without sharing their raw *** enhance privacy in federated learning,multi-party computation can be leveraged for secure communication and computation during model *** survey provides a comprehensive review on how to integrate mainstream multi-party computation techniques into diverse federated learning setups for guaranteed privacy,as well as the corresponding optimization techniques to improve model accuracy and training *** also pinpoint future directions to deploy federated learning to a wider range of applications.

关键词： sfederated learning multi-party ycomputation privacy-preserving data mining distributed learning

来源：评论

学校读者我要写书评

暂无评论

Enhancing Topic Interpretability for Neural Topic Modeling Through Topic-Wise Contrastive Learning 40

Enhancing Topic Interpretability for Neural Topic Modeling T...

引用

40th IEEE International Conference on Data engineering, ICDE 2024

作者： Gao, Xin Lin, Yang Li, Ruiqing Wang, Yasha Chu, Xu Ma, Xinyu Yu, Hailong Software Engineering Institution School of Computer Science Peking University Beijing China Key Lab of High Confidence Software Technologies Ministry of Education Beijing China Peking University National Engineering Research Center of Software Engineering Beijing China School of Computer Science Center on Frontiers of Computing Studies Peking University China

ISBN: (纸本)9798350317152

Data mining and knowledge discovery are essential aspects of extracting valuable insights from vast datasets. Neural topic models (NTMs) have emerged as a valuable unsupervised tool in this field. However, the predominant objective in NTMs, which aims to discover topics maximizing data likelihood, often lacks alignment with the central goals of data mining and knowledge discovery which is to reveal interpretable insights from large data repositories. Overemphasizing likelihood maximization without incorporating topic regularization can lead to an overly expansive latent space for topic modeling. In this paper, we present an innovative approach to NTMs that addresses this misalignment by introducing contrastive learning measures to assess topic interpretability. We propose a novel NTM framework, named ContraTopic, that integrates a differentiable regularizer capable of evaluating multiple facets of topic interpretability throughout the training process. Our regularizer adopts a unique topic-wise contrastive methodology, fostering both internal coherence within topics and clear external distinctions among them. Comprehensive experiments conducted on three diverse datasets demonstrate that our approach consistently produces topics with superior interpretability compared to state-of-the-art NTMs. © 2024 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Efficient Bit-Plane Based Medical Image Cryptosystem Using Novel and Robust Sine-Cosine Chaotic Map

引用

Computers, Materials & Continua 2025年第4期83卷 917-933页

作者： Zeric Tabekoueng Njitacke Louai A.Maghrabi Musheer Ahmad Turki Althaqafi Department of Electrical and Electronic Engineering College of Technology(COT)University of BueaBueaP.O.Box 63Cameroon Department of Software Engineering College of EngineeringUniversity of Business and TechnologyJeddah22246Saudi Arabia Department of Computer Engineering Jamia Millia IslamiaNew Delhi110025India Department of Computer Science School of EngineeringComputing and DesignDar Al-Hekma UniversityJeddah22246Saudi Arabia

This paper presents a high-security medical image encryption method that leverages a novel and robust sine-cosine *** map demonstrates remarkable chaotic dynamics over a wide range of *** employ nonlinear analytical tools to thoroughly investigate the dynamics of the chaotic map,which allows us to select optimal parameter configurations for the encryption *** findings indicate that the proposed sine-cosine map is capable of generating a rich variety of chaotic attractors,an essential characteristic for effective *** encryption technique is based on bit-plane decomposition,wherein a plain image is divided into distinct bit *** planes are organized into two matrices:one containing the most significant bit planes and the other housing the least significant *** subsequent phases of chaotic confusion and diffusion utilize these matrices to enhance *** auxiliary matrix is then generated,comprising the combined bit planes that yield the final encrypted *** results demonstrate that our proposed technique achieves a commendable level of security for safeguarding sensitive patient information in medical *** a result,image quality is evaluated using the Structural Similarity Index(SSIM),yielding values close to zero for encrypted images and approaching one for decrypted ***,the entropy values of the encrypted images are near 8,with a Number of Pixel Change Rate(NPCR)and Unified Average Change Intensity(UACI)exceeding 99.50%and 33%,***,quantitative assessments of occlusion attacks,along with comparisons to leading algorithms,validate the integrity and efficacy of our medical image encryption approach.

关键词： Image cryptosystem robust chaos sine-cosine map nonlinear analysis tools medical images

来源：评论

学校读者我要写书评

暂无评论

Advanced Mechanisms of Perception in the Digital Hide and Seek Game Based on Deep Learning 5

Advanced Mechanisms of Perception in the Digital Hide and Se...

引用

5th IEEE International Conference on Smart Systems and Technologies, SST 2022

作者： Livada, Časlav Hodak, David Department of Software Engineering Faculty of Electrical Engineering Computing and Information Osijek Croatia Faculty of Electrical Engineering Computing and Information Osijek Croatia

ISBN: (数字)9781665482158

ISBN: (纸本)9781665482158

The goal of this paper is to demonstrate the power of machine learning and deep learning combined with powerful tools used in creating virtual simulations. This is made possible by the Unity Game Engine, a software used for the development of 2D and 3D video games and simulations, and the ML-agents plugin, which contains algorithms for training intelligent agents. The basic principles and algorithms of Deep Learning are described. Agent uses these methods to perceive the environment and solve certain tasks. In this paper, a simulation is created in which the agent tries to find hidden objects using machine learning. When the agent finds an item, a new location for the item is randomly generated. It must also complete the task in a specified amount of time. With the right implementation and parameters, the agent could successfully complete the task. © 2022 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：