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

IEEE International Conference on data Mining (ICDM)

作者： Yupeng Hou Wayne Xin Zhao Yaliang Li Ji-Rong Wen Gaoling School of Artificial Intelligence Renmin University of China Beijing Key Laboratory of Big Data Management and Analysis Methods Engineering Research Center of Next-Generation Intelligent Search and Recommendation Ministry of Education Alibaba Group

To develop effective and efficient graph similarity learning (GSL) models, a series of data-driven neural algorithms have been proposed in recent years. Although GSL models are frequently deployed in privacy-sensitive scenarios, the user privacy protection of neural GSL models has not drawn much attention. To comprehensively understand the privacy protection issues, we first introduce the concept of attackable representation to systematically characterize the privacy attacks that each model can face. Inspired by the qualitative results, we propose a novel P rivacy-P reserving neural G raph M atching network model, named PPGM, for graph similarity learning. To prevent reconstruction attacks, the proposed model does not communicate node-level representations between devices. Instead, we learn multi-perspective graph representations based on learnable context vectors. To alleviate the attacks to graph properties, the obfuscated features that contain information from both graphs are communicated. In this way, the private properties of each graph can be difficult to infer. Based on the node-graph matching techniques while calculating the obfuscated features, PPGM can also be effective in similarity measuring. To quantitatively evaluate the privacy-preserving ability of neural GSL models, we further propose an evaluation protocol via training supervised black-box attack models. Extensive experiments on widely-used benchmarks show the effectiveness and strong privacy-protection ability of the proposed model PPGM. The code is available at: https://***/RUCAIBox/PPGM.

关键词： Training Performance evaluation Knowledge engineering Privacy Protocols Neural networks Closed box

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A Deep Concept-aware Model for predicting and explaining restaurant future status

A Deep Concept-aware Model for predicting and explaining res...

引用

IEEE International Conference on Web Services (ICWS)

作者： Hao Liao Xiaojie Zhang Xin Li Mingyang Zhou Alexandre Vidmer Rui Mao Guangdong Province Key Laboratory of Popular High Performance Computers College of Computer Science and Software Engineering Shenzhen University Guangdong Province Engineering Center of China-made High Performance Data Computing System Shenzhen City Key Laboratory of Service Computing and Application Shenzhen China Institute of Big Data Intelligent Management and Decision Shenzhen University Shenzhen China

ISBN: (数字)9781728187860

ISBN: (纸本)9781728187877

Nowadays, with the development of web services, the survival of online service has captured public attention significantly. Future prediction of business is crucial to the shopkeepers. Predicting how the business will develop and explaining what key factors are leading to it are two most important tasks. Existing literatures usually tackle only one of these two tasks, ignoring that they are two closely related tasks and complement each other. In this paper, we propose a review-based neural model, named Deep Concept-aware Model (DCA), to predict restaurants' future status and provide explainable sentences simultaneously in an end2end framework. Specifically, we use co-attention to select concepts and implement prediction and explanation tasks through Factorization Machine and Gated Recurrent Unit, respectively. We conduct extensive experiments on three Chinese cities' datasets. The proposed joint model outperforms the state-of-the-art baseline methods for both prediction (average 40.96% improvement in AUC) and explanation (average 9.72% improvement in BLEU and 86.05% in Precision metric of ROUGE).

关键词： Web services Urban areas Predictive models Prediction algorithms data models Task analysis Business

来源：评论

学校读者我要写书评

暂无评论

Interval quantile correlations with applications to testing high-dimensional quantile effects

引用

Journal of Econometrics 2024年 249卷

作者： Zhang, Yaowu Zhou, Yeqing Zhu, Liping Research Institute for Interdisciplinary Sciences School of Information Management and Engineering Shanghai University of Finance and Economics China School of Mathematical Sciences School of Economics and Management and Key Laboratory of Intelligent Computing and Applications Tongji University China Center for Applied Statistics and Institute of Statistics and Big Data Renmin University of China China

In this article, we propose interval quantile correlation and interval quantile partial correlation to measure the association between two random variables over an interval of quantile levels. We construct efficient estimators for the proposed correlations, and establish their asymptotic properties under the null and alternative hypotheses. We further use the interval quantile partial correlation to test for the significance of covariate effects in high-dimensional quantile regression when a subset of covariates are controlled. We calculate marginal interval quantile partial correlations for each covariate, then aggregate them to construct a sum-type test statistic. The null distribution of our proposed test statistic is asymptotically standard normal. We use extensive simulations and an application to illustrate that our proposed test, which pools information across an interval of quantile levels to enhance power performances, is very effective in detecting quantile effects. © 2024 Elsevier B.V.

