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

2022 IEEE SmartWorld, 19th IEEE International Conference on Ubiquitous Intelligence and Computing, 2022 IEEE International Conference on Autonomous and Trusted Vehicles Conference, 22nd IEEE International Conference on Scalab.e Computing and Communications, 2022 IEEE International Conference on Digital Twin, 8th IEEE International Conference on Privacy Computing and 2022 IEEE International Conference on Metaverse, SmartWorld/UIC/ATC/ScalCom/DigitalTwin/PriComp/Metaverse 2022

作者： Li, Yang Li, Qianmu Meng, Shunmei Hou, Jun Nanjing University of Science and Technology School of Computer Science and Engineering Nanjing China Wuyi University Intelligent Manufacturing Department Jiangmen China Nanjing University State Key Lab. for Novel Software Technology Nanjing China Nanjing Vocational University of Industry Technology School of Social Science Nanjing China

ISBN: (纸本)9798350346558

As a fundamental means of intelligent service, recommender systems have shown a trend of diversification. Sequential recommendation, a class of time-aware methods, aims to predict the user's next click. Multi-interest representation is a hot topic in recommender systems, but the research on how to apply multi-interest into sequences is still in the minority. And many methods will introduce knowledge graph to improve the representation of items, but how to consider both knowledge graph and user's multi-interest in sequential recommendation has become a temporary blank. In this paper, we propose an attentive sequential recommendation with knowledge-aware multi-interest module (AKAMI). Items are embedded from the sequence's structure and user's interests. Specifically, we represent items by stacking self-attention layers to mine the internal correlation of the sequence. Meanwhile, we segment the sequence via the common neighbors in the knowledge graph and cast the user's multi-interest based on the aggregation of subsequences. Multi-interests are integrated into item representation by the gating network adaptively. Comprehensive experiments on two real-world datasets show that the proposed model performs better than various representative methods under different evaluation metrics. Additionally, we also visually explain the model through a case study. © 2022 IEEE.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Solving Math Word Problems Following Logically Consistent Template

Solving Math Word Problems Following Logically Consistent Te...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Zeyu Huang Xiaofeng Zhang Jun Bai Wenge Rong Yuanxin Ouyang Zhang Xiong State Key Laboratory of Software Development Environment Beihang University Beijing China Sino-French Engineer School Beihang University Beijing China School of Computer Science and Engineering Beihang University Beijing China

Solving math word problems (MWPs) is a challenging task. Some existing solvers retrieve textually similar problems and draw on their solutions to solve the given problem. However, textually similar questions are not guaranteed to have similar solutions, and vice versa. Therefore, this work investigates the logical consistency among different problems and proposes a novel framework to solve math word problems following logically consistent templates. Experimental results show that our method outperforms many strong baselines, including some pre-trained language model-based methods. Further analysis shows that our retrieval method does learn the logical similarity between Questions and plays a crucial role in our model's nerformance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Subgraph-Oriented Heterogeneous Drug-Target Interaction Identification

Subgraph-Oriented Heterogeneous Drug-Target Interaction Iden...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Xiaofeng Zhang Zeyu Huang Jun Bai Wenge Rong Yuanxin Ouyang Zhang Xiong State Key Laboratory of Software Development Environment Beihang University Beijing China Sino-French Engineer School Beihang University Beijing China School of Computer Science and Engineering Beihang University Beijing China

Drug-target interaction (DTI) is an important task in drug discovery and drug repurposing. Currently, most methods utilizing drug-based and protein-based similarity values to predict DTIs achieve promising results. However, calculating similarities for each pair of nodes is time-consuming, especially for relatively large datasets. In this research, we propose a novel subgraph-oriented heterogeneous DTI identification method that transforms the DTI task from a link prediction task to a subgraph classification task. For each link, a local subgraph around this link is extracted. Then, a subgraph lab.ling process distinguishes different topologies of subgraphs. A random walk-based node representation generation is also integrated with the model. Finally, we apply a graph neural network for the subgraph classification. Our method avoids incorporating human-made similarity values by extracting more meaningful local subgraph topological information. Experimental studies for known DTI predictions on two DTI datasets show promising results for DTI prediction. Empirical results for new DTI predictions on two external public databases show the generalization ability of the proposed method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Leveraging Predicate and Triplet Learning for Scene Graph Generation

arXiv

引用

arXiv 2024年

作者： Li, Jiankai Wang, Yunhong Guo, Xiefan Yang, Ruijie Li, Weixin IRIP Lab School of Computer Science and Engineering Beihang University Beijing China State Key Laboratory of Complex & Critical Software Environment Beihang University Beijing China Shanghai Artificial Intelligence Laboratory Shanghai China

