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

International Conference on Tools for Artificial Intelligence (ICTAI)

作者： Yuhong Zhang Haitao Shu Chenyang Bu Xuegang Hu Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China

Zero-shot learning aims to recognize unseen-classes using some seen-class samples as training set. It is challenging owing to that the feature representations of unseen-class samples are unavailable. Existing methods transfer the mapping from seen-classes to unseen-classes with the correlation as a bridge, in which, the semantic representations are used to discriminate the classes. However, the unavailability of visual representations for unseen-classes and the insufficient discrimination of semantic representations make the zero-shot learning challenging. Therefore, the visual representations are learned as complements to semantic representations to construct a multi-modal knowledge graph (KG), and a zero-shot learning method based on multi-modal KG is proposed in this paper. Specially, a semantic KG is introduced to capture the correlation of classes, and with the correlation, the visual feature representations of all classes are learned. Then, the discriminative visual representations and the semantic representations are used together to construct a multi-modal KG. With the multi-modal KG, the classifier for seen-classes is transferred to unseen classes. Extensive experimental results show the effectiveness of our method.

关键词： Learning systems Representation learning Training Bridges Visualization Correlation Semantics

来源：评论

学校读者我要写书评

暂无评论

引用

International Conference on Tools for Artificial Intelligence (ICTAI)

作者： Xinzheng Li Yuhong Zhang Peipei Li Xuegang Hu Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China

Cross-network node classification aims to use a labeled source network to classify nodes in an unlabeled target network. Most of the existing cross-network node classification methods learn the network representations by capturing the node neighborhood and train the classifier on these representations. The performance is highly dependent on the high-quality neighborhood in the network. However, in applications, the degree of nodes generally follows a long-tail distribution, i.e., a significant proportion of nodes are tail nodes with sparse neighborhood. It poses a challenge to existing methods. To this end, a structure similarity graph for cross-network node classitication method (SCNC) is proposed in this paper. Firstly, the potential links between nodes are predicted with the structural similarity metric to construct structure similarity graph, which can enrich the neighborhood of tail nodes. Then, the embedding representations of the structural similarity graph are learned to capture more neighborhood information. Finally, the adversarial is used to learn the domain invariant representations to address cross-network divergence. Extensive experimental results show that our SCNC outperforms the state-of-the-art methods.

关键词： Network topology Tail Learning (artificial intelligence) Prediction algorithms Classification algorithms Noise measurement Task analysis

来源：评论

学校读者我要写书评

暂无评论

Multi-source Multi-label Feature Selection

Multi-source Multi-label Feature Selection

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Xiulan Yuan Xuegang Hu Peipei Li Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology School of Computer Science and Information Engineering Hefei University of Technology Hefei City China Anhui Province Key Laboratory of Industry Safety and Emergency Technology Hefei City China

Feature selection for multi-source multi-label data has attracted much attention, because there are a lot of scenarios that produce multiple source data with multi-labels in the real-world applications, which aggravates the problems of dimensional disaster and the label skewness. However, most of existing multi-source feature selection methods miss the multi-label issue while existing multi-label feature selection methods can not select the optimal feature set in the multi-source environment. Motivated by this, we propose a novel feature selection method, called MSMLFS. To be specific, the Inf-FS algorithm is firstly introduced to handle multi-label feature selection for each data source, which considers the label weight in the feature selection. Secondly, the over-sampling mechanism and the inter-source feature fusion method are used to handle the label skewness of multi-label data and the feature selection in multiple sources respectively. Finally, extensive experiments conducted on synthetic and real-world multi-source multi-label data sets demonstrate that the proposed method outperforms several state-of-the-art multi-source or multi-label feature selection methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Embedding VLAD in Transformer for Video Question Answering

引用

Jisuanji Xuebao/Chinese Journal of Computers 2023年第4期46卷 671-689页

作者： Guo, Dan Yao, Shen-Tao Wang, Hui Wang, Meng School of Computer and Information Engineering Hefei University of Technology Hefei230601 China Institute of Artificial Intelligence Hefei Comprehensive National Science Center Hefei230094 China Key Laboratory of Knowledge Engineering with Big Data（Hefei University of Technology） Ministry of Education Hefei230601 China Intelligent Interconnected Systems Laboratory of Anhui Province（Hefei University of Technology） Hefei230601 China

