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

10th IEEE Smart World Congress, SWC 2024

作者： Wu, Ling Gao, Pingping Guo, Kun Fujian Key Laboratory of Network Computing and Intelligent Information Processing China

ISBN: (纸本)9798331520861

With deep learning's advancement in recent years, heterogeneous graph neural networks (HGNNs) have drawn a lot of interest. They are a group of deep learning models specifically designed for handling heterogeneous graph data, in which nodes and edges are of various types and all nodes are assumed to have either direct or indirect associations. A metaschema, which serves as a thorough and unified blueprint for the heterogeneous graph, elegantly connects varied node types to other heterogeneous nodes via multiple heterogeneous edges with rich sematincs. However, many existing methods that utilize meta-schema to mine heterogeneous information often focus on the different meta-relationships inside the schema, limiting the meta-schema to describing only the local relational semantics. To better utilize meta-schema for efficiently integrating different heterogeneous information, we organize them into a hierarchical structure(i.e., hierarchical meta-schema), with all types of nodes distributed across different layers. The layers are interconnected through heterogeneous relationships. The target type is placed at the final layer and others are arranged hierarchically in the front according to the heterogeneous relationships defined in the meta-schema. During information aggregation, according to the hierarchical meta-schema, the information of each layer is gradually aggregated to the target type on the final layer from far to near via the attention mechanism. Moreover, metapaths regularly begin and end with the same type and help to define complex structures and semantic. Therefore, we also consider the semantic information of neighbors based on metapaths within the proposed hierarchical meta-schema to enhance the complex semantics among nodes of the same-type that may be lacking in the meta-schema. Finally, we proposed a meta-path and meta-schema hierarchical aggregation for heterogeneous graph neural network model, named HGNN-MMHA. And we may allow the meta-schema to not

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

A knowledge-enhanced interest segment division attention network for click-through rate prediction

引用

Neural computing and Applications 2024年第34期36卷 21817-21837页

作者： Liu, Zhanghui Chen, Shijie Chen, Yuzhong Su, Jieyang Zhong, Jiayuan Dong, Chen College of Computer and Data Science Fuzhou University Fujian Province Fuzhou350108 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fujian Province Fuzhou350108 China

Click-through rate (CTR) prediction aims to estimate the probability of a user clicking on a particular item, making it one of the core tasks in various recommendation platforms. In such systems, user behavior data are crucial for capturing user interests, which has garnered significant attention from both academia and industry, leading to the development of various user behavior modeling methods. However, existing models still face unresolved issues, as they fail to capture the complex diversity of user interests at the semantic level, refine user interests effectively, and uncover users’ potential interests. To address these challenges, we propose a novel model called knowledge-enhanced Interest segment division attention network (KISDAN), which can effectively and comprehensively model user interests. Specifically, to leverage the semantic information within user behavior sequences, we employ the structure of a knowledge graph to divide user behavior sequence into multiple interest segments. To provide a comprehensive representation of user interests, we further categorize user interests into strong and weak interests. By leveraging both the knowledge graph and the item co-occurrence graph, we explore users’ potential interests from two perspectives. This methodology allows KISDAN to better understand the diversity of user interests. Finally, we extensively evaluate KISDAN on three benchmark datasets, and the experimental results consistently demonstrate that the KISDAN model outperforms state-of-the-art models across various evaluation metrics, which validates the effectiveness and superiority of KISDAN. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

JDC-GCN: joint diversity and consistency graph convolutional network

引用

Neural computing and Applications 2025年 1-17页

作者： Lin, Renjie Yao, Jie Wang, Shiping Guo, Wenzhong College of Computer and Data Science Fuzhou University Fuzhou350116 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China

