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

Generalized Category Discovery with Decoupled Prototypical Network

学校读者我要写书评

暂无评论

arXiv 2022年

作者： An, Wenbin Tian, Feng Zheng, Qinghua Ding, Wei Wang, QianYing Chen, Ping School of Automation Science and Engineering Xi’an Jiaotong University China School of Computer Science and Technology Xi’an Jiaotong University China National Engineering Laboratory for Big Data Analytics China Department of Computer Science University of Massachusetts Boston United States Lenovo Research Department of Engineering University of Massachusetts Boston United States

Generalized Category Discovery (GCD) aims to recognize both known and novel categories from a set of unlabeled data, based on another dataset labeled with only known categories. Without considering differences between known and novel categories, current methods learn about them in a coupled manner, which can hurt model’s generalization and discriminative ability. Furthermore, the coupled training approach prevents these models transferring category-specific knowledge explicitly from labeled data to unlabeled data, which can lose high-level semantic information and impair model performance. To mitigate above limitations, we present a novel model called Decoupled Prototypical Network (DPN). By formulating a bipartite matching problem for category prototypes, DPN can not only decouple known and novel categories to achieve different training targets effectively, but also align known categories in labeled and unlabeled data to transfer category-specific knowledge explicitly and capture high-level semantics. Furthermore, DPN can learn more discriminative features for both known and novel categories through our proposed Semantic-aware Prototypical Learning (SPL). Besides capturing meaningful semantic information, SPL can also alleviate the noise of hard pseudo labels through semantic-weighted soft assignment. Extensive experiments show that DPN outperforms state-of-the-art models by a large margin on all evaluation metrics across multiple benchmark datasets. Code and data are available at https://***/Lackel/DPN. Copyright © 2022, The Authors. All rights reserved.

关键词： Semantics

Context-Aware Feature Attention Model for Coreference Resolution on Biomedical Texts

学校读者我要写书评

暂无评论

Research Square

Research Square 2021年

作者： Li, Yufei Zhou, Xiangyu Ma, Jie Ma, Xiaoyong Li, Chen School of Computer Science and Technology Xi’an Jiaotong University Shaanxi Xi’an China National Engineering Lab for Big Data Analytics Xi’an Jiaotong University Shaanxi Xi’an China Shaanxi Province Key Laboratory of Satellite and Terrestrial Network Technology Research and Development Xi’an Jiaotong University Shaanxi Xi’an China

Background: Bio-entity Coreference resolution is an important task to gain a complete understanding of biomedical texts automatically. Previous neural network-based studies on this topic are domain system based methods which rely on some domain-specific information integration. However, for the identical mentions, this may lead to misleading information, as the model tends to get similar or even identical representations, which further leads to wrongful predictions. Results: we propose a new context-aware Feature Attention model to distinguish identical mentions effectively to better resolve coreference. The new model can represent identical mentions based on different contexts by adaptively exploiting features effectively. The proposed model substantially outperforms the state-of-the-art baselines on the BioNLP dataset with a 64.0% F1 score and further demonstrates superior performance on the differential representation and coreferential link of identical mentions. Conclusion: The context-aware Feature Attention model adaptively exploit features and represent identical mentions according to different contexts, which significantly makes the system obtain semantic information effectively and make more accurate predictions. Considering that this approach is still limited when context information is insufficient, we expect to utilize such information more fine-grained with the help of the external knowledge base in coreference resolution. © 2021, CC BY.

关键词： Semantics

Scientific data Lake for High Luminosity LHC project and other data-intensive particle and astro-particle physics experiments 5

学校读者我要写书评

暂无评论

Scientific Data Lake for High Luminosity LHC project and oth...

5th International Conference on Particle Physics and Astrophysics, ICPPA 2020

作者： Alekseev, A. Kiryanov, A. Klimentov, A. Korchuganova, T. Mitsyn, V. Oleynik, D. Smirnov, A. Smirnov, S. Zarochentsev, A. Compiler Technology Department Ivannikov Institute for System Programming of the Ras Moscow109004 Russia Cloud Technologies and Big Data Analytics Laboratory Plekhanov Russian University of Economics Moscow117997 Russia Atlas Group Universidad Andres Bello Santiago7550196 Chile Department of Computing Resources and Technologies Nrc "kurchatov Institute"-PNPI Gatchina188300 Russia Physics Department Brookhaven National Laboratory UptonNY11973 United States Laboratory of Information Technologies Joint Institute for Nuclear Research Dubna141980 Russia Institute of Nuclear Physics and Engineering National Research Nuclear University MEPhI Moscow115409 Russia Laboratory of Ultra-High Energy Physics Saint Petersburg State University Saint Petersburg198504 Russia

