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

Mandari: Multi-Modal Temporal knowledge Graph-aware Sub-graph Embedding for Next-POI Recommendation

学校读者我要写书评

暂无评论

Mandari: Multi-Modal Temporal Knowledge Graph-aware Sub-grap...

IEEE International Conference on Multimedia and Expo (ICME)

作者： Xiaoqian Liu Xiuyun Li Yuan Cao Fan Zhang Xiongnan Jin Jinpeng Chen School of Computer Science (National Pilot Software Engineering School) Beijing University of Posts and Telecommunications Beijing China Key Laboratory of Trustworthy Distributed Computing and Service (BUPT) Ministry of Education Beijing China The Technology Innovation Center of Cultural Tourism Big Data of Hebei Province Chengde China Hebei Normal University for Nationalities Chengde China Knowledge Discovery and Data Mining Research Center Zhejiang Lab Hangzhou China

Next-POI recommendation aims to explore from user check-in sequence to predict the next possible location to be visited. Existing methods are often difficult to model the implicit association of multi-modal data with user choices. Moreover, traditional methods struggle to fully explore the variation of user preferences at variable time intervals. To tackle these limitations, we propose a Multi-Modal Temporal knowledge Graph-aware Sub-graph Embedding approach (Mandari). We first construct a novel Multi-Modal Temporal knowledge Graph. Based on the proposed knowledge graph, we integrate multi-modal information and leverage the graph attention network to calculate sub-graph prediction probability. Next, we implement a temporal knowledge mining method to model the segmentation and periodicity of user check-in and obtain temporal prediction probability. Finally, we fuse temporal prediction probability with the previous sub-graph prediction probability to obtain the final result. Extensive experiments demonstrate that our approach outperforms existing state-of-the-art methods.

关键词：

Graph Convolutional Neural Network with Inter-layer Cascade Based on Attention Mechanism 7

学校读者我要写书评

暂无评论

Graph Convolutional Neural Network with Inter-layer Cascade ...

7th IEEE International Conference on Cloud Computing and Intelligence Systems, CCIS 2021

作者： Wei, Lu Liu, Yiting Feng, Kaiyuan Li, Jianzhao Sheng, Kai Wu, Yue Xidian University Key Laboratory of Big Data and Intelligent Vision School of Computer Science and Technology Xi'an710071 China Xidian University Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education School of Electronic Engineering Xi'an710071 China Academy of Advanced Interdisciplinary Research Xidian University Xi'an710071 China

ISBN: (纸本)9781665441490

In recent years, graph data in the non-Euclidean space has been widely used, and the methods and techniques for learning graph data in many deep learning fields have been continuously developed, such as the Graph neural network (GNN). The structural characteristics of graph data, the aggregation mode and representation mode of node information, and the node neighbor information are the core issues of GNN. However, most of the existing graph convolutional neural networks have an excessive smoothing problem, which limits the learning ability of the model. Aiming at the over-smoothing problem of the current algorithm, this paper enhances the learning of graph data by improving the expression ability of local information and global features. This paper constructs a cascade structure between graph convolutional layers. This kind of network structure realizes the dense connection of convolutional layers, makes the local feature information is effectively used, and further enhances the graph representation ability. Introduce self-attention and TopK into the Readout module, selectively aggregate and express feature information, and use graph-level information more efficiently. Graph classification is a downstream task to verify the performance of the proposed model. Experimental results prove that this densely structured graph convolutional network can effectively aggregate local node information and global graph-level information. © 2021 IEEE.

关键词： Graph neural networks

SDGFormer: An Efficient Convolution Network Structurally Similar to Transformer

学校读者我要写书评

暂无评论

SDGFormer: An Efficient Convolution Network Structurally Sim...

IEEE International Conference on Multimedia and Expo (ICME)

作者： Chaohao Wen Xun Gong School of Computing and Artificial Intelligence SWJTU Chengdu China Engineering Research Center of Sustainable Urban Intelligent Transportation Ministry of Education China National Engineering Laboratory of Integrated Transportation Big Data Application Technology SWJTU Chengdu China Manufacturing Industry Chains Collaboration and Information Support Technology Key Laboratory of Sichuan Province SWJTU Chengdu China

Deep Neural Networks (DNN) have achieved extraordinary success in many visual recognition tasks. Visual Transformer (ViT), which is derived from Natural Language Processing (NLP), has achieved state-of-the-art (SOTA) results on many tasks due to its capability of capturing long-range dependencies in visual data. However, Existing ViT models are challenging to deploy on devices due to their massive computational consumption, huge memory overhead, and reliance on large datasets. In this work, we address these issues by replacing some computationally expensive and memory-intensive modules in ViT with standard Convolutional Neural Network (CNN) modules. Firstly, we propose an efficient Self-Attention module called SDG-Attention (SDGA) with linear space and time complexity, and an economical FeedForward Network (FFN) composed of group convolution and shuffle channel (SFFN). Then, we develop a lightweight CNN model with SDGA and SFFN, SDGFormer, which embraces several priors of ViT and is LayerNorm-Free. We evaluate SDGFormer on ImageNet-1K and Mini-ImageNet, and the SDGFormer-S achieves a comparable top-1 accuracy of 77.6% on ImageNet-1K with 9.1M parameters and 1.6 GFlops regimes. Moreover, our SDGFormer-T achieves SOTA performance on Mini-ImageNet with 83.3% accuracy, demonstrating good generalization on small datasets without extra data.

