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

arXiv 2021年

作者： Huang, Hong Song, Yu Wu, Yao Shi, Jia Xie, Xia Jin, Hai National Engineering Research Center for Big Data Technology Service Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

Link prediction and node classification are two important downstream tasks of network representation learning. Existing methods have achieved acceptable results but they perform these two tasks separately, which requires a lot of duplication of work and ignores the correlations between tasks. Besides, conventional models suffer from the identical treatment of information of multiple views, thus they fail to learn robust representation for downstream tasks. To this end, we tackle link prediction and node classification problems simultaneously via multi-task multi-view learning in this paper. We first explain the feasibility and advantages of multi-task multi-view learning for these two tasks. Then we propose a novel model named as MT-MVGCN to perform link prediction and node classification tasks simultaneously. More specifically, we design a multi-view graph convolutional network to extract abundant information of multiple views in a network, which is shared by different tasks. We further apply two attention mechanisms: view attention mechanism and task attention mechanism to make views and tasks adjust the view fusion process. Moreover, view reconstruction can be introduced as an auxiliary task to boost the performance of the proposed model. Experiments on real-world network datasets demonstrate that our model is efficient yet effective, and outperforms advanced baselines in these two tasks. © 2021, CC BY.

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

Connecting latent relationships over heterogeneous attributed network for recommendation

arXiv

引用

arXiv 2021年

作者： Duan, Ziheng Wang, Yueyang Ye, Weihao Feng, Zixuan Fan, Qilin Li, Xiuhua School of Big Data and Software Engineering Chongqing University Chongqing401331 China Department of Control Science and Technology Zhejiang University Hangzhou310027 China

Recently, deep neural network models for graph-structured data have been demonstrating to be influential in recommendation systems. Graph Neural Network (GNN), which can generate high-quality embeddings by capturing graph-structured information, is convenient for the recommendation. However, most existing GNN models mainly focus on the homogeneous graph. They cannot characterize heterogeneous and complex data in the recommendation system. Meanwhile, it is challenging to develop effective methods to mine the heterogeneity and latent correlations in the graph. In this paper, we adopt Heterogeneous Attributed Network (HAN), which involves different node types as well as rich node attributes, to model data in the recommendation system. Furthermore, we propose a novel graph neural network-based model to deal with HAN for Recommendation, called HANRec. In particular, we design a component connecting potential neighbors to explore the influence between neighbors and provide two different strategies with the attention mechanism to aggregate neighbors’ information. The experimental results on two real-world datasets prove that HANRec outperforms other state-of-the-arts methods1 Copyright © 2021, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

CRU: A Novel Neural Architecture for Improving the Predictive Performance of Time-Series data

arXiv

引用

arXiv 2022年

作者： Sim, Sunghyun Kim, Dohee Bae, Hyerim TheIndustrial Management & Big Data Engineeri ng Major Division of Industrial Convergence System Engineering Dong eui University 176 Eomgwang No Gaya Dong 24 Busanjin Gu Busan47340 Korea Republic of Majoring in Industrial Data Science & E ngineering Department of Industrial Engineering Pusan National Univ ersity Pusan National University 30-Jan-jeon Dong Geum-Jeong Gu Busan6 09-753 Korea Republic of

The time-series forecasting (TSF) problem is a traditional problem in the field of artificial intelligence. Models such as Recurrent Neural Network (RNN), Long Short Term Memory (LSTM), and GRU (Gate Recurrent Units) have contributed to improving the predictive accuracy of TSF. Furthermore, model structures have been proposed to combine time-series decomposition methods, such as seasonal-trend decomposition using Loess (STL) to ensure improved predictive accuracy. However, because this approach is learned in an independent model for each component, it cannot learn the relationships between time-series components. In this study, we propose a new neural architecture called a correlation recurrent unit (CRU) that can perform time series decomposition within a neural cell and learn correlations (autocorrelation and correlation) between each decomposition component. The proposed neural architecture was evaluated through comparative experiments with previous studies using five univariate time-series datasets and four multivariate time-series data. The results showed that long- and short-term predictive performance was improved by more than 10%. The experimental results show that the proposed CRU is an excellent method for TSF problems compared to other neural architectures. © 2022, CC BY.

