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

2023 World Wide Web Conference, WWW 2023

作者： Song, Xiran Lian, Jianxun Huang, Hong Luo, Zihan Zhou, Wei Lin, Xue Wu, Mingqi Li, Chaozhuo Xie, Xing Jin, Hai Huazhong University of Science and Technology Wuhan China Microsoft Research Asia Beijing China Microsoft Gaming Redmond United States National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China

ISBN: (纸本)9781450394161

Graph neural networks (GNNs) have seen widespread usage across multiple real-world applications, yet in transductive learning, they still face challenges in accuracy, efficiency, and scalability, due to the extensive number of trainable parameters in the embedding table and the paradigm of stacking neighborhood aggregations. This paper presents a novel model called xGCN for large-scale network embedding, which is a practical solution for link predictions. xGCN addresses these issues by encoding graph-structure data in an extreme convolutional manner, and has the potential to push the performance of network embedding-based link predictions to a new record. Specifically, instead of assigning each node with a directly learnable embedding vector, xGCN regards node embeddings as static features. It uses a propagation operation to smooth node embeddings and relies on a Refinement neural Network (RefNet) to transform the coarse embeddings derived from the unsupervised propagation into new ones that optimize a training objective. The output of RefNet, which are well-refined embeddings, will replace the original node embeddings. This process is repeated iteratively until the model converges to a satisfying status. Experiments on three social network datasets with link prediction tasks show that xGCN not only achieves the best accuracy compared with a series of competitive baselines but also is highly efficient and scalable. © 2023 ACM.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

A Multimodal Knowledge Representation Method for Fake News Detection

A Multimodal Knowledge Representation Method for Fake News D...

引用

Computer, Control and Robotics (ICCCR), International Conference on

作者： Fanhao Zeng Jiaxin Yao Yijie Xu Yanhua Liu Fujian Key Laboratory of Network Computing and Intelligent Information Processing College of Computer and Data Science Fuzhou University Engineering Research Center of Big Data Intelligence Ministry of Education (Fuzhou University) Fuzhou China

ISBN: (数字)9798350373141

ISBN: (纸本)9798350373158

To address the key challenge encountered in fake news detection, i.e., multimodal data is difficult to be effectively semantically represented due to its intrinsic heterogeneity, this paper proposes a multimodal knowledge representation method for fake news detection. First, visual feature extraction is performed for fake news image data, the relevant images are sliced into multiple blocks, and then visual modal features are obtained by linear projection layer mapping. This simplifies the feature extraction process and reduces the computational cost, which helps to improve the fake news recognition performance. Second, to meet the actual fake news detection needs, a long text representation method based on topic words is investigated for the text data in fake news. Finally, the multimodal representation of the same fake news data is optimized by establishing a connection between two different modalities, visual and text, and inputting it into a BiLSTM-Attention based network to achieve the fusion of multimodal features. The experiment selects the same fake news data of EANN model and uses four classical classification methods to verify the effect of knowledge representation and compare it with the fusion model ViLT which is not optimized for long text. The experiment proves that the accuracy rate of fake news detection using the multimodal representation proposed in this paper is improved by 7.4% compared to the EANN model, and by 9.3% compared to the ViLT representation.

关键词： Digital control Visualization Accuracy Knowledge representation Machine learning Feature extraction data models

来源：评论

学校读者我要写书评

暂无评论

Multilingual Knowledge Graph Completion via Multimodal Decouple and Relation-based Ensemble Inference 29

Multilingual Knowledge Graph Completion via Multimodal Decou...

引用

29th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2023

作者： Liu, Xiaojing Jiang, Xuesong Yi, Fengge Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China

ISBN: (纸本)9798350330717

The objective of Multimodal Knowledge Graph Completion (MKGC) is to forecast absent entities within a knowledge graph by leveraging additional textual and visual modalities. Existing studies commonly utilize a singular relationship embedding to depict all modalities within an entity pair, thus connecting several relationships derived from diverse modalities. However, this coupling may introduce interference from conflicting information between modalities, as the relationships between modalities for a given entity pair can be contradictory. Moreover, existing Ensemble Inference methods fail to dynamically adjust modal weights based on their differences and importance, despite the varying contributions of different modalities. In this paper, we propose the Multimodal Decouple and Relation-based Ensemble inference (MDRE) model. For each modality, we construct corresponding relationship embeddings and build separate triple representations to avoid interferences among modalities. During the training phase, we employ confidence-constrained training with temperature scaling to alleviate conflicting information in textual and visual modalities. For inference, we utilize the Relation-based Ensemble Inference method to adjust modal weights at the relationship level, thus achieving improved prediction results. Experimental results on two datasets demonstrate that MDRE outperforms existing single-modal and multimodal knowledge graph completion methods in terms of performance. © 2023 IEEE.

