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

arXiv 2023年

作者： Ji, Qiu Zhang, Xiaoping Ye, Yuxin Qi, Guilin Li, Jiaye Li, Site Ren, Jianjie Lu, Songtao School of Modern Posts Institute of Modern Posts Nanjing University of Posts and Telecommunications Nanjing China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China National Data Center ofTraditional Chinese MedicineChina Academy of ChineseMedical Sciences Beijing100700 China College of Computer Science and Technology Jilin University Changchun130012 China School of Computer Science and Engineering Southeast University Nanjing China Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education Nanjing China School of Mathematics Southeast University Nanjing China Chien-Shiung Wu College Southeast University Nanjing China

Ontology revision aims to seamlessly incorporate a new ontology into an existing ontology and plays a crucial role in tasks such as ontology evolution, ontology maintenance, and ontology alignment. Similar to repair single ontologies, resolving logical incoherence in the task of ontology revision is also important and meaningful, because incoherence is a main potential factor to cause inconsistency and reasoning with an inconsistent ontology will obtain meaningless answers. To deal with this problem, various ontology revision approaches have been proposed to define revision operators and design ranking strategies for axioms in an ontology. However, they rarely consider axiom semantics which provides important information to differentiate axioms. In addition, pre-trained models can be utilized to encode axiom semantics, and have been widely applied in many natural language processing tasks and ontology-related ones in recent years. Therefore, in this paper, we study how to apply pre-trained models to revise ontologies. We first define four scoring functions to rank axioms based on a pre-trained model by considering various information from an ontology. Based on the functions, an ontology revision algorithm is then proposed to deal with unsatisfiable concepts at once. To improve efficiency, an adapted revision algorithm is designed to deal with unsatisfiable concepts group by group. We conduct experiments over 19 ontology pairs and compare our algorithms and scoring functions with existing ones. According to the experiments, our algorithms could achieve promising performance. The adapted revision algorithm could improve the efficiency largely, and at most about 90% of the time could be saved for some ontology pairs. Some of our scoring functions like reliableOnt cos could help a revision algorithm obtain better results in many cases, especially for those challenging ontology pairs like OM8. We also provide discussion about the overall experimental results and guidelin

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Quantifying Interactions between Layers in Duplex Networks Using Interactive Entropy

引用

Journal of Library & Information Studies 2020年第2期18卷 31-41页

作者： Zhang, Ronda J. Ye, Fred Y. International Joint Informatics Laboratory (IJIL) Nanjing University - University of Illinois Nanjing-Champaign Nanjing China Jiangsu Key Laboratory of Data Engineering and Knowledge Service School of Information Management Nanjing University Nanjing China

The multiplex network has attracted wide attention because it can better describe the various relationships in the real world, and the duplex network is a special two-layer form of it. The purpose of this research focuses on introducing new entropy-based measures for multiplex network, especially duplex network. The new measure called Interactive entropy in duplex network (IE) is based on information entropy, a key concept of information theory. It can be applied to various types of multiplex networks to quantify the differences between the layers of inside duplex network. [ABSTRACT FROM AUTHOR]

关键词： Duplex Network Interactive Entropy Multiplex Network

来源：评论

学校读者我要写书评

暂无评论

Q&A driven conversational recommendation integrating multiple interest modeling

引用

Neurocomputing 2025年

作者： Haiping Zhu Yuqi Sun Shuwei Che Yan Chen School of Computer Science and Technology Xi’an Jiaotong University Xi’an 710049 China Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong University Xi’an 710049 China Ministry of Education Key Laboratory of Intelligent Networks and Network Security Xi’an Jiaotong University Xi’an 710049 China

The conversational recommendation aims to provide users with recommendations in an interaction form of “System Ask-User Respond” . Existing studies rarely consider combining users’ multi-interest at the attribute level for preference modeling, and conduct inefficient conversational recommendation strategy learning, which affects the recommendation performance and conversation performance. To this end, we proposed a Q-A driven conversational recommendation method integrating multiple interest modeling. Specifically, we integrate the user’s positive and negative feedback to model a session dynamic graph, then use the signed graph convolutional network for graph representation learning, and we model multiple interest sequences based on the attention mechanism, then obtain the user interest state representation by fusing of sequence representations to solve the problem of insufficient user preference representation. Besides, we proposed a personalized decision space optimization method to narrow the range of action candidates and train the model with a multi-agent reinforcement learning method integrating hierarchical decision debiasing to solve the problem of poor conversational recommendation strategy learning effect. Experimental results on three public datasets, LastFM, Yelp, and Book, show that compared with existing conversational recommendation methods, our method demonstrates consistent performance improvement across all datasets. In addition, the results of ablation experiments verify the effectiveness of each component in our method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Creating Something From Nothing: Unsupervised knowledge Distillation for Cross-Modal Hashing