关键词： Interval quantile Partial correlation Quantile regression

来源：评论

学校读者我要写书评

暂无评论

Multi-Agent Reinforcement Learning for Traffic Signal Control through Universal Communication Method

arXiv

引用

arXiv 2022年

作者： Jiang, Qize Qin, Minhao Shi, Shengmin Sun, Weiwei Zheng, Baihua School of Computer Science Fudan University China Shanghai Key Laboratory of Data Science Fudan University China Shanghai Institute of Intelligent Electronics & Systems China School of Computing and Information Systems Singapore Management University Singapore

How to coordinate the communication among intersections effectively in real complex traffic scenarios with multi-intersection is challenging. Existing approaches only enable the communication in a heuristic manner without considering the content/importance of information to be shared. In this paper, we propose a universal communication form UniComm between intersections. UniComm embeds massive observations collected at one agent into crucial predictions of their impact on its neighbors, which improves the communication efficiency and is universal across existing methods. We also propose a concise network UniLight to make full use of communications enabled by UniComm. Experimental results on real datasets demonstrate that UniComm universally improves the performance of existing state-of-the-art methods, and UniLight significantly outperforms existing methods on a wide range of traffic situations. Source codes are available at https://***/zyr17/UniLight. Copyright © 2022, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Query-oriented data Augmentation for Session Search

arXiv

引用

arXiv 2024年

作者： Chen, Haonan Dou, Zhicheng Zhu, Yutao Wen, Ji-Rong Gaoling School of Artificial Intelligence Renmin University of China Engineering Research Center of Next-Generation Intelligent Search and Recommendation Ministry of Education Beijing Key Laboratory of Big Data Management and Analysis Methods Beijing100872 China

Modeling contextual information in a search session has drawn more and more attention when understanding complex user intents. Recent methods are all data-driven, i.e., they train different models on large-scale search log data to identify the relevance between search contexts and candidate documents. The common training paradigm is to pair the search context with different candidate documents and train the model to rank the clicked documents higher than the unclicked ones. However, this paradigm neglects the symmetric nature of the relevance between the session context and document, i.e., the clicked documents can also be paired with different search contexts when training. In this work, we propose query-oriented data augmentation to enrich search logs and empower the modeling. We generate supplemental training pairs by altering the most important part of a search context, i.e., the current query, and train our model to rank the generated sequence along with the original sequence. This approach enables models to learn that the relevance of a document may vary as the session context changes, leading to a better understanding of users’ search patterns. We develop several strategies to alter the current query, resulting in new training data with varying degrees of difficulty. Through experimentation on two extensive public search logs, we have successfully demonstrated the effectiveness of our model. © 2024, CC BY.

关键词： Search engines

来源：评论

学校读者我要写书评

暂无评论

EulerNet: Adaptive Feature Interaction Learning via Euler’s Formula for CTR Prediction

arXiv

引用

arXiv 2023年

作者： Tian, Zhen Bai, Ting Zhao, Wayne Xin Wen, Ji-Rong Cao, Zhao Gaoling School of Artificial Intelligence Renmin University of China Beijing China Beijing University of Posts and Telecommunications Beijing China Beijing Key Laboratory of Big Data Management and Analysis Methods China Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia China Poisson Lab Huawei Beijing China

Learning effective high-order feature interactions is very crucial in the CTR prediction task. However, it is very time-consuming to calculate high-order feature interactions with massive features in online e-commerce platforms. Most existing methods manually design a maximal order and further filter out the useless interactions from them. Although they reduce the high computational costs caused by the exponential growth of high-order feature combinations, they still suffer from the degradation of model capability due to the suboptimal learning of the restricted feature orders. The solution to maintain the model capability and meanwhile keep it efficient is a technical challenge, which has not been adequately addressed. To address this issue, we propose an adaptive feature interaction learning model, named as EulerNet, in which the feature interactions are learned in a complex vector space by conducting space mapping according to Euler’s formula. EulerNet converts the exponential powers of feature interactions into simple linear combinations of the modulus and phase of the complex features, making it possible to adaptively learn the high-order feature interactions in an efficient way. Furthermore, EulerNet incorporates the implicit and explicit feature interactions into a unified architecture, which achieves the mutual enhancement and largely boosts the model capabilities. Such a network can be fully learned from data, with no need of pre-designed form or order for feature interactions. Extensive experiments conducted on three public datasets have demonstrated the effectiveness and efficiency of our approach. Our code is available at: https://***/RUCAIBox/EulerNet. © 2023, CC BY.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Rethink Video Retrieval Representation for Video Captioning