关键词： Model structures

来源：评论

学校读者我要写书评

暂无评论

Decentralized and Lightweight Cross-Chain Transaction Scheme Based on Proxy Re-signature

Decentralized and Lightweight Cross-Chain Transaction Scheme...

引用

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Huiying Zou Jia Duan Xi Liu Wei Ren Tao Li Xianghan Zheng Kim-Kwang Raymond Choo School of Computer Science China University of Geosciences Wuhan China The Third Surveying and Mapping Institute of Hunan Province Hunan Engineering Research Center of Geographic Information Security and Application Hunan China Key Laboratory of Data Protection and Intelligent Management Sichuan University Ministry of Education China State Key Laboratory of Geo-Information Engineering and Key Laboratory of Surveying and Mapping Science and Geospatial Information Technology of MNR CASM Beijing China College of Computer and Big Data Fuzhou University School of Information and Intelligent Engineering Sanya College China Department of Information Systems and Cyber Security University of Texas at San Antonio San Antonio USA

ISBN: (数字)9798331506209

ISBN: (纸本)9798331506216

With the widespread application of digital assets and the rapid development of blockchain technology, achieving secure and efficient transactions between different blockchain networks has become an urgent challenge. Existing cross-chain methods impose limitations, e.g., hash lock technology exhibits low scalability, side-chain technology is overly complex, and notary schemes pose centralization risks. In order to address these issues, we propose a cross-chain transaction solution based on proxy re-signature technology. To tackle the centralization concerns, we employ proxy re-signature technology to decentralize the authority of notaries among transaction participants, minimizing the potential for centralization at a low cost. We further present an extended scheme that can guarantee more requirements such as higher transaction amount and shorter transaction time. Furthermore, we analyze and compare the signature technologies used in the proposed solution and provide a systematic proof of our approach’s security.

关键词： Privacy Systematics Costs Scalability Blockchains Security

来源：评论

学校读者我要写书评

暂无评论

Text-augmented long-term relation dependency learning for knowledge graph representation

High-Confidence Computing

引用

High-Confidence Computing 2025年

作者： Quntao Zhu Mengfan Li Yuanjun Gao Yao Wan Xuanhua Shi Hai Jin 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 Wuhan 430074 China

Knowledge graph (KG) representation learning aims to map entities and relations into a low-dimensional representation space, showing significant potential in many tasks. Existing approaches follow two categories: (1) Graph-based approaches encode KG elements into vectors using structural score functions. (2) Text-based approaches embed text descriptions of entities and relations via pre-trained language models (PLMs), further fine-tuned with triples. We argue that graph-based approaches struggle with sparse data, while text-based approaches face challenges with complex relations. To address these limitations, we propose a unified Text-Augmented Attention-based Recurrent Network, bridging the gap between graph and natural language. Specifically, we employ a graph attention network based on local influence weights to model local structural information and utilize a PLM based prompt learning to learn textual information, enhanced by a mask-reconstruction strategy based on global influence weights and textual contrastive learning for improved robustness and generalizability. Besides, to effectively model multi-hop relations, we propose a novel semantic-depth guided path extraction algorithm and integrate cross-attention layers into recurrent neural networks to facilitate learning the long-term relation dependency and offer an adaptive attention mechanism for varied-length information. Extensive experiments demonstrate that our model exhibits superiority over existing models across KG completion and question-answering tasks.

关键词： Knowledge graph representation Graph attention network Pre-trained language model Attention-based recurrent network Masked autoencoder Contrastive learning

来源：评论

学校读者我要写书评

暂无评论

A Service Composition Evolution Method that Combines Deep Clustering and a Service Requirement Context Model

SSRN

引用

SSRN 2022年