Creating Something From Nothing: Unsupervised Knowledge Dist...

引用

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Hengtong Hu Lingxi Xie Richang Hong Qi Tian School of Computer Science and Information Engineering Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Huawei Inc.

ISBN: (数字)9781728171685

ISBN: (纸本)9781728171692

In recent years, cross-modal hashing (CMH) has attracted increasing attentions, mainly because its potential ability of mapping contents from different modalities, especially in vision and language, into the same space, so that it becomes efficient in cross-modal data retrieval. There are two main frameworks for CMH, differing from each other in whether semantic supervision is required. Compared to the unsupervised methods, the supervised methods often enjoy more accurate results, but require much heavier labors in data annotation. In this paper, we propose a novel approach that enables guiding a supervised method using outputs produced by an unsupervised method. Specifically, we make use of teacher-student optimization for propagating knowledge. Experiments are performed on two popular CMH benchmarks, i.e., the MIRFlickr and NUS-WIDE datasets. Our approach outperforms all existing unsupervised methods by a large margin.

关键词： Training Semantics Computational modeling Feature extraction Dogs Training data Task analysis

来源：评论

学校读者我要写书评

暂无评论

Creating something from nothing: Unsupervised knowledge distillation for cross-modal hashing

arXiv

引用

arXiv 2020年

作者： Hu, Hengtong Xie, Lingxi Hong, Richang Tian, Qi School of Computer Science and Information Engineering Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Huawei Inc.

关键词： Supervised learning

来源：评论

学校读者我要写书评

暂无评论

One-bit supervision for image classification 20

One-bit supervision for image classification

引用

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

作者： Hengtong Hu Lingxi Xie Zewei Du Richang Hong Qi Tian Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology and School of Computer Science and Information Engineering Hefei University of Technology Huawei Inc.

ISBN: (纸本)9781713829546

This paper presents one-bit supervision, a novel setting of learning from incomplete annotations, in the scenario of image classification. Instead of training a model upon the accurate label of each sample, our setting requires the model to query with a predicted label of each sample and learn from the answer whether the guess is correct. This provides one bit (yes or no) of information, and more importantly, annotating each sample becomes much easier than finding the accurate label from many candidate classes. There are two keys to training a model upon one-bit supervision: improving the guess accuracy and making use of incorrect guesses. For these purposes, we propose a multi-stage training paradigm which incorporates negative label suppression into an off-the-shelf semi-supervised learning algorithm. In three popular image classification benchmarks, our approach claims higher efficiency in utilizing the limited amount of annotations.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Relation extraction with proactive domain adaptation strategy 11

Relation extraction with proactive domain adaptation strateg...

引用

11th IEEE International Conference on knowledge Graph, ICKG 2020

作者： Zhong, Lingfeng Zhu, Yi Key Laboratory of Knowledge Engineering with Big Data (Heifei Unversity of Technology) Ministry of Education Heifei China School of Computer Science and Information Engineering Heifei University of Technology Heifei China Yangzhou University School of Computer Science and Technology Yangzhou China

ISBN: (数字)9781728181561

ISBN: (纸本)9781728181578

Relation extraction is an important information extraction task in many Natural Language Processing (NLP) applications, such as automatic knowledge graph construction, question answering, sentiment analysis, etc. However, relation extraction suffers from inappropriate associations between entities when the background knowledge of corpus is insufficiency. Despite the preprocessed external word vector bases can ease this problem, how to find a single word vector base as domain knowledge that contains all the required knowledge features is a huge challenge, and relation extraction with background knowledge is still open to further optimization. To address this problem, in this paper, we propose Relation Extraction method with Proactive Domain Adaptation Strategy (REPDAS for short) to introduce more knowledge features from different knowledge bases. More specifically, firstly, a convolutional network with a parameter-sharing layer is introduced for relation extraction, and word seeds that are important to relational feature exploitation are proactively picked by an attention mechanism during training. Secondly, the proactively-chosen word seeds and the previous parameter-sharing layer are utilized to establish a map between different domains. Our proposed method selectively avails both background knowledge and contextual features for relation extraction by incorporating the convolutional neural network with the proactively domain adaptation strategy. Experiments show that our method effectively enhances the performance of relation extraction compared with other baselines. © 2020 IEEE.