SSRN

引用

SSRN 2024年

作者： Tian, Mingkai Li, Guorong Qi, Yuankai Wang, Shuhui Sheng, Quan Z. Huang, Qingming School of Computer Science and Technology Key Lab of Big Data Mining and Knowledge Management University of Chinese Academy of Sciences China School of Computing Macquarie University Australia Key Laboratory of Intelligent Information Processing Institute of Computer Technology Chinese Academy of Sciences China

Video captioning, a challenging task targeting the automatic generation of accurate and comprehensive descriptions based on video content, has witnessed substantial success recently driven by bridging video representations and textual semantics. Inspired by the nature of the video retrieval task, which learns visual features strongly related to text queries, we propose to take advantage of visual representation learning from the video retrieval framework to tackle video captioning tasks. However, a simple direct application of video retrieval models performs poorly due to the weak ability to capture sufficient video details and temporal information required for video captioning. To increase the attention on details, we propose a learnable token shift module, which flexibly captures subtle movements in local regions across the temporal sequence. Furthermore, we devise a Refineformer, which learns to integrate local video tokens strongly related to desired captions via a cross-attention mechanism. Extensive experiments on MSVD, MSR-VTT and VATEX demonstrate the favorable performance of our method. © 2024, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A Stepwise Path Selection Scheme Based on Multiple QoS Parameters Evaluation in SDN 17th

A Stepwise Path Selection Scheme Based on Multiple QoS Param...

引用

17th EAI International Conference on Collaborative Computing: Networking, Applications, and Worksharing, CollaborateCom 2021

作者： Liu, Lin Zhou, Jian-Tao Xing, Hai-Feng Guo, Xiao-Yong College of Computer Science Ecological Big Data Engineering Research Center of the Ministry of Education Cloud Computing and Service Software Engineering Laboratory of Inner Mongolia Autonomous Region National and Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian Social Computing and Data Processing Key Laboratory of Inner Mongolia Autonomous Region Big Data Analysis Technology Engineering Research Center of Inner Mongolia Autonomous Region Inner Mongolia University Inner Mongolia Hohhot China College of Computer Science and Technology Inner Mongolia Normal University Inner Mongolia Hohhot China College of Computer Information and Management Inner Mongolia University of Finance and Economics Inner Mongolia Hohhot China

ISBN: (纸本)9783030926342

Nowadays, the best-effort service can not guarantee the quality of service (QoS) for all kinds of services. QoS routing is an important method to guarantee QoS requirements. It involves path selection for flows based on the current network status and the performance criteria of the service requirements. However, it is difficult for proposed solutions to obtain all the available paths owing to not fully considering all the QoS parameters of paths. In this paper, we propose SWQoS, a novel, universal, and stepwise QoS guarantee scheme based on multiple QoS parameter evaluation for selecting the available paths including preferred paths, satisfied paths and reluctant paths in SDN. The experiments show that SWQoS can select all the available paths that meet the performance criteria of the service requirements and have better QoS parameter performance compared with other path selection methods. © 2021, ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Optimal Sizing of Ev Charging Stations Considering Charging Scheduling and Renewable Energy

SSRN

引用

SSRN 2022年

作者： Zhou, Kaile Hu, Dingding Yang, Shanlin School of Management Hefei University of Technology Hefei230009 China Key Laboratory of Process Optimization and Intelligent Decision-making of Ministry of Education Hefei University of Technology Hefei230009 China National Engineering Laboratory for Big Data Distribution and Exchange Technologies Shanghai China

The construction of electric vehicle (EV) charging stations is critical for the widespread use of EVs. Appropriate design of EV charging stations should fulfill charging requests while considering various economic issues. In this regard, we present an optimization model to address the sizing problem of EV charging stations with integration of renewable energy resources, energy storage system and multi-types of chargers. The proposed model aims at reducing the investment cost and improving the profitability of EV charging stations. In order to accurately estimate EV charging demand, the characteristics of EV charging behaviors are derived based on real-world charging data. Furthermore, a charging scheduling strategy that responds to time-of-use (TOU) price and charging demand levels is proposed to improve the utilization efficiency of chargers. Results show that the design of EV charging stations with integrated consideration of these components and charging scheduling strategy can achieve optimal economic efficiency. © 2022, The Authors. All rights reserved.

关键词： Renewable energy resources

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：