The next phase of LHC Operations-High Luminosity LHC (HL-LHC), which is aimed at ten-fold increase in the luminosity of proton-proton collisions at the energy of 14 TeV, is expected to start operation in 2027-2028 and will deliver an unprecedented scientific data volume of multi-exabyte scale. This amount of data has to be stored and the corresponding storage system should ensure fast and reliable data delivery for processing by scientific groups distributed all over the world. The present LHC computing and data processing model will not be able to provide the required infrastructure growth even taking into account the expected hardware technology evolution. To address this challenge the new state-of-The-Art computing infrastructure technologies are now being developed and are presented here. The possibilities of application of the HL-LHC distributed data handling technique for other particle and astro-particle physics experiments dealing with large-scale data volumes like DUNE, LSST, Belle-II, JUNO, SKAO etc. are also discussed. © Published under licence by IOP Publishing Ltd.

关键词： Luminance

Differential Privacy-based Avatar Update in Cooperative Intelligent Transportation System Metaverse

学校读者我要写书评

暂无评论

Differential Privacy-based Avatar Update in Cooperative Inte...

International Conference on Computer and Communications (ICCC)

作者： Salabat Khan Fei Luo Mansoor Khan Insaf Ullah Farhan Amin Shamsher Ullah Mussadiq Abdul Rahim School of Computer and Enformation Engineering Qilu Institute of Technology Jinan China School of Computing and Information Technology Great Bay University Dongguan China School of Intelligent Manufacturing and Control Engineering Qilu Institute of Technology Jinan China Institute for Analytics and Data Science University of Essex Colchester UK School of Computer Science and Engineering Yeungnam University South Korea National Engineering Laboratory for Big Data Shenzhen University Shenzhen China King Fahd University of Petroleum and Minerals (KFUPM) Dhahran Saudi Arabia

ISBN: (数字)9798331507077

ISBN: (纸本)9798331507084

Metaverse is the next generation and the successor to the Internet. Various sectors allocated capital to adapt the metaverse due to its inherent importance. Cooperative Intelligent Transportation Systems (C-ITS) is one of the important sectors that can benefit from metaverse adaptation and integration. The C-ITS and metaverse integration give rise to new use cases and cyber attacks. However, traditional Pseudonym Certificate (PCert) authentication based on Vehicular Public Key Infrastructure (VPKI) cannot meet the new use cases and thwart cyber attacks. We present a Differential Privacy (DP)-based PCert and avatar update model to ensure the privacy of end-devices (e.g., vehicles) in the C-ITS metaverse. The proposed DP-based model adds noise to avatar attributes (e.g., color, behavior) to prevent avatar linkage during the PCert update process. Our method ensures that PCerts and avatars cannot be linked to end-devices and the previous PCerts and avatars. We simulate the DP-based method to investigate it in terms of privacy, latency, color distortion, and adversarial success rate, and the results show that DP-based is effective and practical for avatar updates.

关键词： Privacy Metaverse Avatars Computational modeling Authentication Public key Color Colored noise Intelligent transportation systems Cyberattack

Tile Classification Based Viewport Prediction with Multi-modal Fusion Transformer

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Zhang, Zhihao Chen, Yiwei Zhang, Weizhan Yan, Caixia Zheng, Qinghua Wang, Qi Chen, Wangdu School of Computer Science and Technology Xi'an Jiaotong University Key Laboratory of Intelligent Networks and Network Security Ministry of Education Xi'an Jiaotong University Xi’an China School of Computer Science and Technology Xi'an Jiaotong University & National Engineering Lab for Big Data Analytics Xi'an Jiaotong University Xi’an China MIGU Video Shanghai China