Scene Graph Generation (SGG) aims to identify entities and predict the relationship triplets in visual scenes. Given the prevalence of large visual variations of subject-object pairs even in the same predicate, it can be quite challenging to model and refine predicate representations directly across such pairs, which is however a common strategy adopted by most existing SGG methods. We observe that visual variations within the identical triplet are relatively small and certain relation cues are shared in the same type of triplet, which can potentially facilitate the relation learning in SGG. Moreover, for the long-tail problem widely studied in SGG task, it is also crucial to deal with the limited types and quantity of triplets in tail predicates. Accordingly, in this paper, we propose a Dual-granularity Relation Modeling (DRM) network to leverage fine-grained triplet cues besides the coarse-grained predicate ones. DRM utilizes contexts and semantics of predicate and triplet with Dual-granularity Constraints, generating compact and balanced representations from two perspectives to facilitate relation recognition. Furthermore, a Dual-granularity Knowledge Transfer (DKT) strategy is introduced to transfer variation from head predicates/triplets to tail ones, aiming to enrich the pattern diversity of tail classes to alleviate the long-tail problem. Extensive experiments demonstrate the effectiveness of our method, which establishes new state-of-the-art performance on Visual Genome, Open Image, and GQA datasets. Our code is availab.e at https://***/jkli1998/DRM Copyright © 2024, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Leveraging Predicate and Triplet Learning for Scene Graph Generation

Leveraging Predicate and Triplet Learning for Scene Graph Ge...

引用

Conference on computer Vision and Pattern Recognition (CVPR)

作者： Jiankai Li Yunhong Wang Xiefan Guo Ruijie Yang Weixin Li IRIP Lab School of Computer Science and Engineering Beihang University Beijing China State Key Laboratory of Complex & Critical Software Environment Beihang University Beijing China Shanghai Artificial Intelligence Laboratory Shanghai China

ISBN: (数字)9798350353006

ISBN: (纸本)9798350353013

关键词： Visualization Head Triples (Data structure) Semantics Genomics Tail Pattern recognition

来源：评论

学校读者我要写书评

暂无评论

Efficient Data Valuation Approximation in Federated Learning: A Sampling-based Approach

arXiv

引用

arXiv 2025年

作者： Wei, Shuyue Tong, Yongxin Zhou, Zimu He, Tianran Xu, Yi State Key Laboratory of Complex & Critical Software Environment Lab School of Computer Science and Engineering Beijing Advanced Innovation Center for Future Blockchain and Privacy Computing Beihang University China City University of Hong Kong Hong Kong

Federated learning (FL) has emerged as a prominent distributed learning paradigm to utilize datasets across multiple data providers. In FL, cross-silo data providers often hesitate to share their high-quality dataset unless their data value can be fairly assessed. Shapley value (SV) has been advocated as the standard metric for data valuation in FL due to its desirable properties. However, the computational overhead of SV is prohibitive in practice, as it inherently requires training and evaluating an FL model across an exponential number of dataset combinations. Furthermore, existing solutions fail to achieve high accuracy and efficiency, making practical use of SV still out of reach, because they ignore choosing suitable computation scheme for approximation framework and overlook the property of utility function in FL. We first propose a unified stratified-sampling framework for two widely-used schemes. Then, we analyze and choose the more promising scheme under the FL linear regression assumption. After that, we identify a phenomenon termed key combinations, where only limited dataset combinations have a high-impact on final data value. Building on these insights, we propose a practical approximation algorithm, IPSS, which strategically selects high-impact dataset combinations rather than evaluating all possible combinations, thus substantially reducing time cost with minor approximation error. Furthermore, we conduct extensive evaluations on the FL benchmark datasets to demonstrate that our proposed algorithm outperforms a series of representative baselines in terms of efficiency and effectiveness. Copyright © 2025, The Authors. All rights reserved.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Unsupervised Recognition of Unknown Objects for Open-World Object Detection

arXiv

引用

arXiv 2023年

作者： Fang, Ruohuan Pang, Guansong Zhou, Lei Bai, Xiao Zheng, Jin School of Computer Science and Engineering State Key Laboratory of Software Development Environment Jiangxi Research Institute Beihang University China School of Computing and Information Systems Singapore Management University Singapore School of Computer Science and Artificial Intelligence Wuhan University of Technology China

Open-World Object Detection (OWOD) extends object detection problem to a realistic and dynamic scenario, where a detection model is required to be capable of detecting both known and unknown objects and incrementally learning newly introduced knowledge. Current OWOD models, such as ORE and OW-DETR, focus on pseudo-lab.ling regions with high objectness scores as unknowns, whose performance relies heavily on the supervision of known objects. While they can detect the unknowns that exhibit similar features to the known objects, they suffer from a severe lab.l bias problem that they tend to detect all regions (including unknown object regions) that are dissimilar to the known objects as part of the background. To eliminate the lab.l bias, this paper proposes a novel approach that learns an unsupervised discriminative model to recognize true unknown objects from raw pseudo lab.ls generated by unsupervised region proposal methods. The resulting model can be further refined by a classification-free self-training method which iteratively extends pseudo unknown objects to the unlab.led regions. Experimental results show that our method 1) significantly outperforms the prior SOTA in detecting unknown objects while maintaining competitive performance of detecting known object classes on the MS COCO dataset, and 2) achieves better generalization ability on the LVIS and Objects365 datasets. Code is availab.e at https://***/frh23333/mepu-owod. Copyright © 2023, The Authors. All rights reserved.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Diving into Continual Ultra-fine-grained Visual Categorization