关键词：

Continual Learning for Smart City: A Survey

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Yang, Li Luo, Zhipeng Zhang, Shiming Teng, Fei Li, Tianrui School of Computing and Artificial Intelligence Southwest Jiaotong University Chengdu611756 China Engineering Research Center of Sustainable Urban Intelligent Transportation Ministry of Education National Engineering Laboratory of Integrated Transportation Big Data Application Technology Southwest Jiaotong University China Manufacturing Industry Chains Collaboration and Information Support Technology Key Laboratory of Sichuan Province Southwest Jiaotong University Sichuan Chengdu611756 China

With the digitization of modern cities, large data volumes and powerful computational resources facilitate the rapid update of intelligent models deployed in smart cities. Continual learning (CL) is a novel machine learning paradigm that constantly updates models to adapt to changing environments, where the learning tasks, data, and distributions can vary over time. Our survey provides a comprehensive review of continual learning methods that are widely used in smart city development. The content consists of three parts: 1) Methodology-wise. We categorize a large number of basic CL methods and advanced CL frameworks in combination with other learning paradigms including graph learning, spatial-temporal learning, multi-modal learning, and federated learning. 2) Application-wise. We present numerous CL applications covering transportation, environment, public health, safety, networks, and associated datasets related to urban computing. 3) Challenges. We discuss current problems and challenges and envision several promising research directions. We believe this survey can help relevant researchers quickly familiarize themselves with the current state of continual learning research used in smart city development and direct them to future research trends. Copyright © 2024, The Authors. All rights reserved.

关键词： Smart city

Document-level Relation Extraction with Relation Correlations

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Han, Ridong Peng, Tao Wang, Benyou Liu, Lu Wan, Xiang College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education China College of Software Jilin University China Shenzhen Research Institute of Big Data The Chinese University of Hong Kong Shenzhen China School of Data Science The Chinese University of Hong Kong Shenzhen China

Document-level relation extraction faces two overlooked challenges: long-tail problem and multi-label problem. Previous work focuses mainly on obtaining better contextual representations for entity pairs, hardly address the above challenges. In this paper, we analyze the co-occurrence correlation of relations, and introduce it into DocRE task for the first time. We argue that the correlations can not only transfer knowledge between data-rich relations and data-scarce ones to assist in the training of tailed relations, but also reflect semantic distance guiding the classifier to identify semantically close relations for multi-label entity pairs. Specifically, we use relation embedding as a medium, and propose two co-occurrence prediction sub-tasks from both coarse- and fine-grained perspectives to capture relation correlations. Finally, the learned correlation-aware embeddings are used to guide the extraction of relational facts. Substantial experiments on two popular DocRE datasets are conducted, and our method achieves superior results compared to baselines. Insightful analysis also demonstrates the potential of relation correlations to address the above challenges. Copyright © 2022, The Authors. All rights reserved.

关键词： Extraction

Computing optimal partition problems via Lagrange multiplier approach

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Cheng, Qing Guo, Jing Wang, Dong Department of Mathematics Tongji University Shanghai200092 China Key Laboratory of Intelligent Computing and Applications Tongji University Ministry of Education China School of Science and Engineering The Chinese University of Hong Kong Guangdong Shenzhen518172 China Shenzhen International Center for Industrial and Applied Mathematics Shenzhen Research Institute of Big Data Guangdong518172 China

In this paper, we consider numerical approximations for the optimal partition problem using Lagrange multipliers. By rewriting it into constrained gradient flows, three and four steps numerical schemes based on the Lagrange multiplier approach [16, 17] are proposed to solve the constrained gradient system. Numerical schemes proposed for the constrained gradient flows satisfy the nice properties of orthogonality-preserving, norm-preserving, positivity-preserving and energy dissipating. The proposed schemes are very efficient in which only linear Poisson equations are solved at each time step. Extensive numerical results in 2D and 3D for optimal partition problem are presented to validate the effectiveness and accuracy of the proposed numerical schemes. Copyright © 2024, The Authors. All rights reserved.

关键词： Lagrange multipliers

Multi-view Point Cloud Registration based on Evolutionary Multitasking with Bi-Channel knowledge Sharing Mechanism

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Wu, Yue Liu, Yibo Gong, Maoguo Gong, Peiran Li, Hao Tang, Zedong Miao, Qiguang Ma, Wenping The School of Computer Science and Technology Key Laboratory of Big Data and Intelligent Vision Xidian University Xi’an710071 China The School of Electronic Engineering Key Laboratory of Intelligent Perception and Image Understanding Ministry of Education Xidian University Xi’an710071 China The School of Artificial Intelligence Key Laboratory of Intelligent Perception and Image Understanding Ministry of Education Xidian University Xi’an710071 China