Viewport prediction is a crucial aspect of tile-based 360◦ video streaming system. However, existing trajectory based methods lack of robustness, also oversimplify the process of information construction and fusion between different modality inputs, leading to the error accumulation problem. In this paper, we propose a tile classification based viewport prediction method with Multi-modal Fusion Transformer, namely MFTR. Specifically, MFTR utilizes transformer-based networks to extract the long-range dependencies within each modality, then mine intra- and inter-modality relations to capture the combined impact of user historical inputs and video contents on future viewport selection. In addition, MFTR categorizes future tiles into two categories: user interested or not, and selects future viewport as the region that contains most user interested tiles. Comparing with predicting head trajectories, choosing future viewport based on tile's binary classification results exhibits better robustness and interpretability. To evaluate our proposed MFTR, we conduct extensive experiments on two widely used PVS-HM and Xu-Gaze dataset. MFTR shows superior performance over state-of-the-art methods in terms of average prediction accuracy and overlap ratio, also presents competitive computation efficiency. © 2023, CC BY.

关键词： Forecasting

Federated dynamic neural network for deep MIMO detection

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Yang, Yuwen Gao, Feifei Xue, Jiang Zhou, Ting Xu, Zongben Department of Automation Tsinghua University Beijing100084 China The National Engineering Laboratory for Big Data Analytics Xi'an International Academy for Mathematics and Mathematical Technology School of Mathematics and Statistics Xi'an Jiaotong University Xi'an710049 China The Shanghai Advanced Research Institute CAS Shanghai Frontier Innovation and Research Institute Shanghai201210 China

In this paper, we develop a dynamic detection network (DDNet) based detector for multiple-input multiple-output (MIMO) systems. By constructing an improved DetNet (IDetNet) detector and the OAMPNet detector as two independent network branches, the DDNet detector performs sample-wise dynamic routing to adaptively select a better one between the IDetNet and the OAMPNet detectors for every samples under different system conditions. To avoid the prohibitive transmission overhead of dataset collection in centralized learning (CL), we propose the federated averaging (FedAve)-DDNet detector, where all raw data are kept at local clients and only locally trained model parameters are transmitted to the central server for aggregation. To further reduce the transmission overhead, we develop the federated gradient sparsification (FedGS)-DDNet detector by randomly sampling gradients with elaborately calculated probability when uploading gradients to the central server. Based on simulation results, the proposed DDNet detector consistently outperforms other detectors under all system conditions thanks to the sample-wise dynamic routing. Moreover, the federated DDNet detectors, especially the FedGS-DDNet detector, can reduce the transmission overhead by at least 25.7% while maintaining satisfactory detection accuracy. Copyright © 2021, The Authors. All rights reserved.

关键词： MIMO systems

Learnable Convolutional Attention Network for Knowledge Graph Completion

学校读者我要写书评

暂无评论

SSRN

SSRN 2023年

作者： Shang, Bin Zhao, Yinliang Liu, Jun School of Computer Science and Technology Xi’an Jiaotong University Shaanxi Xi’an710049 China Shaanxi Province Key Laboratory of Satellite and Terrestrial Network Tech. R&D Xi’an Jiaotong University Shaanxi Xi’an710049 China National Engineering Lab for Big Data Analytics Shaanxi Xi’an710049 China

Recently, graph convolutional networks (GCNs) and graph attention networks (GATs) have been widely used in knowledge graph completion (KGC), which aims to solve the incompleteness of knowledge graphs (KGs). However, GCNs based KGC models tend to stack redundant information when one entity have several noisy neighbors. GATs based KGC models may focus on certain neighbors and lead to weakening of structural information. Furthermore, relations in KGs have their specific semantics and should be considered when aggregating neighbor information (message passing). To address the above limitations, we propose a learnable convolutional attention network for knowledge graph completion named LCA-KGC. LCA-KGC introduces a knowledge graph convolutional attention network by using the convolution operation before the attention mechanism to ensure the structural information acquisition and avoid the redundant information stacking. Furthermore, to complete the autonomous switching of GNNs types and eliminate the necessity of pre-validating the local structure of KGs, LCA-KGC designs a learnable knowledge graph convolutional attention network by comprising three types of GNNs in one learnable formulation. Moreover, a learnable message function is proposed to emphasize relational semantics when aggregating neighbor information. Extensive experiments on standard KG datasets validate the effectiveness of the proposed innovations, and LCA-KGC achieves state-of-the-art (SOTA) performance compared to existing approaches (e.g., compared to SOTA approaches, LCA-KGC improves MRR from 0.360 to 0.372 on FB15k-237 dataset, and Hits@3 from 0.561 to 0.581 on YAGO3-10 dataset). © 2023, The Authors. All rights reserved.

关键词： Graph neural networks