作者： Xiao, Gang Lu, Jiawei Zheng, Jiahong Chen, Zhenbo Wang, Qibing Li, Duanni School of Computer Science and Technology Zhejiang University of Technology Hangzhou China College of Mechanical and Electrical Engineering China Jiliang University Hangzhou China Key Laboratory of Intelligent Manufacturing Quality Big Data Tracing and Analysis of Zhejiang Province China Jiliang University Hangzhou China

Service composition can quickly build new value-added composite services by combining existing Web services. However, with the complex and changeable Internet environment, composite services need to effectively understand and manage requirements in a flexible and adaptive manner, and also be able to quickly and proactively provide high-quality services through a series of dynamic evolution models. In response to these challenges, in this study, we propose a service composition evolution method that can adaptively select the appropriate service to improve user satisfaction and service quality. First, we introduce a deep clustering method based on the topic model and auto-encoder, which considers the function description documents and parameter information of the services to reduce the search space of the candidate services. Furthermore, we describe a requirement-oriented context-sensitive task model to integrate functional and non-functional user requirements by connecting the context of Web subtasks. Then, we present a dynamic service matching method with QoS threshold judgement to filter and rank the services. We applied the proposed evolution method to the datasets of real-world Web services and measured the performance using standard measurement metrics. The prototype implementation and results of simulation experiments verified the effectiveness of each part of our method. © 2022, The Authors. All rights reserved.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Zero-Knowledge Proof-based Practical Federated Learning on Blockchain

arXiv

引用

arXiv 2023年

作者： Xing, Zhibo Zhang, Zijian Li, Meng Liu, Jiamou Zhu, Liehuang Russello, Giovanni Asghar, Muhammad Rizwan The School of Computer Science The University of Auckland Auckland New Zealand The School of Cyberspace Science and Technology Beijing Institute of Technology Beijing100081 China Southeast Institute of Information Technology Beijing Institute of Technology Fujian351100 China Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education School of Computer Science and Information Engineering Hefei University of Technology Anhui Hefei230601 China Anhui Province Key Laboratory of Industry Safety and Emergency Technology Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology China The Department of Computer Science University of Surrey The School of Computer Science The University of Auckland Auckland New Zealand

Since the concern of privacy leakage extremely discourages user participation in sharing data, federated learning has gradually become a promising technique for both academia and industry for achieving collaborative learning without leaking information about the local data. Unfortunately, most federated learning solutions cannot efficiently verify the execution of each participant's local machine learning model and protect the privacy of user data, simultaneously. In this article, we first propose a Zero-Knowledge Proof-based Federated Learning (ZKP-FL) scheme on blockchain. It leverages zero-knowledge proof for both the computation of local data and the aggregation of local model parameters, aiming to verify the computation process without requiring the plaintext of the local data. We further propose a Practical ZKP-FL (PZKP-FL) scheme to support fraction and non-linear operations. Specifically, we explore a Fraction-Integer mapping function, and use Taylor expansion to efficiently handle non-linear operations while maintaining the accuracy of the federated learning model. We also analyze the security of PZKP-FL. Performance analysis demonstrates that the whole running time of the PZKP-FL scheme is approximately less than one minute in parallel execution. Copyright © 2023, The Authors. All rights reserved.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

FPPNet: Fast Privacy-Preserving Neural Network via Three-Party Arithmetic Secret Sharing 15th

FPPNet: Fast Privacy-Preserving Neural Network via Three-Pa...

引用

15th EAI International Conference on Mobile Multimedia Communications, MobiMedia 2022

作者： Bi, Renwan Xiong, Jinbo Li, Qi Liu, Ximeng Tian, Youliang Fujian Provincial Key Laboratory of Network Security and Cryptology College of Computer and Cyber Security Fujian Normal University Fuzhou350117 China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing210023 China Key Laboratory of Cryptography of Zhejiang Province Hangzhou Normal University Hangzhou311121 China Key Laboratory of Information Security of Network Systems College of Mathematics and Computer Science Fuzhou University Fuzhou350108 China State Key Laboratory of Public Big Data College of Computer Science and Technology Guizhou University Guiyang550025 China

ISBN: (纸本)9783031239014