关键词： knowledge graph knowledge graph completion multimodal fusion

来源：评论

学校读者我要写书评

暂无评论

research on the relationship between new business talents' ability and its thinking mode in the era of big data

Research on the relationship between new business talents' a...

引用

2020 International Conference on data Processing Algorithms and Models, ICDPAM 2020

作者： Qu, Ying An, Ruoyu Hebei University of Science and Technology School of Economics and Management Data Science and Intelligent Computing Research Center Shijiazhuang City Hebei Province China

In the era of big data, the development of "new business"really needs talents who use new ways of thinking to solve economic management ***, it is very important to comprehensively analyze the relationship between the ability of new business talents and the way of thinking in the era of big *** combing the literature, we have collected and sorted out the thinking mode in the era of big data and the ability requirements of new business for talents. This article selects 9 ability elements, including 4 ways of thinking and 5 talent abilities, to present the structural model of the relationship between the ability of new business talents and their thinking mode in the era of big data. Analyzing the relationship between talent abilities and thinking styles from a new perspective of big data, supplementing and expanding the existing research on new business talent's abilities, is conducive to the update of training programs, and has certain significance for integrating teaching resources and optimizing curriculum structure. © Published under licence by IOP Publishing Ltd.

关键词： Big data

来源：评论

学校读者我要写书评

暂无评论

Adversarial Learning data Augmentation for Graph Contrastive Learning in Recommendation 28th

Adversarial Learning Data Augmentation for Graph Contrastiv...

引用

28th International Conference on database Systems for Advanced Applications, DASFAA 2023

作者： Huang, Junjie Cao, Qi Xie, Ruobing Zhang, Shaoliang Xia, Feng Shen, Huawei Cheng, Xueqi Data Intelligence System Research Center Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China WeChat Tencent Beijing China CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China

ISBN: (纸本)9783031306716

Recently, Graph Neural Networks (GNNs) achieve remarkable success in Recommendation. To reduce the influence of data sparsity, Graph Contrastive Learning (GCL) is adopted in GNN-based CF methods for enhancing performance. Most GCL methods consist of data augmentation and contrastive loss (e.g., InfoNCE). GCL methods construct the contrastive pairs by hand-crafted graph augmentations and maximize the agreement between different views of the same node compared to that of other nodes, which is known as the InfoMax principle. However, improper data augmentation will hinder the performance of GCL. InfoMin principle, that the good set of views shares minimal information and gives guidelines to design better data augmentation. In this paper, we first propose a new data augmentation (i.e., edge-operating including edge-adding and edge-dropping). Then, guided by InfoMin principle, we propose a novel theoretical guiding contrastive learning framework, named Learnable data Augmentation for Graph Contrastive Learning (LDA-GCL). Our methods include data augmentation learning and graph contrastive learning, which follow the InfoMin and InfoMax principles, respectively. In implementation, our methods optimize the adversarial loss function to learn data augmentation and effective representations of users and items. Extensive experiments on four public benchmark datasets demonstrate the effectiveness of LDA-GCL. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Applying Hybrid Clustering in Pulsar Candidate Sifting with Multi-modality for FAST Survey

引用

research in Astronomy and Astrophysics 2024年第3期24卷 283-296页

作者： Zi-Yi You Yun-Rong Pan Zhi Ma Li Zhang Shuo Xiao Dan-Dan Zhang Shi-Jun Dang Ru-Shuang Zhao Pei Wang Ai-Jun Dong Jia-Tao Jiang Ji-Bing Leng Wei-An Li Si-Yao Li School of Physics and Electronic Science Guizhou Normal UniversityGuiyang 550025China Guizhou Provincial Key Laboratory of Radio Astronomy and Data Processing Guizhou Normal UniversityGuiyang 550025China College of Big Data and Information Engineering Guizhou UniversityGuiyang 550025China CAS Key Laboratory of FAST National Astronomical ObservatoriesChinese Academy of SciencesBeijing 100101China Key Laboratory of Information and Computing Guizhou Province Guizhou Normal UniversityGuiyang 550001China School of Big data and Computer Science Guizhou Normal UniversityGuiyang 550025China Guizhou Software Engineering Research Center Guiyang 550000China