In real-world scenarios, multi-view data comprises heterogeneous features, with each feature corresponding to a specific view. The objective of multi-view semi-supervised classification is to enhance classification performance by leveraging the inherent complementary and consistent information present within diverse views. Nevertheless, many existing frameworks primarily focus on assigning suitable weights to different views while neglecting the importance of consistent information. In this paper, a multi-view semi-supervised classification framework called joint diversity and consistency graph convolutional network (JDC-GCN) is proposed. Firstly, the structure of graph convolutional network is introduced to the multi-view semi-supervised classification, capable of propagating the label information over the topological structure of multi-view data. Secondly, the proposed JDC-GCN captures the complementary and consistent information from multiple views through two indispensable sub-modules, Diversity-GCN and Consistency-GCN, respectively. Finally, the attention mechanism is leveraged to dynamically adjust the weights of various views, allowing us to measure the significance of heterogeneous features and the consistent graph without introducing additional parameters. Comprehensive experiments on eight multi-view datasets are conducted to validate the effectiveness of the JDC-GCN algorithm. The results show that the proposed method exhibits superior classification performance compared to other state-of-the-art methods. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2025.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

Multi-View Graph Embedding Learning for Image Co-Segmentation and Co-Localization

引用

IEEE Transactions on Circuits and Systems for Video Technology 2024年第6期34卷 4942-4956页

作者： Huang, Aiping Li, Lijian Zhang, Le Niu, Yuzhen Zhao, Tiesong Lin, Chia-Wen Fuzhou University Fujian Key Laboratory for Intelligent Processing and Wireless Transmission of Media Information College of Physics and Information Engineering Fuzhou350108 China Fuzhou University Fujian Key Laboratory of Network Computing and Intelligent Information Processing College of Computer and Data Science Fuzhou350108 China University of Electronic Science and Technology of China School of Information and Communication Engineering Chengdu611731 China Fuzhou University Fujian Key Laboratory for Intelligent Processing and Wireless Transmission of Media Information College of Physics and Information Engineering The Fujian Science and Technology Innovation Laboratory for Optoelectronic Information Fuzhou350108 China Institute of Communications Engineering National Tsing Hua University Department of Electrical Engineering Hsinchu30013 Taiwan

Image co-segmentation and co-localization exploit inter-image information to identify and extract foreground objects with a batch mode. However, they remain challenging when confronted with large object variations or complex backgrounds. This paper proposes a multi-view graph embedding (MV-Gem) learning scheme which integrates diversity, robustness and discernibility of object features to alleviate this phenomenon. To encourage the diversity, the deep co-information containing both low-layer general representations and high-layer semantic information is generated to form a multi-view feature pool for comprehensive co-object description. To enhance the robustness, a multi-view adaptive weighted learning is formulated to fuse the deep co-information for feature complementation. To ensure the discernibility, the graph embedding and sparse constraint are embedded into the fusion formulation for feature selection. The former aims to inherit important structures from multiple views, and the latter further selects important features to restrain irrelevant backgrounds. With these techniques, MV-Gem gradually recovers all co-objects through optimization iterations. Extensive experimental results on real-world datasets demonstrate that MV-Gem is capable of locating and delineating co-objects in an image group. © 1991-2012 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A numerical magnitude aware multi-channel hierarchical encoding network for math word problem solving

引用

Neural computing and Applications 2025年第3期37卷 1651-1672页

作者： Xu, Junjie Chen, Yuzhong Xiao, Lingsheng Liao, Hongmiao Zhong, Jiayuan Dong, Chen College of Computer and Data Science Fuzhou University Fujian Province Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fujian Province Fuzhou350108 China

