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

Estimating Noisy Class Posterior with Part-level Labels for Noisy Label Learning

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhao, Rui Shi, Bin Ruan, Jianfei Pan, Tianze Dong, Bo School of Computer Science and Technology Xi’an Jiaotong University China Shaanxi Province Key Lab of Big Data Knowledge Engineering Xi’an Jiaotong University China School of Physics Xi’an Jiaotong University China School of Distance Education Xi’an Jiaotong University China

In noisy label learning, estimating noisy class posteriors plays a fundamental role for developing consistent classifiers, as it forms the basis for estimating clean class posteriors and the transition matrix. Existing methods typically learn noisy class posteriors by training a classification model with noisy labels. However, when labels are incorrect, these models may be misled to overemphasize the feature parts that do not reflect the instance characteristics, resulting in significant errors in estimating noisy class posteriors. To address this issue, this paper proposes to augment the supervised information with part-level labels, encouraging the model to focus on and integrate richer information from various parts. Specifically, our method first partitions features into distinct parts by cropping instances, yielding part-level labels associated with these various parts. Subsequently, we introduce a novel single-to-multiple transition matrix to model the relationship between the noisy and part-level labels, which incorporates part-level labels into a classifier-consistent framework. Utilizing this framework with part-level labels, we can learn the noisy class posteriors more precisely by guiding the model to integrate information from various parts, ultimately improving the classification performance. Our method is theoretically sound, while experiments show that it is empirically effective in synthetic and real-world noisy benchmarks. Copyright © 2024, The Authors. All rights reserved.

关键词： Contrastive Learning

Low-altitude Friendly-Jamming for Satellite-Maritime Communications via Generative AI-enabled Deep Reinforcement Learning

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Huang, Jiawei Wang, Aimin Sun, Geng Li, Jiahui Wang, Jiacheng Niyato, Dusit Leung, Victor C.M. College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore Artificial Intelligence Research Institute Shenzhen MSU-BIT University Shenzhen518115 China College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Department of Electrical and Computer Engineering The University of British Columbia VancouverV6T 1Z4 Canada

Low Earth Orbit (LEO) satellites can be used to assist maritime wireless communications for data transmission across wide-ranging areas. However, extensive coverage of LEO satellites, combined with openness of channels, can cause the communication process to suffer from security risks. This paper presents a low-altitude friendly-jamming LEO satellite-maritime communication system enabled by a unmanned aerial vehicle (UAV) to ensure data security at the physical layer. Since such a system requires trade-off policies that balance the secrecy rate and energy consumption of the UAV to meet evolving scenario demands, we formulate a secure satellite-maritime communication multi-objective optimization problem (SSMCMOP). In order to solve the dynamic and long-term optimization problem, we reformulate it into a Markov decision process. We then propose a transformer-enhanced soft actor critic (TransSAC) algorithm, which is a generative artificial intelligence-enable deep reinforcement learning approach to solve the reformulated problem, so that capturing global dependencies and diversely exploring weights. Simulation results demonstrate that the TransSAC outperforms various baselines, and achieves an optimal secrecy rate while effectively minimizing the energy consumption of the UAV. Moreover, the results find more suitable constraint values for the system. Copyright © 2025, The Authors. All rights reserved.

关键词： Multiobjective optimization

A Baseline for Early Classification of Time Series in An Open World

学校读者我要写书评

暂无评论

A Baseline for Early Classification of Time Series in An Ope...

IEEE Annual International Computer Software and Applications Conference (COMPSAC)

作者： Junwei Lv Xuegang Hu Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Hefei University of Technology Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China

ISBN: (数字)9781665488105

ISBN: (纸本)9781665488112

Early classification of time series aims to accurately predict the class label of a time series as early as possible, which is significant but challenging in many time-sensitive applications. Existing early classification methods hold a basic closed-world assumption that the classifier must have seen the classes of test samples. However, new samples that do not belong to any trained class may appear in the real world. In this paper, we first address the early classification in an open world and design two detectors to identify which known class or unknown class a sample belongs to. Specifically, based on the observed data, an early known-class detector is designed to determine the known-class confidence and an early unknown-class detector is designed to determine the unknown-class confidence according to the Minimum Reliable Length (MRL) and the Weibull distribution of each class. Experimental results evaluated on real-world datasets demonstrate that the proposed model can identify samples of unknown and known classes accurately and early.

关键词： Computational modeling Conferences Time series analysis Detectors Reliability engineering Software Weibull distribution

Hypernode: Entity Fusion for data Traceability and Link Prediction

学校读者我要写书评

暂无评论

Hypernode: Entity Fusion for Data Traceability and Link Pred...

IEEE International Conference on data Mining (ICDM)

作者： Bingbing Dong Zan Zhang Jiao Li Yi Zhu Chenyang Bu Xindong Wu Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology China School of Computer Science and Information Engineering Hefei University of Technology Hefei China Institute of Big Knowledge Science Hefei University of Technology Hefei China School of Information Engineering Yangzhou University Yangzhou China