Noise-Tolerant Learning for Audio-Visual Action Recognition

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Han, Haochen Zheng, Qinghua Luo, Minnan Miao, Kaiyao Tian, Feng Chen, Yan The National Engineering Lab for Big Data Analytics Xi’an Jiaotong University Xi’an710049 China The School of Computer Science and Technology Xi’an Jiaotong University Xi’an710049 China The Key Laboratory of Intelligent Networks and Network Security Xi’an Jiaotong University Ministry of Education Xi’an710049 China The School of Cyber Science and Engineering Xi’an Jiaotong University Xi’an710049 China

Recently, video recognition is emerging with the help of multi-modal learning, which focuses on integrating distinct modalities to improve the performance or robustness of the model. Although various multi-modal learning methods have been proposed and offer remarkable recognition results, almost all of these methods rely on high-quality manual annotations and assume that modalities among multi-modal data provide semantically relevant information. Unfortunately, the widely used video datasets are usually coarse-annotated or collected from the Internet. Thus, it inevitably contains a portion of noisy labels and noisy correspondence. To address this challenge, we use the audio-visual action recognition task as a proxy and propose a noise-tolerant learning framework to find anti-interference model parameters against both noisy labels and noisy correspondence. Specifically, our method consists of two phases that aim to rectify noise by the inherent correlation between modalities. First, a noise-tolerant contrastive training phase is performed to make the model immune to the possible noisy-labeled data. Despite the benefits brought by contrastive training, it would overfit the noisy correspondence and thus provide false supervision. To alleviate the influence of noisy correspondence, we propose a cross-modal noise estimation component to adjust the consistency between different modalities. As the noisy correspondence existed at the instance level, we further propose a category-level contrastive loss to reduce its interference. Second, in the hybrid-supervised training phase, we calculate the distance metric among features to obtain corrected labels, which are used as complementary supervision to guide the training. Furthermore, due to the lack of suitable datasets, we establish a benchmark of real-world noisy correspondence in audio-visual data by relabeling the Kinetics dataset. Extensive experiments on a wide range of noisy levels demonstrate that our method significant

关键词： Modal analysis

Protein Structure Prediction Using A New Optimization-Based Evolutionary and Explainable Artificial Intelligence Approach

学校读者我要写书评

暂无评论

IEEE Transactions on Evolutionary Computation 2024年第3期29卷 1-1页

作者： Hong, Jun Zhan, Zhi-Hui He, Langchong Xu, Zongben Zhang, Jun School of Computer Science and Engineering South China University of Technology Guangzhou P. R. China Health Science Center School of Pharmacy Xi’an Jiaotong University Xi’an P. R. China National Engineering Laboratory for Big Data Analytics Xi’an Jiaotong University Xi’an P. R. China College of Artificial Intelligence Nankai University Tianjin P. R. China

Protein structure prediction (PSP) is an important scientific problem because it helps humans to understand how proteins perform their biological functions. This paper models the PSP problem as a multi-objective optimization problem with three fast and accurate knowledge-based energy functions. This way, using evolutionary computation (EC)-based artificial intelligence (AI) approach to solve this multi-objective PSP problem to find the optimal structure is explainable. Considering that the multiple populations for multiple objectives (MPMO) framework shows efficient performance in solving lots of multi-objective benchmarks and real-world problems, this paper proposes a new AI approach named improved MPMO-based differential evolution (IMPMO-DE) to solve the multi-objective PSP problem. To our best knowledge, this is the first time that MPMO is applied to PSP, with three novel strategies. First, an adaptive archive-based mutation strategy is proposed to better balance the exploration and exploitation abilities by adaptively using different archive-based mutation operators in different evolutionary stages. Second, a mixed individual transfer strategy is proposed to share search information among the multiple populations to accelerate the convergence speed. Third, an evolvable archive update strategy is proposed to generate more promising solutions through evolving the archived solutions. IMPMO-DE is tested on 28 representative proteins and all the available template-free modeling proteins up to 404 residues in the famous Critical Assessment of Protein Structure Prediction (CASP14) competition. Experimental results show that IMPMO-DE performs better than the compared state-of-the-art EC-based PSP methods and ranks above average compared with all the CASP14 competitors. More importantly, IMPMO-DE is a new efficient AI approach that opens a promising optimization-based evolutionary and explainable way for efficient PSP rather than deep learning approaches like AlphaFold2,

关键词： Evolutionary algorithms