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

International Joint Conference on Neural Networks (IJCNN)

作者： Zhong-Qiu Zhao Yue-Lin Sun Nan-Xun Wang Wei-Dong Tian Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology School of Computer Science and Information Engineering Hefei University of Technology Hefei China

ISBN: (数字)9781728169262

ISBN: (纸本)9781728169279

Recently, instead of pursuing high performance on classical evaluation metrics, the research focus of image captioning has shifted to generating sentences which are more vivid and stylized than human-written ones. However, there are still no applicable metrics which can judge how close the generated captions are to the human-written ones. In this paper, we propose a novel learning-based evaluation metric, namely Unpaired Image Captioning Evaluation (UICE), which can be trained to distinguish between human-written and generated captions. Unlike existing metrics, our UICE consists of two parts: the semantic alignment module measuring the semantic distance between extracted image features and caption meanings, and the syntactic discriminating module syntactically judging how human-like the candidate caption is. The semantic alignment module is implemented by mapping the image features and the word embedding into a unified tensor space. And the syntactic discriminating module is designed to be learning-based, and thereby can be trained to be stylized by users' own, fed with additional personalized corpus during the training process. Extensive experiments indicate that our metric can correctly judge the grammatical correctness of generated captions and the semantic consistency between captions and corresponding images.

关键词： Measurement Semantics Syntactics Feature extraction Training Pathology SPICE

来源：评论

学校读者我要写书评

暂无评论

Toward PTNET Network Topology Analysis and Routing Algorithm Design 6th

Toward PTNET Network Topology Analysis and Routing Algorithm...

引用

6th International Conference on data Science, ICDS 2019

作者： Han, Zhijie Zhang, Qingfang Du, Xiaoyu Guo, Kun He, Mingshu Institute of Data and Knowledge Engineering Henan University KaifengHenan475004 China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Network NanjingJiangsu210003 China School of Computer and Information Engineering Henan University KaifengHenan475004 China University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9789811528095

In recent years, data center network is used for transmission, storage and processing of big data, which plays an important role for applications in cloud computing and CDN distribution. Network topology and routing algorithm are its core research content and key technical issues. The traditional network topology is difficult to guarantee the quality of service in scalability and fault tolerance. The server-centric data center network topology can ensure the scale of the data center network by recursively increasing the number of network nodes and links. relative to the Dcell, BCube, and BCCC typical network topology, PTNet network as a typical representative of a new type of the server-centric data center network topology, which has more advantages in scalability, fault tolerance and so on. Multicast and broadcast in data center network have more application scenarios and use value. For example, the video conference online, multimedia remote education and other development are inseparable from the application and promotion of network multicast and broadcast. So it is necessary to research the routing algorithms of multicast and broadcast in the network. Based on the deep research of PTNet network, this paper analyzes and researches the network topology, multicast and broadcast routing algorithm. © Springer Nature Singapore Pte Ltd 2020.

关键词： Network topology

来源：评论

学校读者我要写书评

暂无评论

Deep latent low-rank fusion network for progressive subspace discovery 29

Deep latent low-rank fusion network for progressive subspace...

引用

29th International Joint Conference on Artificial Intelligence, IJCAI 2020

作者： Zhang, Zhao Ren, Jiahuan Zhang, Zheng Liu, Guangcan Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology China School of Computer Science and Technology Soochow University China Bio-Computing Research Center Harbin Institute of Technology Shenzhen China School of Information and Control Nanjing University of Information Science and Technology China

ISBN: (纸本)9780999241165

Low-rank representation is powerful for recovering and clustering the subspace structures, but it cannot obtain deep hierarchical information due to the single-layer mode. In this paper, we present a new and effective strategy to extend the single-layer latent low-rank models into multiple-layers, and propose a new and progressive Deep Latent Low-Rank Fusion Network (DLRF-Net) to uncover deep features and structures embedded in input data. The basic idea of DLRF-Net is to refine features progressively from the previous layers by fusing the subspaces in each layer, which can potentially obtain accurate features and subspaces for representation. To learn deep information, DLRF-Net inputs shallow features of the last layers into subsequent layers. Then, it recovers the deeper features and hierarchical information by congregating the projective subspaces and clustering subspaces respectively in each layer. Thus, one can learn hierarchical subspaces, remove noise and discover the underlying clean subspaces. Note that most existing latent low-rank coding models can be extended to multilayers using DLRF-Net. Extensive results show that our network can deliver enhanced performance over other related frameworks. © 2020 Inst. Sci. inf., Univ. Defence in Belgrade. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：