In the era of big data, fragmented knowledge, multisource heterogeneity, and different representation forms of the same entities in various data sources have posed considerable challenges to entity fusion. How to effectively integrate multisource knowledge for the same entities has provoked vast amounts of attention and research from multiple disciplines. Most existing methods for entity fusion can be categorized into two classes: one is to establish an association between the same entities, and the other is to delete duplicate entities after knowledge fusion and create a new fusion entity. However, in these two classes of methods, the former does not achieve true knowledge fusion and semantic interoperability, while the latter may cause irreversible loss of original information. In this paper, we propose a novel entity fusion scheme: Hypernode. Hypernode fuses the same entity in different data sources into a new entity while retaining the original data. We verify the effectiveness of Hypernode on multiple models of link prediction experiments. Several practical application cases illustrate the applicability of Hypernode in data traceability, open domain knowledge fusion, and multi-modal knowledge graph fusion.

关键词： Fuses Soft sensors Semantics Predictive models Big data Cognition data mining

OpenKG Chain:A Blockchain Infrastructure for Open knowledge Graphs

学校读者我要写书评

暂无评论

data Intelligence 2021年第2期3卷 205-227页

作者： Huajun Chen Ning Hu Guilin Qi Haofen Wang Zhen Bi Jie Li Fan Yang College of Computer Science&AZFT Knowledge Engine Lab Zhejiang UniversityHangzhou 310058China Ontology Foundation Venture Drive#11-31Vision ExchangeSingapore 608526Singapore School of Computer Science and Engineering Southeast UniversityNanjing 211189China Intelligent Big Data Visualization Lab Tongji UniversityShanghai 200092China

The early concept of knowledge graph originates from the idea of the semantic Web,which aims at using structured graphs to model the knowledge of the world and record the relationships that exist between *** publishing knowledge bases as open data on the Web has gained significant *** China,Chinese Information Processing Society of China(CIPS)launched the OpenKG in 2015 to foster the development of Chinese Open knowledge *** existing open knowledge-based programs,OpenKG chain is envisioned as a blockchain-based open knowledge *** article introduces the first attempt at the implementation of sharing knowledge graphs on OpenKG chain,a blockchain-based trust *** have completed the test of the underlying blockchain platform,and the on-chain test of OpenKG’s data set and tool set sharing as well as fine-grained knowledge crowdsourcing at the triple *** have also proposed novel definitions:K-Point and OpenKG Token,which can be considered to be a measurement of knowledge value and user value.1,033 knowledge contributors have been involved in two months of testing on the blockchain,and the cumulative number of on-chain recordings triggered by real knowledge consumers has reached 550,000 with an average daily peak value of more than 10,*** the first time,we have tested and realized on-chain sharing of knowledge at entity/triple granularity *** present,all operations on the data sets and tool sets at ***,as well as the triplets at OpenBase,are recorded on the chain,and corresponding value will also be generated and assigned in a trusted *** this effort,OpenKG chain looks forward to providing a more credible and traceable knowledge-sharing platform for the knowledge graph community.

关键词： Open knowledge graph Blockchain Decentralized distributed network Decentralized knowledge graph

HVIS: A Human-like Vision and Inference System for Human Motion Prediction

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Lyu, Kedi Chen, Haipeng Liu, Zhenguang Yin, Yifang Lin, Yukang Jiao, Yingying 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 The State Key Laboratory of Blockchain and Data Security Zhejiang University Hangzhou China Institute of Blockchain and Data Security Hangzhou China A*STAR Singapore Tsinghua Shenzhen International Graduate School Nanshan District Shenzhen China

Grasping the intricacies of human motion, which involve perceiving spatio-temporal dependence and multi-scale effects, is essential for predicting human motion. While humans inherently possess the requisite skills to navigate this issue, it proves to be markedly more challenging for machines to emulate. To bridge the gap, we propose the Human-like Vision and Inference System (HVIS) for human motion prediction, which is designed to emulate human observation and forecast future movements. HVIS comprises two components: the human-like vision encode (HVE) module and the human-like motion inference (HMI) module. The HVE module mimics and refines the human visual process, incorporating a retina-analog component that captures spatiotemporal information separately to avoid unnecessary crosstalk. Additionally, a visual cortex-analogy component is designed to hierarchically extract and treat complex motion features, focusing on both global and local features of human poses. The HMI is employed to simulate the multi-stage learning model of the human brain. The spontaneous learning network simulates the neuronal fracture generation process for the adversarial generation of future motions. Subsequently, the deliberate learning network is optimized for hard-to-train joints to prevent misleading learning. Experimental results demonstrate that our method achieves new state-of-the-art performance, significantly outperforming existing methods by 19.8% on Human3.6M, 15.7% on CMU Mocap, and 11.1% on G3D. © 2025, CC BY.

关键词： Motion estimation

Multi-objective Aerial Collaborative Secure Communication Optimization via Generative Diffusion Model-enabled Deep Reinforcement Learning

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhang, Chuang Sun, Geng Li, Jiahui Wu, Qingqing Wang, Jiacheng Niyato, Dusit Liu, Yuanwei The College of Computer Science and Technology Jilin University Changchun130012 China The Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China The College of Computer Science and Technology Jilin University Changchun130012 China The College of Computing and Data Science Nanyang Technological University 639798 Singapore The Department of Electronic Engineering Shanghai Jiao Tong University Shanghai China The College of Computing and Data Science Nanyang Technological University 639798 Singapore The School of Electronic Engineering and Computer Science Queen Mary University of London LondonE1 4NS United Kingdom

