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

IEEE International Conference on data Mining (ICDM)

作者： Xiaoyu Zhu Chenyang Bu Bingbing Dong Shengwei Ji Yi He Xindong Wu Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology School of Computer Science and Information Engineering Hefei University of Technology China School of Artificial Intelligence and Big Data Hefei University China Department of Computer Science Old Dominion University USA Research Center for Knowledge Engineering Zhejiang Lab China

Point-of-Interest (POI) recommendation, pivotal for guiding users to their next interested locale, grapples with the persistent challenge of data sparsity. Whereas knowledge graphs (KGs) have emerged as a favored tool to mitigate the issue, existing KG-based methods tend to overlook two crucial elements: the intention steering users’ location choices and the high-order topological structure within the KG. In this paper, we craft an Intention-aware knowledge Graph (IKG) that harmonizes users’ visit histories, movement trajectories, and location categories to model user intentions. Building upon IKG, our novel Intention-aware knowledge Graph Network (IKGN) delves deeper into the POI recommendation by weighing and propagating node embeddings through an attention mechanism, capturing the unique locational intent of each user. A sequential model like GRU is then employed to ensure a comprehensive representation of users’ short- and long-term location preferences. An empirical study on two real-world datasets validates the effectiveness of our proposed IKGN, with it markedly outshining seven benchmark rival models in both Recall and NDCG metrics. The code of IKGN is available at https://***/Jungle123456/IKGN.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Bandwidth-aware breach-free barrier construction with VANET nodes for realtime fugitive search

Bandwidth-aware breach-free barrier construction with VANET ...

引用

MILCOM, Military Communications Conference

作者： Donghyun Kim Junggab Son Wei Wang Deying Li Alade O. Tokuta Sunghyun Cho North Carolina Central University Durham NC US North Carolina Central University Durham USA School of Mathematics and Statistics Xi'an Jiaotong University Xi'an China Key Laboratory of Data Engineering and Knowledge Engineering (Renmin University) Renmin University of China P.R. China Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China China Hanyang University South Korea

ISBN: (纸本)9781509000746

In this paper, we introduce a new strategy of using VANET nodes with visual sensors and wireless transceivers to build an instant camera barrier for a given mission period. Given a set of properly equipped VANET nodes whose drivers voluntarily join the protocol by exposing their future travel plans and use onboard equipment to transmit realtime video to the authority, we aim to maintain the barrier of VANET nodes during a given mission period. Under the constraints that the mobility of each VANET node is not controllable and the size of barrier, i.e. the number of concurrent participants, cannot exceed a given number due to the network system capacity limit, we propose a polynomial time algorithm for the problem. To the best of our knowledge, this is the first work to consider the construction of camera barriers in pure mobile camera sensor network.

关键词： Sensors Vehicular ad hoc networks Cameras Wireless sensor networks Mobile communication Visualization Vehicles

来源：评论

学校读者我要写书评

暂无评论

Forecasting Chinese Stock Market Prices using Baidu Search Index with a Learning-Based data Collection Method

Forecasting Chinese Stock Market Prices using Baidu Search I...

引用

作者： Dong, Jichang Dai, Wei Liu, Ying Yu, Lean Wang, Jie 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 School of Economics and Management Beijing University of Chemical Technology Beijing100029 China Department of Civil and Environmental Engineering Stanford University StanfordCA94305 United States

In this study, to address search index selection and volatility problems, we propose a learning-based search index collection method that collects the search data fraction for modeling by learning the best criteria from robust statistics. Based on the fraction of collected search index from internet search engine (***) data sources, a novel model is formulated for Chinese stock market price forecasting. We empirically test our method on the two main Chinese stock market price indexes and discover that the prediction accuracy is equivalent or superior to the benchmarks from previous studies that used alternative search index collection methods or lagged data prediction models. All prediction results outstand the importance of an effective data collection method for the robustness of forecast models and demonstrate the utility of a learning-based collection method for addressing search index collection problem, leading to a significant improvement in Chinese stock market price prediction accuracy. © 2019 World Scientific Publishing Company.

