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

Graph Neural Networks with Learnable and Optimal Polynomial Bases

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Guo, Yuhe Wei, Zhewei Gaoling School of Articial Intelligence Renmin University of China China Peng Cheng Laboratory China Beijing Key Laboratory of Big Data Management and Analysis Methods China MOE Key Lab of Data Engineering and Knowledge Engineering China

Polynomial filters, a kind of Graph Neural Networks, typically use a predetermined polynomial basis and learn the coefficients from the training data. It has been observed that the effectiveness of the model is highly dependent on the property of the polynomial basis. Consequently, two natural and fundamental questions arise: Can we learn a suitable polynomial basis from the training data? Can we determine the optimal polynomial basis for a given graph and node features? In this paper, we propose two spectral GNN models that provide positive answers to the questions posed above. First, inspired by Favard’s Theorem, we propose the FavardGNN model, which learns a polynomial basis from the space of all possible orthonormal bases. Second, we examine the supposedly unsolvable definition of optimal polynomial basis from Wang & Zhang (2022) and propose a simple model, OptBasisGNN, which computes the optimal basis for a given graph structure and graph signal. Extensive experiments are conducted to demonstrate the effectiveness of our proposed models. Our code is available at https://***/yuziGuo/FarOptBasis. © 2023, CC BY.

关键词： Graph neural networks

Meta-path Enhanced knowledge Graph Convolutional Network for Recommender Systems 12

学校读者我要写书评

暂无评论

Meta-path Enhanced Knowledge Graph Convolutional Network for...

12th IEEE International Conference on Big knowledge, ICBK 2021

作者： Wang, Ru Wu, Meng Ji, Shengwei Hefei University of Technology Key Laboratory of Knowledge Engineering With Big Data Ministry of Education School of Computer Science and Information Engineering Hefei China

ISBN: (纸本)9781665438582

knowledge Graph (KG) is a directed heterogeneous information network that contains a large number of entities and relations, which is widely used as effective side information in rec-ommender systems. Moreover, in recommender systems, the Graph Convolutional Network (GCN) model is introduced to mine the relatedness between entities in a KG because of its efficiency in extracting spatial features on topological graphs. The knowledge Graph Convolutional Network (KGCN) model up-dates the embedding of a currently positioned entity by aggregating the information of adjacent entities selected randomly. Never-theless, it has two limititations: 1) the information of neighbors se-lected randomly cannot accurately represent the current entity in the KG;2) the model is hard to converge as graph features (i.e. The spatial relation features and semantic information features of en-tities in the KG) grow. To solve these limitations, in this paper, a meta-path (i.e., a sequence of artificially constructed relationships) is introduced into the selection of neighbors in the KGCN model to enhance the representation of each entity. Furthermore, two construction methods of the meta-path - constructing a meta-path based on the same relation (KGCN-SP) and the characteris-tics of KG (KGCN-MP) -are proposed. The experiments based on three real-world datasets demonstrate that the neighbor selection based on the meta-path is able to collect more accurate infor-mation from a KG and improve the recommendation performance effectively. © 2021 IEEE.

关键词： knowledge graph

FOSS: A Self-Learned Doctor for Query Optimizer

学校读者我要写书评

暂无评论

FOSS: A Self-Learned Doctor for Query Optimizer

International Conference on data engineering

作者： Kai Zhong Luming Sun Tao Ji Cuiping Li Hong Chen Renmin University of China China MOE Key Laboratory of Data Engineering and Knowledge Engineering China Shanghai Yunxi Technology Co. Ltd. Engineering Research Center of Database and Business Intelligence MOE China

ISBN: (数字)9798350317152

ISBN: (纸本)9798350317169

Various works have utilized deep learning to address the query optimization problem in database system. They either learn to construct plans from scratch in a bottom-up manner or steer the plan generation behavior of traditional optimizer using hints. While these methods have achieved some success, they face challenges in either low training efficiency or limited plan search space. To address these challenges, we introduce FOSS, a novel framework for query optimization based on deep reinforcement learning. FOSS initiates optimization from the original plan generated by a traditional optimizer and incrementally refines suboptimal nodes of the plan through a sequence of actions. Additionally, we devise an asymmetric advantage model to evaluate the advantage between two plans. We integrate it with a traditional optimizer to form a simulated environment. Leveraging this simulated environment, FOSS can bootstrap itself to rapidly generate a large amount of high-quality simulated experiences. FOSS then learns from these experiences to improve its optimization capability. We evaluate the performance of FOSS on Join Order Benchmark, TPC-DS, and Stack Overflow. The experimental results demonstrate that FOSS outperforms the state-of-the-art methods in terms of latency performance. Compared to PostgreSQL, FOSS achieves speedup ranging from 1.15x to 8.33x in total latency across different benchmarks.