Diving into Continual Ultra-fine-grained Visual Categorizati...

引用

Proceedings of the Digital Image Computing: Technqiues and Applications (DICTA)

作者： Pengcheng Zhang Xiaohan Yu Xiao Bai Jin Zheng Xiaoyu Wu Yongsheng Gao School of Computer Science and Engineering State Key Laboratory of Software Development Environment Jiangxi Research Institute Beihang University Beijing China Institute for Integrated and Intelligent Systems Griffith University Nathan Australia

Recent advance in ultra-fine-grained visual categorization (ultra-FGVC) has significantly boosted the capability of deep neural networks for ultra-FGVC tasks. However, building models for continually learning to recognize increasing ultra-fine-grained categories is still under-explored. This limits the application of ultra-FGVC techniques in real-world production. To this, we take the first attempt for continual ultra-FGVC. By evaluating existing continual learning methods on the constructed continual ultra-FGVC benchmark, we observe that the main bottleneck lies in the limited model plasticity for incrementally adapting to new tasks. This can be caused by excessive anti-forgetting constraints as the difficult ultra-FGVC task requires substantial update of parameters, and over-fitting on early tasks given that the ultra-fine-grained categories are with very few training samples. To tackle these problems, we propose a joint self-supervised learning and prompting model. The prompt-based continual learning framework offers proper anti-forgetting operation by fixed pretrained vision transformer and adaptive prompt selection. By jointly optimizing the learnable prompts with an adversarial self-supervised loss, the over-fitting on each continual learning task is mitigated. Extensive experiments demonstrate that the proposed method outperforms existing continual learning methods on the challenging continual ultra-FGVC problem.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Adaptive Sparse Convolutional Networks with Global Context Enhancement for Faster Object Detection on Drone Images

arXiv

引用

arXiv 2023年

作者： Du, Bowei Huang, Yecheng Chen, Jiaxin Huang, Di State Key Laboratory of Software Development Environment Beihang University Beijing China School of Computer Science and Engineering Beihang University Beijing China Hangzhou Innovation Institute Beihang University Hangzhou China

Object detection on drone images with low-latency is an important but challenging task on the resource-constrained unmanned aerial vehicle (UAV) platform. This paper investigates optimizing the detection head based on the sparse convolution, which proves effective in balancing the accuracy and efficiency. Nevertheless, it suffers from inadequate integration of contextual information of tiny objects as well as clumsy control of the mask ratio in the presence of foreground with varying scales. To address the issues above, we propose a novel global context-enhanced adaptive sparse convolutional network (CEASC). It first develops a context-enhanced group normalization (CE-GN) layer, by replacing the statistics based on sparsely sampled features with the global contextual ones, and then designs an adaptive multilayer masking strategy to generate optimal mask ratios at distinct scales for compact foreground coverage, promoting both the accuracy and efficiency. Extensive experimental results on two major benchmarks, i.e. VisDrone and UAVDT, demonstrate that CEASC remarkably reduces the GFLOPs and accelerates the inference procedure when plugging into the typical state-of-the-art detection frameworks (e.g. RetinaNet and GFL V1) with competitive performance. Code is availab.e at https://***/Cuogeihong/CEASC. Copyright © 2023, The Authors. All rights reserved.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Evaluating Open-Domain Dialogues in Latent Space with Next Sentence Prediction and Mutual Information

arXiv

引用

arXiv 2023年

作者： Zhao, Kun Yang, Bohao Lin, Chenghua Rong, Wenge Villavicencio, Aline Cui, Xiaohui Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Cyber Science and Engineering Wuhan University China Department of Computer Science The University of Sheffield United Kingdom State Key Laboratory of Software Development Environment Beihang University China School of Computer Science and Engineering Beihang University China

The long-standing one-to-many issue of the open-domain dialogues poses significant challenges for automatic evaluation methods, i.e., there may be multiple suitable responses which differ in semantics for a given conversational context. To tackle this challenge, we propose a novel learning-based automatic evaluation metric (CMN), which can robustly evaluate open-domain dialogues by augmenting Conditional Variational Autoencoders (CVAEs) with a Next Sentence Prediction (NSP) objective and employing Mutual Information (MI) to model the semantic similarity of text in the latent space. Experimental results on two open-domain dialogue datasets demonstrate the superiority of our method compared with a wide range of baselines, especially in handling responses which are distant to the golden reference responses in semantics. Copyright © 2023, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：