关键词： Search engines

来源：评论

学校读者我要写书评

暂无评论

Large Language Model for Table Processing: A Survey

arXiv

引用

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

来源：评论

学校读者我要写书评

暂无评论

Marginal Value-Based Edge Resource Pricing and Allocation for Deadline-Sensitive Tasks

Marginal Value-Based Edge Resource Pricing and Allocation fo...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Puwei Wang Zhouxing Sun Ying Zhan Haoran Li Xiaoyong Du School of Information Renmin University of China Key Laboratory of Data Engineering and Knowledge Engineering of Ministry of Education Renmin University of China Beijing China Guizhou University of Finance and Economics Guiyang City China

In edge computing (EC), resource allocation is to allocate computing, storage and networking resources on the edge nodes (ENs) efficiently and reasonably to tasks generated by users. Due to the resource-limitation of ENs, the tasks often need to compete for the resources. Pricing mechanisms are widely used to deal with the resource allocation problem, and the valuations of tasks play a critical role in the price mechanisms. However, users naturally are not willing to expose the valuations of their tasks due to conflicts of interests. Current research works usually adopt truthful auctions to motivate the users to report honestly the valuations of their tasks. In this paper, we introduce the marginal value to estimate the valuations of tasks, and propose a marginal value-based pricing mechanism using the incentive theory, which motivates the tasks with higher marginal values to actively request more resources. The EC platform sets the resource prices using the price mechanism, and then the users determine their resource requests relying on the resource prices and the valuations of their tasks. After receiving the deadline-sensitive tasks from the users, the resource allocation can be modeled as a knapsack problem with the deadline constraints. Extensive experimental results demonstrate that our approach is computationally efficient and is promising in enhancing the utility of the EC platform and the tasks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Learning Relation-Specific Representations for Few-shot knowledge Graph Completion

arXiv

引用

arXiv 2022年

作者： Li, Yuling Yu, Kui Zhang, Yuhong Wu, Xindong Key Laboratory of Knowledge Engineering with Big Data of Ministry of Education Hefei University of Technology Hefei230601 China School of Computer Science and Information Engineering Hefei University of Technology Hefei230601 China

Recent years have witnessed increasing interest in few-shot knowledge graph completion (FKGC), which aims to infer unseen query triples for a few-shot relation using a few reference triples about the relation. The primary focus of existing FKGC methods lies in learning relation representations that can reflect the common information shared by the query and reference triples. To this end, these methods learn entity-pair representations from the direct neighbors of head and tail entities, and then aggregate the representations of reference entity pairs. However, the entity-pair representations learned only from direct neighbors may have low expressiveness when the involved entities have sparse direct neighbors or share a common local neighborhood with other entities. Moreover, merely modeling the semantic information of head and tail entities is insufficient to accurately infer their relational information especially when they have multiple relations. To address these issues, we propose a Relation-Specific Context Learning (RSCL) framework, which exploits graph contexts of triples to learn global and local relation-specific representations for few-shot relations. Specifically, we first extract graph contexts for each triple, which can provide long-term entity-relation dependencies. To encode the extracted graph contexts, we then present a hierarchical attention network to capture contextualized information of triples and highlight valuable local neighborhood information of entities. Finally, we design a hybrid attention aggregator to evaluate the likelihood of the query triples at the global and local levels. Experimental results on two public datasets demonstrate that RSCL outperforms state-of-the-art FKGC methods. © 2022, CC BY.

关键词： knowledge graph

来源：评论

学校读者我要写书评

暂无评论

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

arXiv

引用

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

来源：评论

学校读者我要写书评

暂无评论

Rapid Resynchronization Method for Replication In-Memory databases Supporting Mobile Communication Applications

Rapid Resynchronization Method for Replication In-Memory Dat...

引用