关键词： Domain Adaptation knowledge Graph Relation Extraction

来源：评论

学校读者我要写书评

暂无评论

Multi-fuzzy-objective graph pattern matching with big graph data

引用

Journal of database Management 2019年第4期30卷 24-40页

作者： Li, Lei Zhang, Fang Liu, Guanfeng Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China Zhongxing Telecommunication Equipment Corporation Nanjing China Macquarie University Sydney Australia

Big graph data is different from traditional data and they usually contain complex relationships and multiple attributes. With the help of graph pattern matching, a pattern graph can be designed, satisfying special personal requirements and locate the subgraphs which match the required pattern. Then, how to locate a graph pattern with better attribute values in the big graph effectively and efficiently becomes a key problem to analyze and deal with big graph data, especially for a specific domain. This article introduces fuzziness into graph pattern matching. Then, a genetic algorithm, specifically an NSGA-II algorithm, and a particle swarm optimization algorithm are adopted for multifuzzy-objective optimization. Experimental results show that the proposed approaches outperform the existing approaches effectively. © 2019,IGI Global.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

A Metric Approach to Hot Topics in Biomedicine via Keyword Co-occurrence

引用

Journal of data and Information Science 2019年第4期4卷 13-25页

作者： Jane H.Qin Jean J.Wang Fred Y.Ye Jiangsu Key Laboratory of Data Engineering and Knowledge Service School of Information ManagementNanjing UniversityNanjing 210023China International Joint Informatics Laboratory(IJIL) Nanjing University-University of IllinoisNanjing-ChampaignChina-USA

Purpose:To reveal the research hotpots and relationship among three research hot topics in b iomedicine,namely CRISPR,iPS(induced Pluripotent Stem)cell and Synthetic ***/methodology/approach:We set up their keyword co-occurrence networks with using three indicators and information visualization for metric ***:The results reveal the main research hotspots in the three topics are different,but the overlapping keywords in the three topics indicate that they are mutually integrated and interacted each *** limitations:All analyses use keywords,without any other *** implications:We try to find the information distribution and structure of these three hot topics for revealing their research status and interactions,and for promoting biomedical ***/value:We chose the core keywords in three research hot topics in biomedicine by using h-index.

关键词： Keyword co-occurrence Network analysis Information visualization Biomedicine Hot topics CRISPR-Cas iPS cell Synthetic biology

来源：评论

学校读者我要写书评

暂无评论

LSBert: Lexical Simplification Based on BERT

引用

IEEE/ACM Transactions on Audio Speech and Language Processing 2021年 29卷 3064-3076页

作者： Qiang, Jipeng Li, Yun Zhu, Yi Yuan, Yunhao Shi, Yang Wu, Xindong Department of Computer Science Jiangsu Yangzhou China Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education Anhui Hefei China Mininglamp Academy of Sciences Minininglamp Beijing 100864 China

Lexical simplification (LS) aims at replacing complex words with simpler alternatives. LS commonly consists of three main steps: complex word identification, substitute generation, and substitute ranking. Existing LS methods focus on the contextual information of the complex word in the last step (substitute ranking). However, they miss out the following two facts: (1) The word complexity of a polysemous word is very closely related to its context;(2) The step of substitute generation regardless of the context will inevitably produce a large number of spurious candidates. Therefore, we propose a novel LS system LSBert based on pretrained language model BERT to address the aforementioned issues, which is capable of making use of the wider context when both identifying the words in need of simplification and generating substitute candidates for the complex words. Specifically, LSBert consists of a network for complex word identification by fine-tuning BERT and a network for substitute generation based on BERT. Experimental results show that LSBert performs well in both complex word identification and substitute generation, achieving state-of-the-art results in three benchmarks. © 2014 IEEE.

关键词： BERT Complex word identification Lexical simplification Sentence simplification

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：