Pulsar search is always the basis of pulsar navigation,gravitational wave detection and other research ***,the volume of pulsar candidates collected by the Five-hundred-meter Aperture Spherical radio Telescope(FAST)shows an explosive growth rate that has brought challenges for its pulsar candidate filtering ***,the multi-view heterogeneous data and class imbalance between true pulsars and non-pulsar candidates have negative effects on traditional single-modal supervised classification *** this study,a multi-modal and semi-supervised learning based on a pulsar candidate sifting algorithm is presented,which adopts a hybrid ensemble clustering scheme of density-based and partition-based methods combined with a feature-level fusion strategy for input data and a data partition strategy for *** on both High Time Resolution Universe SurveyⅡ(HTRU2)and actual FAST observation data demonstrate that the proposed algorithm could excellently identify pulsars:On HTRU2,the precision and recall rates of its parallel mode reach0.981 and 0.988 *** FAST data,those of its parallel mode reach 0.891 and 0.961,meanwhile,the running time also significantly decreases with the increment of parallel nodes within ***,we can conclude that our algorithm could be a feasible idea for large scale pulsar candidate sifting for FAST drift scan observation.

关键词： methods data analysis-surveys-methods numerical

来源：评论

学校读者我要写书评

暂无评论

Fourier single-pixel spectral imaging via local low-rank tensor nuclear norm and deep tensor priors

引用

Optics Letters 2025年第4期50卷 1281-1284页

作者： Tang, Zixin Hu, Yexun Duo, Chen Yang, Guowei Jiang, Taixiang Guo, Daqing School of Computing and Artificial Intelligence Southwestern University of Finance and Economics Sichuan Province Chengdu China Kash Institute of Electronics and Information Industry Kash China Engineering Research Center of Intelligent Finance Ministry of Education Southwestern University of Finance and Economics China Chongqing University of Education School of Artificial Intelligence China School of Life Science and Technology University of Electronic Science and Technology of China Sichuan Province Chengdu China Chongqing University Industrial Technology Research Institute Department of Science and Technology Development China

The imaging quality of single-pixel spectral imaging (SSI) methods is poor at a low sampling ratio (SR). To tackle this problem, a new Fourier single-pixel spectral imaging (FSSI) technique is proposed. Firstly, we introduce the low-rank tensor nuclear norm (TNN) to characterize the correlation between spectral images. Compared with the conventional method, TNN reconstructs image details better but brings image artifacts simultaneously. Therefore, local low-rank TNN (LTNN) constraint is proposed to ameliorate global ones and to reduce the distortion caused by TNN and low SR. Secondly, to make full use of the spectral information, the proposed constraint is used as the coarse prior, and the deep tensor prior (DTP) is introduced as the fine one to construct the joint priors. Different from the single prior, the joint method can make the two priors benefit and improve each other and further enhance the imaging quality. Finally, an efficient and high-quality SSI technique is achieved by deducing the closed-form solution algorithm. Experimental results show that our method significantly improves the quality of FSSI as much as 7–10 dB when compared to 3DTV at the SR of 5%. © 2025 Optica Publishing Group. All rights, including for text and data mining (TDM), Artificial Intelligence (AI) training, and similar technologies, are reserved.

关键词： Tensors

来源：评论

学校读者我要写书评

暂无评论

MeHyper: Accelerating Hypergraph Neural Networks by Exploring Implicit dataflows 31

MeHyper: Accelerating Hypergraph Neural Networks by Explorin...

引用

31st IEEE International Symposium on High Performance Computer Architecture, HPCA 2025

作者： Zhao, Wenju Yao, Pengcheng Chen, Dan Zheng, Long Liao, Xiaofei Wang, Qinggang Ma, Shaobo Li, Yu Liu, Haifeng Xiao, Wenjing Sun, Yufei Zhu, Bing Jin, Hai Xue, Jingling Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Wuhan430074 China National University of Singapore School of Computing 119077 Singapore Guangxi University School of Computer Electronics and Information NanNing530004 China University of New South Wales School of Computer Science and Engineering SydneyNSW2052 Australia

ISBN: (纸本)9798331506476