关键词： Training Query processing Medical services Benchmark testing Deep reinforcement learning data engineering Distance measurement

Large Language Model for Table Processing: A Survey

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Lu, Weizheng Zhang, Jing Fan, Ju Fu, Zihao Chen, Yueguo Du, Xiaoyong School of Information Renmin University of China Beijing100872 China Key Laboratory of Data Engineering and Knowledge Engineering Beijing100872 China WPS Office Kingsoft Co. Zhuhai519080 China

Tables, typically two-dimensional and structured to store large amounts of data, are essential in daily activities like database queries, spreadsheet manipulations, web table question answering, and image table information extraction. Automating these table-centric tasks with Large Language Models (LLMs) or Visual Language Models (VLMs) offers significant public benefits, garnering interest from academia and industry. This survey provides a comprehensive overview of table-related tasks, examining both user scenarios and technical aspects. It covers traditional tasks like table question answering as well as emerging fields such as spreadsheet manipulation and table data analysis. We summarize the training techniques for LLMs and VLMs tailored for table processing. Additionally, we discuss prompt engineering, particularly the use of LLM-powered agents, for various table-related tasks. Finally, we highlight several challenges, including diverse user input when serving and slow thinking using chain-of-thought. © 2024, CC BY.

关键词： Question answering

Impact of Consumer Perceived Characteristics on Fruit Sales: Evidence from Community Group-buying 11

学校读者我要写书评

暂无评论

Impact of Consumer Perceived Characteristics on Fruit Sales:...

11th International Conference on Information Technology and Quantitative Management, ITQM 2024

作者： Jiang, Hailiang Tian, Xin Tao, Ye Wang, Lulu Research Center on Fictitious Economy and Data Science Chinese Academy of Sciences Beijing100190 China School of Economics and Management University of Chinese Academy of Sciences Beijing100190 China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing100190 China Beijing HAOLINJU CVS Co. Ltd Beijing100088 China Shanghai HEADING Information Engineering Co. Ltd. Shanghai201112 China

There is a growing trend among retailers to sell fruits through their community group-buying (CGB) channels. Based on real operational data, we employ econometric models to empirically analyze how consumer perception characteristics in CGB affect fruit sales. Our findings suggest that incorporating subjective experiences into product descriptions can positively impact fruit sales for retailers;fresh produce stores outperform regular stores in fruit sales of CGB;Dark-colored fruits sell more than light-colored fruits in the CGB channel. Our study offers valuable insights for retailers selling fruits through CGB channels. © 2024 The Authors.

关键词： community group-buying dark-colored fruits fresh produce stores subjectivity

Identifying Scientific and Technical“Unicorns”

学校读者我要写书评

暂无评论

Journal of data and Information Science 2021年第2期6卷 96-115页

作者： Lucy L.Xu Miao Qi Fred Y.Ye Jiangsu Key Laboratory of Data Engineering and Knowledge Service School of Information ManagementNanjing UniversityNanjing 210023China University Library Nantong UniversityNantong 226019China

Purpose:Using the metaphor of"unicorn,"we identify the scientific papers and technical patents characterized by the informetric feature of very high citations in the first ten years after publishing,which may provide a new pattern to understand very high impact works in science and ***/methodology/approach:When we set CT as the total citations of papers or patents in the first ten years after publication,with CT≥5,000 for scientific"unicorn"and CT≥500 for technical"unicorn,"we have an absolute standard for identifying scientific and technical"unicorn"***:We identify 165 scientific"unicorns"in 14,301,875 WoS papers and 224 technical"unicorns"in 13,728,950 DII patents during 2001–*** 50%of"unicorns"belong to biomedicine,in which selected cases are individually *** rare"unicorns"increase following linear model,the fitting data show 95%confidence with the RMSE of scientific"unicorn"is 0.2127 while the RMSE of technical"unicorn"is *** limitations:A"unicorn"is a pure quantitative consideration without concerning its quality,and"potential unicorns"as CT≤5,000 for papers and CT≤500 for patents are left in future *** implications:Scientific and technical"unicorns"provide a new pattern to understand high-impact works in science and ***"unicorn"pattern supplies a concise approach to identify very high-impact scientific papers and technical ***/value:The"unicorn"pattern supplies a concise approach to identify very high impact scientific papers and technical patents.