Due to flexibility and low-cost, unmanned aerial vehicles (UAVs) are increasingly crucial for enhancing coverage and functionality of wireless networks. However, incorporating UAVs into next-generation wireless communication systems poses significant challenges, particularly in sustaining high-rate and long-range secure communications against eavesdropping attacks. In this work, we consider a UAV swarm-enabled secure surveillance network system, where a UAV swarm forms a virtual antenna array to transmit sensitive surveillance data to a remote base station (RBS) via collaborative beamforming (CB) so as to resist mobile eavesdroppers. Specifically, we formulate an aerial secure communication and energy efficiency multi-objective optimization problem (ASCEE-MOP) to maximize the secrecy rate of the system and to minimize the flight energy consumption of the UAV swarm. To address the non-convex, NP-hard and dynamic ASCEE-MOP, we propose a generative diffusion model-enabled twin delayed deep deterministic policy gradient (GDMTD3) method. Specifically, GDMTD3 leverages an innovative application of diffusion models to determine optimal excitation current weights and position decisions of UAVs. The diffusion models can better capture the complex dynamics and the trade-off of the ASCEE-MOP, thereby yielding promising solutions. Simulation results highlight the superior performance of the proposed approach compared with traditional deployment strategies and some other deep reinforcement learning (DRL) benchmarks. Moreover, performance analysis under various parameter settings of GDMTD3 and different numbers of UAVs verifies the robustness of the proposed approach. Copyright © 2024, The Authors. All rights reserved.

关键词： Energy efficiency

Uncertainty-based Model Acceleration for Cancer Classification in Whole-Slide Images

学校读者我要写书评

暂无评论

Uncertainty-based Model Acceleration for Cancer Classificati...

2022 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2022

作者： Gao, Zeyu Mao, Anyu Wu, Jialun Li, Yang Wang, Chunbao Ding, Caixia Gong, Tieliang Li, Chen Xi'an Jiaotong University School of Computer Science and Technology Xi'an China Xi'an Jiaotong University Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi'an China The First Affiliated Hospital of Xi'an Jiaotong University Department of Pathology Xi'an China Shaanxi Provincial Cancer Hospital Department of Pathology Xi'an China

ISBN: (纸本)9781665468190

Computational Pathology (CPATH) offers the possibility for highly accurate and low-cost automated pathological diagnosis. However, the high time cost of model inference is one of the main issues limiting the application of CPATH methods. Due to the large size of Whole-Slide Image (WSI), commonly used CPATH methods divided a WSI into a large number of image patches at relatively high magnification, then predicted each image patch individually, which is time-consuming. In this paper, we propose a novel Uncertainty-based Model Acceleration (UMA) method for reducing the time cost of model inference, thereby relieving the deployment burden of CPATH applications. Enlightened by the slide-viewing process of pathologists, only a few high-uncertain regions are regarded as 'suspicious' regions that need to be predicted at high magnification, and most of the regions in WSI are predicted at low magnification, thereby reducing the times of image patch extraction and prediction. Meanwhile, uncertainty estimation ensures prediction accuracy at low magnification. We take two fundamental CPATH classification tasks (i.e., cancer region detection and subtyping) as examples. Extensive experiments on two large-scale renal cell carcinoma classification datasets demonstrate that our UMA can significantly reduce the time cost of model inference while maintaining competitive classification performance. © 2022 IEEE.

关键词： Diseases

Reproducibility and Geometric Intrinsic Dimensionality: An Investigation on Graph Neural Network Research

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Hille, Tobias Stubbemann, Maximilian Hanika, Tom Knowledge & Data Engineering Group University of Kassel Kassel Germany Interdisciplinary Research Center for Information System Design University of Kassel Kassel Germany Information Systems and Machine Learning Lab University of Hildesheim Hildesheim Germany Institute of Computer Science University of Hildesheim Hildesheim Germany

Difficulties in replication and reproducibility of empirical evidences in machine learning research have become a prominent topic in recent years. Ensuring that machine learning research results are sound and reliable requires reproducibility, which verifies the reliability of research findings using the same code and data. This promotes open and accessible research, robust experimental workflows, and the rapid integration of new findings. Evaluating the degree to which research publications support these different aspects of reproducibility is one goal of the present work. For this we introduce an ontology of reproducibility in machine learning and apply it to methods for graph neural networks. Building on these efforts we turn towards another critical challenge in machine learning, namely the curse of dimensionality, which poses challenges in data collection, representation, and analysis, making it harder to find representative data and impeding the training and inference processes. Using the closely linked concept of geometric intrinsic dimension we investigate to which extend the used machine learning models are influenced by the intrinsic dimension of the data sets they are trained *** Codes 68T01 68T07 68T09 51F99 Copyright © 2024, The Authors. All rights reserved.

关键词： Graph neural networks