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

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

来源：评论

学校读者我要写书评

暂无评论

Meta-path and Meta-schema Hierarchical Aggregation for Heterogeneous Graph Neural networks 10

Meta-path and Meta-schema Hierarchical Aggregation for Heter...

引用

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 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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Slew-Driven Layer Assignment for Advanced Non-default-rule Wires 20th

Slew-Driven Layer Assignment for Advanced Non-default-rule W...

引用

Proceedings of the 20th Web information Systems and Applications Conference, WISA 2023

作者： Lu, Ren Zhang, Wei Jiang, Lieqiu Liu, Genggeng College of Computer and Data Science Fuzhou University Fuzhou350116 China Key Laboratory of Network Computing and Intelligent Information Processing Fujian Province Fuzhou350116 China

ISBN: (纸本)9789819962211

With the rapid increase in circuit density in Very Large Scale Integration, the proportion of interconnect delay in circuit timing is also increasing. This makes the importance of layer assignment algorithms increasingly prominent in circuit design. However, most previous layer assignment algorithms prioritize optimizing timing exclusively from the perspective of interconnect delay, thereby disregarding the impact of slew violations on circuits. Therefore, this paper proposes a slew-driven layer assignment algorithm, which considers the timing of different routing layers and introduces non-default-rule wires to design a layer assignment algorithm that can significantly optimize delay, congestion, and slew violations. This algorithm mainly includes three key technologies: 1) Introducing non-default-rule wires technology to optimize timing and adopting a negotiation based approach to ensure that the final routing scheme does not have overflow;2) Proposing a slew prioritization strategy that comprehensively considers slew and interconnect delay during the routing process;3) Proposing a timing critical awareness strategy to further optimize the slew and interconnect delay without worsening the overflow. The experimental results show that the proposed algorithm has significant effects on optimizing delay and reducing slew violations. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Wire

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A Local Regression-Based SLA-Aware Energy-Efficient Virtual Machine Consolidation Algorithm in Data Centers 9

A Local Regression-Based SLA-Aware Energy-Efficient Virtual ...

引用

9th International Conference on Big Data computing and Communications, BigCom 2023

作者： Wu, Xiaodong Wang, Ronghai Lin, Guoxin Quanzhou Normal University School of Mathmatics and Computer Science China Fujian Province University Fujian Provincial Key Laboratory of Data-Intensive Computing Key Laboratory of Intelligent Computing and Information Processing Fujian China Provincial Big Data Research Institute of Intelligent Manufacturing Quanzhou China

ISBN: (纸本)9798350331240

Virtual Machine Consolidation (VMC) is an effective means to improve the resource utilization and reduce energy consumption of data centers. However, the VMC optimization that only considers energy consumption may lead to SLA (Service-Level Agreements) violations and thus fail to guarantee the QoS (Quality of Service) provided. Therefore, it is necessary to consider both energy saving and SLA violations in the process of VMC. In this paper, we propose an energy and SLA-aware VMC algorithm that considers both energy saving and SLA violation optimization in data centers. The proposed algorithm uses the local regression method to predict the utilization of virtual machines, based on which it determines whether the host will be overloaded, so as to make the decision of virtual machine migrations. The proposed VMC algorithm is evaluated with CloudSim toolkit. Simulation results demonstrate that our algorithm has good energy saving performance and can effectively reduce SLA violation in cloud data center. Considering energy consumption and SLA violation, the ESV can be reduced by 7.57% on average and 16.36% at most compared with other algorithms. © 2023 IEEE.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

Accelerating Unsupervised Federated Graph Neural networks via Semi-asynchronous Communication 18th

Accelerating Unsupervised Federated Graph Neural Networks vi...

引用

18th CCF Conference on Computer Supported Cooperative Work and Social computing, ChineseCSCW 2023

作者： Liao, Yuanming Wu, Duanji Lin, Pengyu Guo, Kun College of Computer and Data Science Fuzhou University Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China Key Laboratory of Spatial Data Mining and Information Sharing Ministry of Education Fuzhou350108 China