Hypergraph Neural Networks (HGNNs) are increasingly utilized to analyze complex inter-entity relationships. Traditional HGNN systems, based on a hyperedge-centric dataflow model, independently process aggregation tasks for hyperedges and vertices, leading to significant computational redundancy. This redundancy arises from recalculating shared information across different tasks. For the first time, we identify and harness implicit dataflows (i.e., dependencies) within HGNNs, introducing the microedge concept to effectively capture and reuse intricate shared information among aggregation tasks, thereby minimizing redundant computations. We have developed a new microedge-centric dataflow model that processes shared information as fine-grained microedge aggregation tasks. This dataflow model is supported by the Read-Process-Activate-Generate execution model, which aims to optimize parallelism among these tasks. Furthermore, our newly developed MeHyper, a microedge-centric HGNN accelerator, incorporates a decoupled pipeline for improved computational parallelism and a hierarchical feature management strategy to reduce off-chip memory accesses for large volumes of intermediate feature vectors generated. Our evaluation demonstrates that MeHyper substantially outperforms the leading CPUbased system PyG-CPU and the GPU-based system HyperGef, delivering performance improvements of 1,032.23 × and 10.51 ×, and energy efficiencies of 1,169.03 × and 9.96 ×, respectively. © 2025 IEEE.

关键词： Redundancy

来源：评论

学校读者我要写书评

暂无评论

Control of Fractional Diffusion Problems via Dynamic Programming Equations

引用

Journal of Peridynamics and Nonlocal Modeling 2024年第2期6卷 270-293页

作者： Alla, Alessandro D’Elia, Marta Glusa, Christian Oliveira, Hugo Dipartimento di Scienze Molecolari e Nanosistemi Università Ca’ Foscari Venezia Venice Italy Data Science and Computing Sandia National Laboratories Livermore 94550 CA United States Center for Computing Research Sandia National Laboratories Albuquerque 87111 NM United States Departamento de Matematica PUC-Rio Rio de Janeiro Brazil

We explore the approximation of feedback control of integro-differential equations containing a fractional Laplacian term. To obtain feedback control for the state variable of this nonlocal equation, we use the Hamilton–Jacobi–Bellman equation. It is well known that this approach suffers from the curse of dimensionality, and to mitigate this problem we couple semi-Lagrangian schemes for the discretization of the dynamic programming principle with the use of Shepard approximation. This coupling enables approximation of high-dimensional problems. Numerical convergence toward the solution of the continuous problem is provided together with linear and nonlinear examples. The robustness of the method with respect to disturbances of the system is illustrated by comparisons with an open-loop control approach. © 2023, The Author(s), under exclusive licence to Springer Nature Switzerland AG.

关键词： Feedback control Fractional models Nonlocal models Optimal control

来源：评论

学校读者我要写书评

暂无评论

PSRAKA: Physically Secure and Robust Authenticated Key Agreement for VANETs

引用

IEEE Transactions on Vehicular Technology 2024年第5期74卷 7953-7968页

作者： Liu, Gao Li, Hao Liang, Yangfan Le, Junqing Wang, Ning Mu, Nankun Liu, Zhiquan Liu, Yining Xiang, Tao Chongqing University College of Computer Science Chongqing400044 China Jiaxing University Provincial Key Laboratory of Multimodal Perceiving and Intelligent Systems The Institute of Information Network and Artificial Intelligence The Key Laboratory of Medical Electronics and Digital Health of Zhejiang Province The Engineering Research Center of Intelligent Human Health Situation Awareness of Zhejiang Province Jiaxing314001 China Jinan University College of Cyber Security Guangzhou510632 China Wenzhou University of Technology School of Data Science and Artificial Intelligence Wenzhou325000 China

Authenticated key agreement (AKA) allows vehicles and road side units (RSUs) to mutually authenticate and establish shared session keys, which can be implemented to secure vehicular ad-hoc networks (VANETs). However, most of existing relative schemes fail to support physical security and tracing robustness, and lack a mechanism to balance pseudonym unlinkability and system efficiency. In this paper, we propose PSRAKA, a physically secure and robust authenticated key agreement scheme for VANETs, which enables anonymous authentication on vehicles through chameleon hash functions. In particular, physical security is guaranteed by integrating physical unclonable functions and fuzzy extractors to resist against physical capture attacks. Our scheme is the first to support robustness by allowing the vehicle and central authority to jointly sign or commit to the vehicle's real identity, chameleon hash value and public key for binding to ensure public verification and prevent malicious accusations during tracing. Meanwhile, it is the first to model the relationship of vehicle pseudonym unlinkability and system efficiency for balance by formulating the unlinkability based on the frequency of pseudonym updates. PSRAKA achieves anonymity, conditional privacy, robustness, key escrow freeness and physical security, and resists against most known attacks. Comprehensive performance analysis and evaluation suggest the potential usability of PSRAKA. © 1967-2012 IEEE.

关键词： Vehicular ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：