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

31st International Conference on Computational Linguistics, COLING 2025

作者： Wang, Hao Nuo, Minghua Jiang, Shan College of Computer Science Inner Mongolia University Inner Mongolia Hohhot010021 China National and Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian Inner Mongolia Hohhot010021 China Inner Mongolia Key Laboratory of Multilingual Artificial Intelligence Technology Inner Mongolia Hohhot010021 China

ISBN: (纸本)9798891761964

The Knowledge Graph Entity Typing (KGET) task aims to predict missing type annotations for entities in knowledge graphs. Most recent studies only focus on the structural information from an entity's neighborhood or semantic information from textual representations of entities or relations. In this paper, inspired by curriculum learning and contrastive learning, we propose the CCLET model using the Curriculum Contrastive Learning strategy for KGET, which uses the Pre-trained Language Model (PLM) and the graph model to fuse the entity related semantic and the structural information of the Knowledge Graph (KG) respectively. Our CCLET model consists of two main parts. In the Knowledge Fusion part, we design an Enhanced-MLP architecture to fuse the text of the entity's description, related triplet and tuples;In the Curriculum Contrastive Learning part, we define the difficulty of the training course by controlling the level of added noise, we aim to accurately learn with curriculum contrastive learning strategy from easy to difficult. Our extensive experiments demonstrate that the CCLET model outperforms recent state-of-the-art models, verifying its effectiveness in the KGET task. © 2025 Association for Computational Linguistics.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

GNN-Transformer Cooperative Architecture for Trustworthy Graph Contrastive Learning

arXiv

引用

arXiv 2024年

作者： Liang, Jianqing Wei, Xinkai Chen, Min Wang, Zhiqiang Liang, Jiye Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Education School of Computer and Information Technology Shanxi University Shanxi Taiyuan030006 China

Graph contrastive learning (GCL) has become a hot topic in the field of graph representation learning. In contrast to traditional supervised learning relying on a large number of labels, GCL exploits augmentation strategies to generate multiple views and positive/negative pairs, both of which greatly influence the performance. Unfortunately, commonly used random augmentations may disturb the underlying semantics of graphs. Moreover, traditional GNNs, a type of widely employed encoders in GCL, are inevitably confronted with over-smoothing and over-squashing problems. To address these issues, we propose GNN-Transformer Cooperative Architecture for Trustworthy Graph Contrastive Learning (GTCA), which inherits the advantages of both GNN and Transformer, incorporating graph topology to obtain comprehensive graph representations. Theoretical analysis verifies the trustworthiness of the proposed method. Extensive experiments on benchmark datasets demonstrate state-of-the-art empirical performance. Copyright © 2024, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

A Point–Set–Domain Image Object Matching Method for Airborne Object Localization

引用

Journal of Internet technology 2025年第3期26卷 303-314页

作者： Liu, Xiaomin Zhao, Runqi Li, Jun-Bao Pan, Jeng-Shyang Zhao, Huaqi The Heilongjiang Provincial Key Laboratory of Autonomous Intelligence and Information Processing Jiamusi University China Faculty of Computing Harbin Institute of Technology China College of Computer Science and Engineering Shandong University of Science and Technology China

Image object localization is an important research direction in the development of intelligent autonomous control systems for unmanned aerial vehicles (UAVs). Major challenges remain, such as cross-view images, large-scale deformation, and multitemporal variation. We propose a point–set–domain matching method to locate objects. First, the property constraints of a point, including sparsity, repeatability, and distinguishability, are combined into a keypoint response used to optimize convolutional neural networks, creating keypoint detector and feature descriptor models. With these models, we can improve the performance of point matching and obtain the corresponding keypoint set accurately. This approach solves the cross-view problem. Second, a spatial transformation model of the corresponding keypoint set is obtained using keypoint-constrained diffeomorphism matching, which can align the spatial location of two images and solve the large-scale deformation problem. Third, an approach combining probability statistics with watershed maximally stable extremal regions is proposed to divide the object image and reference image into several subregions, and then the similarity based on diffeomorphism is employed to localize the object in the UAV image, which solves the multitemporal variation problem. The experimental results show that the proposed method can successfully determine the location of the object in the UAV image. © 2025 Taiwan Academic Network Management Committee. All rights reserved.

关键词： Drones

来源：评论

学校读者我要写书评

暂无评论

A third-party platoon coordination service: Pricing under government subsidies

A third-party platoon coordination service: Pricing under go...

引用

作者： Bai, Ting Johansson, Alexander Li, Shaoyuan Johansson, Karl Henrik Mårtensson, Jonas School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm Sweden KTH Royal Institute of Technology Stockholm Sweden Department of Automation Shanghai Jiao Tong University Shanghai China Key Laboratory of System Control and Information Processing Shanghai Jiao Tong University Shanghai China Digital Futures Stockholm Sweden