Video question answering（VideoQA）is a typical cross-modal understanding task. Its challenge lies in how to learn appropriate multimodal representation and cross-modal correlation for answer inference. Most existing video question answering methods focus on the latter，e. g.，relationship learning between each video frame or clip and word. In this work， we devote to advanced feature embedding of both video and query. We develop a clustering-based VLAD technique for VideoQA. The novelty of our work is the joint exploitation of temporal aggregation and correlation in multimodality. We propose an end-to-end trainable Transformed VLAD embedding network， named TVLAD-Net. TVLAD-Net constructs a differentiable aggregation network module（i. e.， convolutional Residual-less VLAD Block）to generate compact VLAD descriptors（transforming N frames，clips or words to compact K descriptors while K © 2023 Science Press. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Scene-Adaptive Person Search via Bilateral Modulations

arXiv

引用

arXiv 2024年

作者： Jiang, Yimin Wang, Huibing Peng, Jinjia Fu, Xianping Wang, Yang School of Information Science and Technology Dalian Maritime University Dalian China School of Cyber Security and Computer Hebei University Baoding China Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Hefei University of Technology Hefei China

Person search aims to localize specific a target person from a gallery set of images with various scenes. As the scene of moving pedestrian changes, the captured person image inevitably bring in lots of background noise and foreground noise on the person feature, which are completely unrelated to the person identity, leading to severe performance degeneration. To address this issue, we present a Scene-Adaptive Person Search (SEAS) model by introducing bilateral modulations to simultaneously eliminate scene noise and maintain a consistent person representation to adapt to various scenes. In SEAS, a Background Modulation Network (BMN) is designed to encode the feature extracted from the detected bounding box into a multi-granularity embedding, which reduces the input of background noise from multiple levels with norm-aware. Additionally, to mitigate the effect of foreground noise on the person feature, SEAS introduces a Foreground Modulation Network (FMN) to compute the clutter reduction offset for the person embedding based on the feature map of the scene image. By bilateral modulations on both background and foreground within an end-to-end manner, SEAS obtains consistent feature representations without scene noise. SEAS can achieve state-of-the-art (SOTA) performance on two benchmark datasets, CUHK-SYSU with 97.1. mAP and PRW with 60.5% mAP. The code is available at https://***/whbdmu/SEAS. © 2024, CC0.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

KAN v.s. MLP for Offline Reinforcement Learning

arXiv

引用

arXiv 2024年

作者： Guo, Haihong Li, Fengxin Li, Jiao Liu, Hongyan School of Information Renmin University of China China Institute of Medical Information Medical Library Chinese Academy of Medical Sciences Peking Union Medical College China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education China School of Economics and Management Tsinghua University China

Kolmogorov-Arnold Networks (KAN) is an emerging neural network architecture in machine learning. It has greatly interested the research community about whether KAN can be a promising alternative of the commonly used Multi-Layer Perceptions (MLP). Experiments in various fields demonstrated that KAN-based machine learning can achieve comparable if not better performance than MLP-based methods, but with much smaller parameter scales and are more explainable. In this paper, we explore the incorporation of KAN into the actor and critic networks for offline reinforcement learning (RL). We evaluated the performance, parameter scales, and training efficiency of various KAN and MLP based conservative Q-learning (CQL) on the the classical D4RL benchmark for offline RL. Our study demonstrates that KAN can achieve performance close to the commonly used MLP with significantly fewer parameters. This provides us an option to choose the base networks according to the requirements of the offline RL tasks. © 2024, CC BY.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

IKGN: Intention-aware knowledge Graph Network for POI Recommendation

IKGN: Intention-aware Knowledge Graph Network for POI Recomm...

引用

IEEE International Conference on data Mining (ICDM)

作者： Xiaoyu Zhu Chenyang Bu Bingbing Dong Shengwei Ji Yi He Xindong Wu Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology School of Computer Science and Information Engineering Hefei University of Technology China School of Artificial Intelligence and Big Data Hefei University China Department of Computer Science Old Dominion University USA Research Center for Knowledge Engineering Zhejiang Lab China