Math word problem (MWP) represents a critical research area within reading comprehension, where accurate comprehension of math problem text is crucial for generating math expressions. However, current approaches still grapple with unresolved challenges in grasping the sensitivity of math problem text and delineating distinct roles across various clause types, and enhancing numerical representation. To address these challenges, this paper proposes a Numerical Magnitude Aware Multi-Channel Hierarchical Encoding network (NMA-MHEA) for math expression generation. Firstly, NMA-MHEA implements a multi-channel hierarchical context encoding module to learn context representations at three different channels: intra-clause channel, inter-clause channel, and context-question interaction channel. NMA-MHEA constructs hierarchical constituent-dependency graphs for different levels of sentences and employs a Hierarchical Graph Attention Neural network (HGAT) to learn syntactic and semantic information within these graphs at the intra-clause and inter-clause channels. NMA-MHEA then refines context clauses using question information at the context-question interaction channel. Secondly, NMA-MHEA designs a number encoding module to enhance the relative magnitude information among numerical values and type information of numerical values. Experimental results on two public benchmark datasets demonstrate that NMA-MHEA outperforms other state-of-the-art models. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Open-vocabulary 3D Semantic Understanding via Affinity Neural Radiance Fields 6

Open-vocabulary 3D Semantic Understanding via Affinity Neura...

引用

6th International Conference on Next Generation Data-Driven networks, NGDN 2024

作者： Fan, Yujie Luo, Huan Computer and Data Science Fuzhou University Fuzhou China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China

ISBN: (纸本)9798350388374

Three-dimensional semantic understanding using only several multi-view images can largely reduce the communication burden on the network. In addition, while point clouds are extensively studied for 3D scene understanding, utilization of multi-view image data offers rich visual details and texture information. However, challenges persist in lifting 2D semantic features to 3D space and leveraging language for segmentation. Inspired by recent advancements, this paper proposes a method that combines CLIP features and SAM masks to create a feature field capable of segmenting objects via natural language text across 2D multi-view and 3D Gaussian splatting. It offers a promising function for extracting 3D assets for game engines and the metaverse. Our method involves mask generation from video frames, extracting physical scales via RGB Nerf with masks, and organizing hierarchical information for semantic comprehension. In the training process, affinity features maintain scale properties and guide CLIP feature generation with auto weights blending for semantic robustness. A straightforward 3D splatting CLIP feature approach and canonical text methodology enhance query robustness across 2D multi-view and 3D splatting through relevance score calculation based on text CLIP features for inference. Experimental results demonstrate promising improvements in semantic understanding of 3D scenes. © 2024 IEEE.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

An SDN Traffic Engineering Approach Based on Traffic Unsupervised Contrastive Representation and Reinforcement Learning 6

An SDN Traffic Engineering Approach Based on Traffic Unsuper...

引用

6th International Conference on Next Generation Data-Driven networks, NGDN 2024

作者： Yang, Ruiyu Tang, Qi Guo, Yingya College of Computer and Data Science Fuzhou University Fuzhou China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China

ISBN: (纸本)9798350388374

With the rapid development of Internet technology and the continuous explosive growth of network traffic, Traffic Engineering (TE), as a viable method for optimizing network traffic distribution and improving network performance, attracts widespread attention from both industry and academia. Software Defined networks (SDN), which decouples the data plane and the control plane, realizes a flexible routing and improves the TE performance. Existing TE approaches in SDN mainly utilize Reinforcement Learning (RL) methods to learn the mapping relationship between network traffic and routing policies. However, due to the continuous expansion of network size and dynamic changes in traffic, the enlargement of traffic state space hinders RL from converging to the optimal routing policy, leading to a decline in network performance. To address these issues, this paper presents a TE method based on unsupervised contrastive representation and RL. This method first shrinks the original traffic state space by efficiently extracting traffic features through Contrastive Learning (CL), aiding quick convergence of RL. It then uses RL to directly learn the mapping from traffic features to traffic splitting policies. Finally, through numerous experiments on real network traffic and topology, it demonstrates that the proposed TE method can effectively achieve load balancing of network traffic under complex and volatile dynamic traffic demands, thereby enhancing network performance. © 2024 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Text Guided Road Marking Point Cloud Completion 6

Text Guided Road Marking Point Cloud Completion

引用

6th International Conference on Next Generation Data-Driven networks, NGDN 2024

作者： He, Xu Xu, Qihong Luo, Huan Fuzhou University College of Computer and Data Science Fuzhou China Fuzhou University Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou China