This paper models a platooning system consisting of trucks and a third-party service provider (TPSP), which performs platoon coordination, distributes the platooning profit in platoons, and charges trucks in exchange for the services. Government subsidies used to incentivize platooning are also considered. We propose a pricing rule for the TPSP, which keeps part of the platooning profit including the subsidy each time a platoon is formed. In addition, a platoon coordination solution based on the distributed model predictive control (MPC) is proposed, in which the pricing rule under government subsidies is integrated. We perform a realistic simulation over the Swedish road network to evaluate the impact of the pricing rule and subsidies on the achieved profits and fuel savings. Our results show that subsidies are an effective mean to boost fuel savings from platooning. Moreover, the simulation study indicates that high pricing corresponds to a low platooning rate of the system, as trucks' incentives for platooning decrease. © 2023 The Authors. Asian Journal of Control published by John Wiley & Sons Australia, Ltd on behalf of Chinese Automatic Control Society.

关键词： Trucks

来源：评论

学校读者我要写书评

暂无评论

Graph External Attention Enhanced Transformer

arXiv

引用

arXiv 2024年

作者： Liang, Jianqing Chen, Min Liang, Jiye Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Education School of Computer and Information Technology Shanxi University Shanxi Taiyuan030006 China

The Transformer architecture has recently gained considerable attention in the field of graph representation learning, as it naturally overcomes several limitations of Graph Neural Networks (GNNs) with customized attention mechanisms or positional and structural encodings. Despite making some progress, existing works tend to overlook external information of graphs, specifically the correlation between graphs. Intuitively, graphs with similar structures should have similar representations. Therefore, we propose Graph External Attention (GEA) - a novel attention mechanism that leverages multiple external node/edge key-value units to capture inter-graph correlations implicitly. On this basis, we design an effective architecture called Graph External Attention Enhanced Transformer (GEAET), which integrates local structure and global interaction information for more comprehensive graph representations. Extensive experiments on benchmark datasets demonstrate that GEAET achieves state-of-the-art empirical performance. The source code is available for reproducibility at: https://***/icm1018/GEAET. Copyright © 2024, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Robust Self-Localization of Wireless Acoustic Sensor Networks

引用

IEEE Internet of Things Journal 2025年第12期12卷 21646-21661页

作者： Wang, Xu Hu, De Liu, Rui Bao, Feilong Inner Mongolia University College of Computer Science Hohhot010021 China National and Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian Hohhot 010021 China Inner Mongolia Key Laboratory of Mongolian Information Processing Technology Hohhot 010021 China

Wireless acoustic sensor networks (WASNs), or the so-called internet of audio things (IoAuTs), have attracted increasing attention in the IoT community. As the geometry structure of WASNs is required in audio/speech processing tasks like source localization or acoustic beamforming, automatic self-localization of sensors is necessary. However, most of the existing approaches suffer from poor stability, as their constructed cost functions involve non-convex programming. To address this issue, we investigate the robust self-localization (or geometry calibration) of WASNs in this paper. Specifically, a rough self-localization (RSL) method is first presented based on measurements including time-difference-of-arrivals (TDoAs), direction-of-arrivals (DoA), and energy-rates (ERs), and its closed-form solution is further derived. As ER estimates are sensitive to acoustic environments, the performance of the RSL method is somewhat limited. Therefore, a precise self-localization (PSL) method is then developed by building a weighted (and non-convex) TDoA-DoA cost function, after regarding the RSL approach as an initialization step. As the RSL offers better initial values compared with existing initialization strategies, the combination of RSL and PSL methods (named as RSL-PSL method) shows stronger robustness and stability. In addition, computational complexity of both RSL and PSL methods are analyzed in details. Finally, the Cramér-Rao Bound (CRB) of the PSL method is derived to show its theoretical lower bound. The proposed RSL-PSL method outperforms the state-of-the-arts in terms of stability and accuracy, which is confirmed by numerical real-world and simulation experiments. © 2014 IEEE.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

PCB Defect Detection Method Based on Improved RetinaNet 1

引用

4th International Conference on Machine Learning for Cyber Security, ML4CS 2022

作者： Xu, Yusheng Cao, Xinrong Hu, Rong Keikhosrokiani, Pantea Li, Zuoyong College of Computer Science and Mathematics Fujian University of Technology Fuzhou350118 China Fujian Provincial Key Laboratory of Information Processing and Intelligent Control College of Computer and Control Engineering Minjiang University Fuzhou350121 China School of Computer Sciences Universiti Sains Malaysia Penang11800 Malaysia

ISBN: (数字)9783031200991

ISBN: (纸本)9783031200984

In the electronic industry product quality control, PCB defect detection is a crucial part, which has the characteristics of small defect size and high similarity. The existing defect detection methods are still not good enough for detecting small target defects;therefore, the algorithm in this paper proposes an improved algorithm for PCB defect detection based on the RetinaNet model. The ResNet-D residual structure and efficient channel focus module are introduced in the model backbone network to enhance its feature extraction capability and achieve the purpose of improving the detection accuracy. At the same time, the method replaces the original multi-step learning decay strategy with a cosine annealing scheduling learning strategy, which optimizes the training process of the model. Finally, the performance of the method is verified on the publicly available PCB defect dataset from the Open laboratory of Intelligent Robotics, Peking University. The experimental results show that the algorithm improves the mAP value by 3.2% compared with the original algorithm, while the fastest detection speed reaches 36.9 FPS, which can effectively improve the defect detection performance of PCB. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Defects

