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

2022 Conference on Empirical Methods in Natural Language Processing, EMNLP 2022

作者： Pan, Yudai Liu, Jun Zhang, Lingling Zhao, Tianzhe Lin, Qika Hu, Xin Wang, Qianying School of Computer Science and Technology Xi'an Jiaotong University China National Engineering Lab for Big Data Analytics China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering China Lenovo Research Beijing China

Relation prediction in knowledge graphs (KGs) aims at predicting missing relations in incomplete triples, whereas the dominant embedding paradigm has a restriction on handling unseen entities during testing. In the real-world scenario, the inductive setting is more common because entities in the training process are finite. Previous methods capture an inductive ability by implicit logic in KGs. However, it would be challenging to preciously acquire entity-independent relational semantics of compositional logic rules and to deal with the deficient supervision of logic caused by the scarcity of relational semantics. To this end, we propose a novel graph convolutional network (GCN)-based model LogCo with logical reasoning by contrastive representations. LogCo firstly extracts enclosing subgraphs and relational paths between two entities to supply the entity-independence. Then a contrastive strategy for relational path instances and the subgraph is proposed for the issue of deficient supervision. The contrastive representations are learned for a joint training regime. Finally, prediction results and logic rules for reasoning are attained. Comprehensive experiments on twelve inductive datasets show that LogCo achieves outstanding performance comparing with SOTA inductive baselines. © 2022 Association for Computational Linguistics.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Short Text Topic Modeling Techniques, Applications, and Performance: A Survey

引用

IEEE Transactions on knowledge and data engineering 2022年第3期34卷 1427-1445页

作者： Qiang, Jipeng Qian, Zhenyu Li, Yun Yuan, Yunhao Wu, Xindong Department of Computer Science Yangzhou University Jiangsu225009 China Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Hefei University of Technology Hefei Anhui230026 China Mininglamp Academy of Sciences Minininglamp Beijing China

Analyzing short texts infers discriminative and coherent latent topics that is a critical and fundamental task since many real-world applications require semantic understanding of short texts. Traditional long text topic modeling algorithms (e.g., PLSA and LDA) based on word co-occurrences cannot solve this problem very well since only very limited word co-occurrence information is available in short texts. Therefore, short text topic modeling has already attracted much attention from the machine learning research community in recent years, which aims at overcoming the problem of sparseness in short texts. In this survey, we conduct a comprehensive review of various short text topic modeling techniques proposed in the literature. We present three categories of methods based on Dirichlet multinomial mixture, global word co-occurrences, and self-aggregation, with example of representative approaches in each category and analysis of their performance on various tasks. We develop the first comprehensive open-source library, called STTM, for use in Java that integrates all surveyed algorithms within a unified interface, benchmark datasets, to facilitate the expansion of new methods in this research field. Finally, we evaluate these state-of-the-art methods on many real-world datasets and compare their performance against one another and versus long text topic modeling algorithm. © 2020 IEEE.

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

Learning Inter-Entity Interaction for Few-Shot knowledge Graph Completion

Learning Inter-Entity Interaction for Few-Shot Knowledge Gra...

引用

2022 Conference on Empirical Methods in Natural Language Processing, EMNLP 2022

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

Few-shot knowledge graph completion (FKGC) aims to infer unknown fact triples of a relation using its few-shot reference entity pairs. Recent FKGC studies focus on learning semantic representations of entity pairs by separately encoding the neighborhoods of head and tail entities. Such practice, however, ignores the inter-entity interaction, resulting in low-discrimination representations for entity pairs, especially when these entity pairs are associated with 1-to-N, N-to-1, and N-to-N relations. To address this issue, this paper proposes a novel FKGC model, named Cross-Interaction Attention Network (CIAN) to investigate the inter-entity interaction between head and tail entities. Specifically, we first explore the interactions within entities by computing the attention between the task relation and each entity neighbor, and then model the interactions between head and tail entities by letting an entity to attend to the neighborhood of its paired entity. In this way, CIAN can figure out the relevant semantics between head and tail entities, thereby generating more discriminative representations for entity pairs. Extensive experiments on two public datasets show that CIAN outperforms several state-of-the-art methods. The source code is available at https://***/cjlyl/FKGC-CIAN. © 2022 Association for Computational Linguistics.

关键词： knowledge graph

来源：评论

学校读者我要写书评

暂无评论

How to Mitigate Information Loss in knowledge Graphs for GraphRAG: Leveraging Triple Context Restoration and Query-Driven Feedback

arXiv

引用

arXiv 2025年