ISBN: (纸本)9789819996360

Graph neural networks have shown excellent performance in many fields owing to their powerful processing ability of graph data. In recent years, federated graph neural network has become a reasonable solution due to the enactment of privacy-related regulations. However, frequent communication between the coordinator and participants in federated graph neural network results in longer model training time and consumes many communication resources. To address this challenge, in this paper, we propose a novel semi-asynchronous federated graph learning communication protocol that simultaneously alleviates the negative impact of stragglers(slow participants) and accelerate the training process in the unsupervised federated graph neural network scenario. First, the weighted enforced synchronization strategy is intended to preserve the information carried by stragglers while preventing their stale models from harming the global model update. Second, the adaptive local update strategy is developed to make the local model of the participant with poor computing performance as close as possible to the global model. Experiments combine federated learning with graph contrastive learning. The results demonstrate that our proposed protocol outperforms the existing protocols in real-world networks. © 2024, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Internet protocols

来源：评论

学校读者我要写书评

暂无评论

Nonnegative Matrix Factorization Based on Topology-and-Attribute-Matching Degree for Community Detection 18th

Nonnegative Matrix Factorization Based on Topology-and-Attr...

引用

18th CCF Conference on Computer Supported Cooperative Work and Social computing, ChineseCSCW 2023

作者： Zeng, Ruolan Liu, Zhanghui Guo, Kun College of Computer and Data Science Fuzhou University Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China Key Laboratory of Spatial Data Mining and Information Sharing Ministry of Education Fuzhou350108 China

ISBN: (纸本)9789819996360

Community detection is widely used in network analysis, which seeks to divide network nodes into distinct communities based on the topology structure and attribute information of the network. Due to its interpretability, nonnegative matrix factorization becomes an essential method for community detection. However, it decomposes the adjacency matrix and attribute matrix separately, which do not tightly incorporate topology and attributes. And in the problem of division inconsistency based on topology and attributes caused by the mismatch between the topology similarity and attribute similarity of paired nodes, it ignores the difference in the matching degree of each attribute and each node. In this paper, we propose a nonnegative matrix factorization algorithm for community detection (MTACD) based on the matching degree between topology and attribute. First, we employ an attribute embedding mechanism to enhance the node-attribute relationship. Second, we design an attribute matching degree and a node topology-and-attribute matching degree in order to resolve the mismatch between topology and attribute similarity. Experiments on both real-world and synthetic networks demonstrate the effectiveness of our algorithm. © 2024, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

IGED:Towards intelligent DDoS Detection Model Using Improved Generalized Entropy and DNN

引用

Computers, Materials & Continua 2024年第8期80卷 1851-1866页

作者： Yanhua Liu Yuting Han HuiChen Baokang Zhao XiaofengWang Ximeng Liu College of Computer and Data Science Fuzhou UniversityFuzhou350108China Engineering Research Center of Big Data Intelligence Ministry of EducationFuzhou350108China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou UniversityFuzhou350108China College of Computer National University of Defense TechnologyChangsha410073China

As the scale of the networks continually expands,the detection of distributed denial of service(DDoS)attacks has become increasingly *** propose an intelligent detection model named IGED by using improved generalized entropy and deep neural network(DNN).The initial detection is based on improved generalized entropy to filter out as much normal traffic as possible,thereby reducing data *** the fine detection is based on DNN to perform precise DDoS detection on the filtered suspicious traffic,enhancing the neural network’s generalization *** results show that the proposed method can efficiently distinguish normal traffic from DDoS *** with the benchmark methods,our method reaches 99.9%on low-rate DDoS(LDDoS),flooded DDoS and CICDDoS2019 datasets in terms of both accuracy and efficiency in identifying attack flows while reducing the time by 17%,31%and 8%.

关键词： DDoS real-time improved generalized entropy DNN

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：