Point-of-Interest (POI) recommendation, pivotal for guiding users to their next interested locale, grapples with the persistent challenge of data sparsity. Whereas {1. graphs (KGs) have emerged as a favored tool to mitigate the issue, existing KG-based methods tend to overlook two crucial elements: the intention steering users’ location choices and the high-order topological structure within the KG. In this paper, we craft an Intention-aware {1. Graph (IKG) that harmonizes users’ visit histories, movement trajectories, and location categories to model user intentions. Building upon IKG, our novel Intention-aware {1. Graph Network (IKGN) delves deeper into the POI recommendation by weighing and propagating node embeddings through an attention mechanism, capturing the unique locational intent of each user. A sequential model like GRU is then employed to ensure a comprehensive representation of users’ short- and long-term location preferences. An empirical study on two real-world datasets validates the effectiveness of our proposed IKGN, with it markedly outshining seven benchmark rival models in both Recall and NDCG metrics. The code of IKGN is available at https://***/Jungle1.3456/IKGN.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Dynamic Graph Pattern Matching in Medical knowledge Graphs 4

Dynamic Graph Pattern Matching in Medical Knowledge Graphs

引用

4th International Conference on data Intelligence and Security, ICDIS 2022

作者： Du, Xun Tao, Zhenchao Li, Lei School of Computer Science and Information Engineering Hefei University of Technology Hefei China The First Affiliated Hospital University of Science and Technology of China Hefei China Hefei University of Technology Ministry of Education Key Laboratory of Knowledge Engineering with Big Data Hefei China

ISBN: (数字)9781665459686

ISBN: (纸本)9781665459693

As the study of graph pattern matching (GPM) attracts more and more scholars, the research of GPM in the medical field begins to emerge, from protein structure analysis to breast cancer classification diagnosis, and GPM is more and more widely adopted. However, in medical knowledge graphs (MKG), when the pattern graph dynamically changes, to obtain the matching results of the changed pattern graph, the traditional method has to carry out global matching instead of local matching, which causes a waste of resources and takes a lot of time. To quickly return the matching results of the dynamic pattern graph in MKGs, in this paper, we introduce a caching mechanism to cache the previous matching results and propose a new longest common path matching (M-LCPM) algorithm based on multithreading. The algorithm only performs partial matching on the changed pattern graph and can quickly obtain the matching result. Considering that the M-LCPM algorithm cannot get matching results when the pattern graph changes completely and there may be missing matching subgraphs when the M-LCPM algorithm performs matching, we optimize the M-LCPM algorithm and propose the M-LCPM-Enhance algorithm. Experimental results on two {1. sets show that our dynamic algorithm is more efficient than existing algorithms. © 2022 IEEE.

关键词： graph pattern matching longest common path medical knowledge graphs

来源：评论

学校读者我要写书评

暂无评论

Global and Adaptive Local Label Correlation for Multi-label Learning with Missing Labels

Global and Adaptive Local Label Correlation for Multi-label ...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Qingxia Jiang Peipei Li Yuhong Zhang Xuegang Hu Key Laboratory of Knowledge Engineering with Big Data (the ministry of Education) Hefei University of Technology School of Computer Science and Information Engineering Hefei University of Technology Hefei Anhui Province China Anhui Province Key Laboratory of Industry Safety and Emergency Technology Hefei Anhui Province China

Label missing is a major challenge in multi-label learning. Many existing methods try to use label correlation to recover ground-truth labels, but they only focus on the label correlation within the original label space, however, the label correlation learned in this way is incomplete. Thus, inspired $b$ y the matrix adaptive column correlation, we propose a method to continuously adjust the label correlation matrix while the labels are filled in by adaptive column correlation learning method. Specifically, to reduce the impact of the missing label s on label correlation, the label space is firstly completed through manifold regularization while learning the local label information by adaptive column correlation learning in the complemented label space. Secondly, the global label correlation is utilized by adding a low-rank constraint to the entire label space. Finally, by jointly taking advantage of the global and adaptive local label correlation, our proposed approach achieves superior performance on both synthetic and real-world data sets from diverse domains compared to state-of-the art baselines.

关键词：

来源：评论

学校读者我要写书评

暂无评论

NEW BOOLEAN SATISFIABILITY PROBLEM HEURISTIC STRATEGY: MINIMAL POSITIVE NEGATIVE PRODUCT STRATEGY

arXiv

引用

arXiv 2023年

作者： Qun, Zhao Xintao, Wang Menghui, Yang School of Information Resource Management Renmin University of China Beijing100872 China Institute of Economics Chinese Academy of Social Sciences Beijing100872 China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Beijing100872 China

This study presents a novel heuristic algorithm called the "Minimal Positive Negative Product Strategy" to guide the CDCL algorithm in solving the Boolean satisfiability problem. It provides a mathematical explanation for the superiority of this algorithm over widely used heuristics such as the Dynamic Largest Individual Sum (DLIS) and the Variable State Independent Decaying Sum (VSIDS). Experimental results further confirm the effectiveness of this heuristic strategy in *** Codes 03 Copyright © 2023, The Authors. All rights reserved.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：