作者： Huang, Manzong Bu, Chenyang He, Yi Wu, Xindong Key Laboratory of Knowledge Engineering with Big Data [Hefei University of Technology Ministry of Education China School of Data Science William & Mary WilliamsburgVA United States

knowledge Graph (KG)-augmented Large Language Models (LLMs) have recently propelled significant advances in complex reasoning tasks, thanks to their broad domain knowledge and contextual awareness. Unfortunately, current methods often assume KGs to be complete, which is impractical given the inherent limitations of KG construction and the potential loss of contextual cues when converting unstructured text into entity-relation triples. In response, this paper proposes the Triple Context Restoration and Query-driven Feedback (TCR-QF) framework, which reconstructs the textual context underlying each triple to mitigate information loss, while dynamically refining the KG structure by iteratively incorporating query-relevant missing knowledge. Experiments on five benchmark question-answering datasets substantiate the effectiveness of TCR-QF in KG and LLM integration, where it achieves a 29.1% improvement in Exact Match and a 15.5% improvement in F1 over its state-of-the-art GraphRAG competitors. © 2025, CC BY.

关键词： knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Phase spectrum based automatic ship detection in synthetic aperture radar images

引用

Journal of Ocean engineering and Science 2021年第2期6卷 185-195页

作者： Miaohui Zhang Baojun Qiao Ming Xin Bo Zhang Henan Key Laboratory of Big Data Analysis and Processing Henan UniversityKaifengChina Institute of Data and Knowledge Engineering Henan UniversityKaifengChina School of Computer Science and Engineering Beihang UniversityBeijingChina

This paper proposes an automatic ship detection approach in Synthetic Aperture Radar(SAR)Images using phase *** proposed method mainly contains two stages:Firstly,sea-land segmentation of SAR Images is one of the key stages for SAR image application such as sea-targets detection and recognition,which are easily detected only in sea *** order to eliminate the influence of land regions in SAR images,a novel land removing method is *** removing method employs a Harris corner detector to obtain some image patches belonging to land,and the probability density function(PDF)of land area can be estimated by these ***,an appropriate land segmentation threshold is accordingly ***,an automatic ship detector based on phase spectrum is *** proposed detector is free from various idealized assumptions and can accurately detect ships in SAR *** results demonstrate the efficiency of the proposed ship detection algorithm in diversified SAR images.

关键词： Ship detection saliency detection phase spectrum sea-land segmentation

来源：评论

学校读者我要写书评

暂无评论

KAN v.s. MLP for Offline Reinforcement Learning

KAN v.s. MLP for Offline Reinforcement Learning

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Guo, Haihong Li, Fengxin Li, Jiao Liu, Hongyan School of Information Renmin University of China China Institute of Medical Information Medical Library Chinese Academy of Medical Sciences Peking Union Medical College China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education China School of Economics and Management Tsinghua University China

ISBN: (纸本)9798350368741

Kolmogorov-Arnold Networks (KAN) is an emerging neural network architecture in machine learning. It has greatly interested the research community about whether KAN can be a promising alternative to the commonly used Multi-Layer Perceptions (MLP). Experiments in various fields demonstrated that KAN-based machine learning can achieve comparable if not better performance than MLP-based methods, but with much smaller parameter scales and are more explainable. In this paper, we explore the incorporation of KAN into the actor and critic networks for offline reinforcement learning (RL). We evaluated the performance, parameter scales, and training efficiency of various KAN and MLP-based conservative Q-learning (CQL) on the classical D4RL benchmark for offline RL. Our study demonstrates that KAN can achieve performance close to the commonly used MLP with significantly fewer parameters. This allows us to choose the base networks according to the offline RL task requirements. © 2025 IEEE.

关键词： KAN Kolmogorov-Arnold networks MLP multilayer perceptrons offline reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Gender Disparity in Expressed Emotions within Health-Related Online Support Groups

引用

Proceedings of the Association for Information Science and Technology 2021年第1期58卷 883-885页

作者： Zhao, Yuehua Wang, Hao Deng, Sanhong Chen, Ye Nanjing University Jiangsu Key Laboratory of Data Engineering and Knowledge Service Nanjing China Central China Normal University Wuhan China

Online support groups offer a new way to users to communicate with others regarding certain health issues. Taking autism-related support groups on Facebook as an example, we examine whether the expressed emotions differ between female and male users in online health-related support groups and whether such gender disparity varied based on the topics of the groups. Experimental results reveal a significant gender difference of expressed emotions in the groups. We find that female users tended to express more positive emotions in the group discussions than the male group members did. In addition, users appeared to express different sentiments within the groups focused on various topics. Male users tend to convey more negative emotions in the group that related to treatment, while female users were more positive when posted in the research-related group than male users were. This study is beneficial for tracking and moderating the emotional environment in online support groups. 84 Annual Meeting of the Association for Information Science & Technology | Oct. 29 – Nov. 3, 2021 | Salt Lake City, UT. Author(s) retain copyright, but ASIS&T receives an exclusive publication license.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

Cutting Learned Index into Pieces: An In-depth Inquiry into Updatable Learned Indexes

Cutting Learned Index into Pieces: An In-depth Inquiry into ...

引用

International Conference on data engineering

作者： Jiake Ge Boyu Shi Yanfeng Chai Yuanhui Luo Yunda Guo Yinxuan He Yunpeng Chai Key Laboratory of Data Engineering and Knowledge Engineering MOE China School of Information Renmin University of China China

Numerous high-performance updatable learned indexes have recently been designed to support the writing requirements in practical systems. Researchers have proposed various strategies to improve the availability of updatable learned indexes. However, it is unclear which strategy is more profitable. Therefore, we deconstruct the design of learned indexes into multiple dimensions and in-depth evaluate their impacts on the overall performance, respectively. Through the in-depth exploration of learned indexes, we reckon that the approximation algorithm is the most crucial design dimension for improving the performance of the learned indexes rather than the popular works that focus on the learned index structure. Moreover, this paper makes a comprehensive end-to-end evaluation based on a high-performance key-value store to answer people’s concerns about which learned index is better and whether learned indexes can outperform traditional ones. Finally, according to end-to-end and in-depth evaluation results, we give some constructive suggestions on designing a better learned index in these dimensions, especially how to design an excellent approximate algorithm to improve the lookup and insertion performance of learned indexes.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An Efficient Customized Blockchain System for Inter-Organizational Processes

An Efficient Customized Blockchain System for Inter-Organiza...

引用

2023 IEEE International Conference on Web Services, ICWS 2023

作者： Wang, Puwei Sun, Zhouxing Li, Rui Chen, Jinchuan Gong, Ping Du, Xiaoyong Renmin University of China School of Information China Renmin University of China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education China Renmin University of China School of Mathematics China Fujian Normal University College of Computer and Cyber Security China

ISBN: (纸本)9798350304855

Blockchain technologies pave a promising way for implementing the inter-organizational processes. Most of the current research works translate the execution logic in the process models into the smart contracts, which can run independently on the blockchain without the outside process engine. However, the works usually suffer from the execution and storage costs, since the translation needs to be done when the processes are deployed. In this paper, we customize a process engine for executing the inter-organizational business processes via a blockchain-style procedure, i.e., checking the validity of transactions, adding the valid transactions into the blockchain through the consensus mechanism, and then updating the process states according to the committed transactions. And then, we build a blockchain system by embedding the customized process engine into the blockchain nodes. Moreover, in order to realize the interactions between the inter-organizational processes running on blockchain and the services outside blockchain, we propose a blockchain-based approach for service registration, binding and invocation, and design a lease-based concurrency control protocol to logically isolate transactions from each other when invoking the services simultaneously. Finally, we implement a prototype system based on a permissioned blockchain platform Hyperledger Fabric and a process engine Activiti. The experimental results show the proposed blockchain system can execute the inter-organizational processes correctly and efficiently. © 2023 IEEE.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Context-Aware Semantic Type Identification for Relational Attributes

引用

Journal of Computer Science & Technology 2023年第4期38卷 927-946页

作者：丁玥郭雨荷卢卫李海翔张美慧李晖潘安群杜小勇 Key Laboratory of Data Engineering and Knowledge Engineering of Ministry of Education Renmin University of China Beijing 100872China School of Information Renmin University of ChinaBeijing 100872China Tencent(Beijing)Technology Company Limited Beijing 100080China School of Computer Science and Technology Beijing Institute of TechnologyBeijing 100081China College of Computer Science and Technology Guizhou UniversityGuiyang 550025China Tencent(Shenzhen)Technology Company Limited Shenzhen 518057China

Identifying semantic types for attributes in relations,known as attribute semantic type(AST)identification,plays an important role in many data analysis tasks,such as data cleaning,schema matching,and keyword search in ***,due to a lack of unified naming standards across prevalent information systems(*** islands),AST identification still remains as an open *** tackle this problem,we propose a context-aware method to figure out the ASTs for relations in this *** transform the AST identification into a multi-class classification problem and propose a schema context aware(SCA)model to learn the representation from a collection of relations associated with attribute values and schema *** on the learned representation,we predict the AST for a given attribute from an underlying relation,wherein the predicted AST is mapped to one of the labeled *** improve the performance for AST identification,especially for the case that the predicted semantic types of attributes are not included in the labeled ASTs,we then introduce knowledge base embeddings(***)to enhance the above representation and construct a schema context aware model with knowledge base enhanced(SCA-KB)to get a stable and robust *** experiments based on real datasets demonstrate that our context-aware method outperforms the state-of-the-art approaches by a large margin,up to 6.14%and 25.17%in terms of macro average F1 score,and up to 0.28%and 9.56%in terms of weighted F1 score over high-quality and low-quality datasets respectively.

关键词： attribute semantic type(AST)identification context-aware semantic embedding knowledge base embedding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：