关键词： Unicorn Scientific paper Technical patent Citation analysis Patent analysis

PathReasoner: Modeling Reasoning Path with Equivalent Extension for Logical Question Answering

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Xu, Fangzhi Lin, Qika Zhao, Tianzhe Han, Jiawei Liu, Jun School of Computer Science and Technology Xi’an Jiaotong University China Ministry of Education Key Laboratory of Intelligent Networks and Network Security China Shaanxi Province Key Laboratory of Big Data Knowledge Engineering China

Logical reasoning task has attracted great interest since it was proposed. Faced with such a task, current competitive models, even large language models (e.g., ChatGPT and PaLM 2), still perform badly. Previous promising LMs struggle in logical consistency modeling and logical structure perception. To this end, we model the logical reasoning task by transforming each logical sample into reasoning paths and propose an architecture PathReasoner. It addresses the task from the views of both data and model. To expand the diversity of the logical samples, we propose an atom extension strategy supported by equivalent logical formulas, to form new reasoning paths. From the model perspective, we design a stack of transformer-style blocks. In particular, we propose a path-attention module to joint model in-atom and cross-atom relations with the high-order diffusion strategy. Experiments show that PathReasoner achieves competitive performances on two logical reasoning benchmarks and great generalization abilities. © 2024, CC BY.

关键词： Atoms

Evolutionary Algorithms with Heuristic Gradient-based Repair for Constrained Optimization

学校读者我要写书评

暂无评论

Evolutionary Algorithms with Heuristic Gradient-based Repair...

2022 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2022

作者： Du, Jiacheng Bu, Chenyang Liu, Yuxin Liu, Fei Luo, Wenjian Hefei University of Technology Ministry of Education Key Laboratory of Knowledge Engineering with Big Data School of Computer Science and Information Engineering Anhui Hefei230027 China Harbin Institute of Technology School of Computer Science and Technology Guangdong Shenzhen518000 China

ISBN: (数字)9781665452588

ISBN: (纸本)9781665452588

Gradient-based repair aims to repair infeasible solutions to feasible ones using the gradient information of the constraints. As an effective constraint handling method, gradientbased repair has received extensive attention and has been applied in various evolutionary algorithms (EAs). Nevertheless, due to the complexity of constraints in practical problems, a single infeasible solution often needs to be repaired multiple times until it becomes a feasible solution or reaches the maximum number of repairs. As far as we know, existing related research on gradient-based repair mainly applies this method directly to EAs, while there is little work in the evolutionary computing community on how to improve gradient-based repair. Currently, the multiple repairs for a single individual are independent. That is, the current repair does not consider the previous repair experience. However, only using gradient information to repair infeasible individuals may result in oscillations in the search process. Therefore, in this paper, we propose a heuristic gradient-based repair method (HGR) which exploits the previous repair information of an individual to alleviate this issue. Experimental results on several benchmarks demonstrate the effectiveness of the proposed method. The source code is available at https://***/DMiC-Lab-HFUT/HGR-SMC2022. © 2022 IEEE.

关键词： Constrained optimization

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Li, Yangning Kang, Hui Li, Jiahui Sun, Geng Sun, Zemin Wang, Jiacheng Zhao, Changyuan Niyato, Dusit College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Computing and Data Science Nanyang Technological University 639798 Singapore College of Computing and Data Science Nanyang Technological University Singapore

An expansion of Internet of Things (IoTs) has led to significant challenges in wireless data harvesting, dissemination, and energy management due to the massive volumes of data generated by IoT devices. These challenges are exacerbated by data redundancy arising from spatial and temporal correlations. To address these issues, this paper proposes a novel data-driven collaborative beamforming (CB)-based communication framework for IoT networks. Specifically, the framework integrates CB with an overlap-based multi-hop routing protocol (OMRP) to enhance data transmission efficiency while mitigating energy consumption and addressing hot spot issues in remotely deployed IoT networks. Based on the data aggregation to a specific node by OMRP, we formulate a node selection problem for the CB stage, with the objective of optimizing uplink transmission energy consumption. Given the complexity of the problem, we introduce a softmax-based proximal policy optimization with long-short-term memory (SoftPPO-LSTM) algorithm to intelligently select CB nodes for improving transmission efficiency. Simulation results show that the proposed OMRP improves network lifetime by 17% compared to benchmark routing protocols, while the SoftPPO-LSTM method for CB node selection achieves an 8.3% increase in throughput over benchmark algorithms. The results also reveal that the combined OMRP with the SoftPPO- Copyright © 2025, The Authors. All rights reserved.

关键词： Deep reinforcement learning