Jointing multi-source data for model training can improve the accuracy of neural network. To solve the raising privacy concerns caused by data sharing, data are generally encrypted and outsourced to a group of cloud servers for computing and processing. In this client-cloud architecture, we propose FPPNet, a fast and privacy-preserving neural network for secure inference on sensitive data. FPPNet is deployed in three cloud servers, who collaboratively execute privacy computing via three-party arithmetic secret sharing. We develop the secure conversion method between additive shares and multiplicative shares, and propose three secure protocols to calculate non-linear functions, such as comparison, exponent and division that are superior to prior three-party works. Some secure modules for running convolutional, ReLU, max-pooling and Sigmoid layers are designed to implement FPPNet. We theoretically analyze the security and complexity of the proposed protocols. With MNIST dataset and two types of neural networks, experimental results validate that our FPPNet is faster than the related works, and the accuracy is the same as that of plaintext neural network. © 2022, ICST Institute for Computer sciences, Social Informatics and Telecommunications Engineering.

关键词： Sensitive data

来源：评论

学校读者我要写书评

暂无评论

When to update your model: constrained model-based reinforcement learning 22

When to update your model: constrained model-based reinforce...

引用

Proceedings of the 36th International Conference on Neural Information Processing Systems

作者： Tianying Ji Yu Luo Fuchun Sun Mingxuan Jing Fengxiang He Wenbing Huang Department of Computer Science and Technology Tsinghua University Science & Technology on Integrated Information System Laboratory Institute of Software Chinese Academy of Sciences JD Explore Academy *** Inc Gaoling School of Artificial Intelligence Renmin University of China and Beijing Key Laboratory of Big Data Management and Analysis Methods Beijing China

ISBN: (纸本)9781713871088

Designing and analyzing model-based RL (MBRL) algorithms with guaranteed monotonic improvement has been challenging, mainly due to the interdependence between policy optimization and model learning. Existing discrepancy bounds generally ignore the impacts of model shifts, and their corresponding algorithms are prone to degrade performance by drastic model updating. In this work, we first propose a novel and general theoretical scheme for a non-decreasing performance guarantee of MBRL. Our follow-up derived bounds reveal the relationship between model shifts and performance improvement. These discoveries encourage us to formulate a constrained lower-bound optimization problem to permit the monotonicity of MBRL. A further example demonstrates that learning models from a dynamically-varying number of explorations benefit the eventual returns. Motivated by these analyses, we design a simple but effective algorithm CMLO (Constrained Model-shift Lower-bound Optimization), by introducing an event-triggered mechanism that flexibly determines when to update the model. Experiments show that CMLO surpasses other state-of-the-art methods and produces a boost when various policy optimization methods are employed.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Remote Sensing Scene Classification Based on Improved GhostNet

Remote Sensing Scene Classification Based on Improved GhostN...

引用

2020 International Conference on Computer science and Communication technology, ICCSCT 2020

作者： Wei, Biyun Shen, Xiaole Yuan, Yule College of Big Data and Internet Shenzhen Technology University Shenzhen China College of Applied Technology Shenzhen University Shenzhen China College of Computer Science and Software Engineering Shenzhen University Shenzhen China

Nowadays, the design of convolutional neural network (CNN) models is getting deeper and wider. When traditional CNN is used to process limited data of remote sensing images, it will lead to overfitting. We will use lightweight and efficient models to classify remote sensing images. In order to improve the classification accuracy and reduce the intermediate parameters, we improved GhostNet and proposed a smaller CNN named Improved GhostNet. Meanwhile, we use image enhancement methods to enlarge the datasets and dropout, it will reduce the amount of parameters. We experimented on three datasets, such as AID, UC Merced, NWPU-RESISC45. Then, we used MobileNetV3-Small and GhostNet to compare with our CNN model. The classification accuracy of improved GhostNet achieves more than 91%, and the accuracy on the AID is improved by 2.05% compared to the original GhostNet. These results demonstrate the effectiveness and efficiency of improved GhostNet. © 2020 Published under licence by IOP Publishing Ltd.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：