Computer Science and Information engineering, CSIE, WRI World Congress on FLAGGED

作者： Guoqiong Liao Jing Li Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics Nanchang China School of Information Technology Jiangxi University of Finance and Economics Nanchang China

In this paper, a rapid resynchronization method using intent logs is suggested for replication in-memory databases supporting mobile communication applications. Both the identifiers of unsynchronized segments and the identifiers of the slaves who have missed the updates in the segments are recorded in the intent logs. When receiving a resynchronization request from a slave, the master will scan the intent logs to find the unsynchronized segments for the salve, and then send the segments gotten directly from its memory to the slave. The performance results shown the intent logs method can reduce resynchronization time than methods using transaction logs.

关键词： Mobile communication Master-slave Transaction databases Availability Mission critical systems knowledge engineering Application software Finance Resumes Computer crashes

来源：评论

学校读者我要写书评

暂无评论

A Coffee-Ring Effect-Based Paper Sensor Chip for the Determination of Β-Lactoglobulin in Foods Via a Smartphone

SSRN

引用

SSRN 2022年

作者： Lu, Yang Yang, Jingyi Zhang, Yong Wu, Lin State Key Laboratory for Food Nutrition and Safety College of Food Science and Engineering Tianjin University of Science and Technology Tianjin300457 China State Key Laboratory of Knowledge Engineering with Big Data School of Computer Science and Information Engineering Hefei University of Technology Hefei230009 China

To determine allergen β-lactoglobulin (β-LG) in foods, a method by a coffee-ring effect (CRE)-based paper sensor chip combined with a smartphone has been developed. The strategy was based on the principle of fluorescence quenching by the quantum dot-aptamer-graphene oxide (QD-Apt-GO) and where the degree of quenching was inversely proportional to the concentration of β-LG. First, the prepared β-LG solution was added to the QD-aptamer fluorescent probe solution followed by an appropriate amount of GO. After the reaction, a certain amount of the mixture was dispensed onto the detection zone of the sensor chip, resulting in the spread of the analyte solution by evaporation-driven flow. The QD-aptamer and the QD-Apt-β-LG in the mixed solution formed a visible fluorescent coffee-ring. For signal quantitation, an image of the coffee-ring was taken by a smartphone and imported into self-programmed software for analysis. The quantitative results for β-LG were acquired rapidly based on the magnitude of the generated fluorescent coffee-ring. The limit of detection (LOD) for β-LG was 0.048 mg L -1 and the linear range for the optimized assay was 0.39–1000 mg L -1 . The method was validated for analysis of real food samples and the results were consistent with those of a commercial ELISA assay kit. The smartphone-based assay provides a simple, economic, compact, and visual detection platform for the determination of β-LG in foods. © 2022, The Authors. All rights reserved.

关键词： Graphene

来源：评论

学校读者我要写书评

暂无评论

Mining opinion word from customer review

International Journal of Database Theory and Application

引用

International Journal of database Theory and Application 2016年第2期9卷 129-136页

作者： Tengjiao, Jiang Minjuan, Zhong Shumei, Liao Siwen, Luo School of Information Technology Jiangxi University of Finance and Economics Nanchang China Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics Nanchang China

Online customer review is considered as a significant informative resource which is useful for both potential customer and product manufacturers. As a result, it is one of the most challenging tasks to mine customer reviews automatically and to provide users with opinion summary. Product features and opinion word play the most important roles in the customers' opinions mining. In this paper, we dedicate our work to opinion word mining. We proposed an approach for opinion word identification based on the association rule mining algorithm. The method makes full use of co-occurrence syntactic characteristic between product features and opinion word. Firstly, the product feature is identified by two-stage filtering scheme, and secondly the opinion word is extracted through association rule mining. The final experiment results show that the proposed method could not only obtain the product features related to domain characteristics, but identify the opinion word effectively. Meanwhile, our approach possesses much higher precision and recall than Hu's work.

关键词： Association rules

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：