ISBN: (纸本)9798350388374

With the continuous development of intelligent transportation technologies such as autonomous driving and navigation, accurate perception of road markings becomes crucial. However, due to limitations in sensor perspectives and obstacles blocking the view, the scanned point cloud of road markings is often incomplete, potentially leading to erroneous decisions in intelligent transportation systems. Therefore, it becomes imperative to recover complete road markings from these incomplete point clouds. This paper proposes a text-guided road marking completion method, which integrates text information with point cloud data using attention mechanisms. By leveraging text information to guide the network in completing road marking point clouds, the proposed method aims to enhance the perception accuracy and completeness of road markings. Experimental validation on road marking datasets demonstrates the effectiveness and feasibility of the proposed approach. © 2024 IEEE.

关键词： Road and street markings

来源：评论

学校读者我要写书评

暂无评论

Conditional selection with CNN augmented transformer for multimodal affective analysis

引用

CAAI Transactions on Intelligence Technology 2024年第4期9卷 917-931页

作者： Jianwen Wang Shiping Wang Shunxin Xiao Renjie Lin Mianxiong Dong Wenzhong Guo College of Computer and Data Science Fuzhou UniversityFuzhouChina College of Computer and Cyber Security Fujian Normal UniversityFuzhouChina Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou UniversityFuzhouChina Digital Fujian Institute of Big Data Security Technology Fujian Normal UniversityFuzhouChina Department of Sciences and Informatics Muroran Institute of TechnologyMuroranJapan

Attention mechanism has been a successful method for multimodal affective analysis in recent years. Despite the advances, several significant challenges remain in fusing language and its nonverbal context information. One is to generate sparse attention coefficients associated with acoustic and visual modalities, which helps locate critical emotional se-mantics. The other is fusing complementary cross‐modal representation to construct optimal salient feature combinations of multiple modalities. A Conditional Transformer Fusion network is proposed to handle these problems. Firstly, the authors equip the transformer module with CNN layers to enhance the detection of subtle signal patterns in nonverbal sequences. Secondly, sentiment words are utilised as context conditions to guide the computation of cross‐modal attention. As a result, the located nonverbal fea-tures are not only salient but also complementary to sentiment words directly. Experi-mental results show that the authors’ method achieves state‐of‐the‐art performance on several multimodal affective analysis datasets.

关键词： affective computing data fusion information fusion multimodal approaches

来源：评论

学校读者我要写书评

暂无评论

Privacy protection oriented on data stream computing

Privacy protection oriented on data stream computing

引用

2022 International Conference on Computer Application and information Security, ICCAIS 2022

作者： He, Renjie Zheng, Xianghan Wang, Gong School of Computer and Big Data Fuzhou University Fujian Fuzhou China The Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fujian Fuzhou China

ISBN: (纸本)9781510663459

Data security has always been one of the public concerns, and homomorphic encryption technology, as one of the effective means to ensure data security, has always been a hot topic of academic research. Traditional machine learning is trained in a batch environment. In practice, data owners tend to outsource data and model training tasks to third-party clouds with huge computing resources, but data outsourcing carries the risk of privacy leakage. Therefore, in order to prevent this situation, an effective method is to encrypt the data before the outsourcing, and the third-party cloud trains the machine model of the ciphertext data. This method has special requirements for encryption algorithms which should support computation directly on the ciphertext data. This paper presents a novel data flow computing privacy protection framework based on the homomorphic encryption algorithm CKKS and the flow data processing engine Flink, called SDPPF (Streaming Data Privacy Protection on Flink). The proposed framework supports the functions of data stream encryption, decryption and ciphertext computing, and expands the functions of vector point multiplication and array sum operation on the basic simultaneous operation supported by the original CKKS algorithm. This paper also selects a classical machine learning algorithm: KNN algorithm, combined with the homomorphic encryption algorithm CKKS to realize the privacy protection machine learning algorithm. © 2023 SPIE.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：