Multi-view point cloud registration is fundamental in 3D reconstruction. Since there are close connections between point clouds captured from different viewpoints, registration performance can be enhanced if these connections be harnessed properly. Therefore, this paper models the registration problem as multi-task optimization, and proposes a novel bi-channel knowledge sharing mechanism for effective and efficient problem solving. The modeling of multi-view point cloud registration as multi-task optimization are twofold. By simultaneously considering the local accuracy of two point clouds as well as the global consistency posed by all the point clouds involved, a fitness function with an adaptive threshold is derived. Also a framework of the co-evolutionary search process is defined for the concurrent optimization of multiple fitness functions belonging to related tasks. To enhance solution quality and convergence speed, the proposed bi-channel knowledge sharing mechanism plays its role. The intra-task knowledge sharing introduces aiding tasks that are much simpler to solve, and useful information is shared across aiding tasks and the original tasks, accelerating the search process. The inter-task knowledge sharing explores commonalities buried among the original tasks, aiming to prevent tasks from getting stuck to local optima. Comprehensive experiments conducted on model object as well as scene point clouds show the efficacy of the proposed method. Copyright © 2022, The Authors. All rights reserved.

关键词： Multitasking

Intra-Person Camera Adversarial for Intra-Camera Supervised Person Re-Identification

学校读者我要写书评

暂无评论

Intra-Person Camera Adversarial for Intra-Camera Supervised ...

International Conference on Automatic Face and Gesture Recognition

作者： Ruochen Tang Xun Gong School of Computing and Artificial Intelligence Southwest Jiaotong University Chengdu China Engineering Research Center of Sustainable Urban Intelligent Transportation Ministry of Education Chengdu China National Engineering Laboratory of Integrated Transportation Big Data Application Technology Southwest Jiaotong University Chengdu China Manufacturing Industry Chains Collaboration and Information Support Technology Key Laboratory of Sichuan Province Southwest Jiaotong University Chengdu China

ISBN: (数字)9798350394948

ISBN: (纸本)9798350394955

Re-identification (ReID) of individuals across different cameras is a challenging task due to the high-quality large-scale datasets required for the model. Intra-camera supervised (ICS) person re-identification has been proposed to address the high cost of annotating large-scale datasets, but reducing the gap between camera domains remains a major challenge. Current approaches use intra- and inter-camera learning with contrastive learning performed separately in both phases. However, the effect of features from the same person under different cameras on the model during inter-camera learning, and the fine-grained characteristic where the same person can be classified into multiple classes based on the camera labels, still require further research. To address this issue, we propose a Camera-Based Contrastive Learning (CBCL) method that moves features away from their respective cameras and closer to other cameras to reduce domain gaps. We also introduce an Intra-Person Camera Adversarial (IPCA) loss that effectively utilizes fine-grained characteristics of person re-identification and improve IPCA by introducing camera labels to obtain IPCA_2 which achieves better model recognition performance than IPCA alone. Extensive experiments on multiple datasets demonstrate that our method outperforms existing methods and is comparable to fully-supervised methods.

关键词： Costs Scalability Face recognition Contrastive learning Gesture recognition Cameras Robustness

A Review of Multimodal Explainable Artificial Intelligence: Past, Present and Future

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Sun, Shilin An, Wenbin Tian, Feng Nan, Fang Liu, Qidong Liu, Jun Shah, Nazaraf Chen, Ping School of Computer Science and Technology Xi’an Jiaotong University Xi’an710049 China Ministry of Education Key Laboratory of Intelligent Networks and Network Security Xi’an Jiaotong University Xi’an710049 China Faculty of Electronic and Information Engineering Xi’an Jiaotong University Xi’an710049 China Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong University Xi’an710049 China Institute for Future Transport and Cities Coventry University Priory Street CoventryCV1 5FB United Kingdom Department of Engineering University of Massachusetts Boston BostonMA02125 United States

Artificial intelligence (AI) has rapidly developed through advancements in computational power and the growth of massive datasets. However, this progress has also heightened challenges in interpreting the "black-box" nature of AI models. To address these concerns, eXplainable AI (XAI) has emerged with a focus on transparency and interpretability to enhance human understanding and trust in AI decision-making processes. In the context of multimodal data fusion and complex reasoning scenarios, the proposal of Multimodal eXplainable AI (MXAI) integrates multiple modalities for prediction and explanation tasks. Meanwhile, the advent of Large Language Models (LLMs) has led to remarkable breakthroughs in natural language processing, yet their complexity has further exacerbated the issue of MXAI. To gain key insights into the development of MXAI methods and provide crucial guidance for building more transparent, fair, and trustworthy AI systems, we review the MXAI methods from a historical perspective and categorize them across four eras: traditional machine learning, deep learning, discriminative foundation models, and generative LLMs. We also review evaluation metrics and datasets used in MXAI research, concluding with a discussion of future challenges and directions. A project related to this review has been created at https://***/ShilinSun/mxai_review. Copyright © 2024, The Authors. All rights reserved.

关键词： data fusion