来源：评论

学校读者我要写书评

暂无评论

Metric Learning with Distillation for Overcoming Catastrophic Forgetting 16th

Metric Learning with Distillation for Overcoming Catastrop...

引用

16th International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2021

作者： Yu, Piaoyao He, Juanjuan Min, Qilang Zhu, Qi College of Computer Science and Technology Wuhan University of Science and Technology Wuhan China Hubei Province Key Laboratory of Intelligent Information Processing and Real-Time Industrial System Wuhan China

ISBN: (纸本)9789811912528

In incremental learning, reducing catastrophic forgetting always adds additional weights to the classification layer when a new task comes. Moreover, it focuses on prediction accuracy, ignores mislabeling differences, and causes the learned features to be scattered. This paper removes the softmax and integrates depth metric learning to compute image embeddings, which doesn’t need to add extra weights or additional space for new classes. The distances of the data mapped in the old and new task spaces are calculated separately. Then, the distillation of depth metric learning is used to make the two distances as similar as possible to improve the performance of the old knowledge. The experimental results on Cifar10 and Tiny-ImageNet show that the proposed method can effectively alleviate catastrophic forgetting and enhance the effectiveness of incremental learning. © 2022, Springer Nature Singapore Pte Ltd.

关键词： Distillation

来源：评论

学校读者我要写书评

暂无评论

Kernel-Guided Texture-Aware Blind Super-Resolution via Uncertainty Learning 13

Kernel-Guided Texture-Aware Blind Super-Resolution via Uncer...

引用

13th International Conference on information technology in Medicine and Education, ITME 2023

作者： Zhao, Tingting Li, Zuoyong Quan, Li Zeng, Kun Teng, Shenghua College of Electronic and Information Engineering Shandong University of Science and Technology Qingdao266590 China Fujian Provincial Key Laboratory of Information Processing and Intelligent Control College of Computer and Control Engineering Minjiang University Fuzhou350121 China College of Computer Science and Big Data Fuzhou University Fuzhou350121 China

ISBN: (纸本)9798350319156

The accuracy of kernel estimation is critical to the performance of blind super-resolution (SR). Traditional kernel estimation methods usually use L1 or L2 loss function to minimize the difference between the estimated kernel and the ground-truth kernel. This tends to make the estimated kernel converge towards the average of all possible kernels, deviating from the ground-truth kernel. To improve the performance of kernel estimation, this paper proposes an uncertainty loss for training a kernel estimation network, focusing on regions with high uncertainty (variance) in the kernel. In addition, a texture-aware SR network is proposed that utilizes the Gumbel Softmax trick to pay more attention to the complex regions of the image texture, thus improving the SR performance. Extensive experiments on synthetic datasets show that our approach achieves promising performance. © 2023 IEEE.

关键词： Textures

来源：评论

学校读者我要写书评

暂无评论

RankDNN: Learning to Rank for Few-Shot Learning 37

RankDNN: Learning to Rank for Few-Shot Learning

引用

37th AAAI Conference on Artificial Intelligence, AAAI 2023

作者： Guo, Qianyu Haotong, Gong Wei, Xujun Fu, Yanwei Yu, Yizhou Zhang, Wenqiang Ge, Weifeng Nebula AI Group School of Computer Science Fudan University Shanghai China Shanghai Key Laboratory of Intelligent Information Processing Shanghai China Academy for Engineering & Technology Fudan University Shanghai China Department of Computer Science The University of Hong Kong Hong Kong

ISBN: (纸本)9781577358800

This paper introduces a new few-shot learning pipeline that casts relevance ranking for image retrieval as binary ranking relation classification. In comparison to image classification, ranking relation classification is sample efficient and domain agnostic. Besides, it provides a new perspective on few-shot learning and is complementary to state-of-the-art methods. The core component of our deep neural network is a simple MLP, which takes as input an image triplet encoded as the difference between two vector-Kronecker products, and outputs a binary relevance ranking order. The proposed RankMLP can be built on top of any state-of-the-art feature extractors, and our entire deep neural network is called the ranking deep neural network, or RankDNN. Meanwhile, RankDNN can be flexibly fused with other post-processing methods. During the meta test, RankDNN ranks support images according to their similarity with the query samples, and each query sample is assigned the class label of its nearest neighbor. Experiments demonstrate that RankDNN can effectively improve the performance of its baselines based on a variety of backbones and it outperforms previous state-of-the-art algorithms on multiple few-shot learning benchmarks, including miniImageNet, tieredImageNet, Caltech-UCSD Birds, and CIFAR-FS. Furthermore, experiments on the cross-domain challenge demonstrate the superior transferability of *** code is available at: https://***/guoqianyu-alberta/RankDNN. Copyright © 2023, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：