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

International Joint Conference on Neural Networks

作者： Yifei Lu Yanghui Rao Jun Yang Jian Yin Guangdong Key Laboratory of Big Data Analysis and Processing Sun Yat-sen University Guangzhou China

Sentiment classification is a key task of natural language processing and a long-term goal of artificial intelligence. In this paper, we propose a new approach, which combines the Attention Mechanism, Bidirectional Long Short-Term Memory Network, and Lexicons for sentiment classification. Experiments on the Movie Review and Stanford Sentiment Treebank datasets demonstrate that the performance of our approach is better than other approaches.

关键词： Neural networks Sentiment analysis Standards Task analysis Logic gates big data Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Adaptive Teacher-and-Student Model for Heterogeneous Domain Adaptation

Adaptive Teacher-and-Student Model for Heterogeneous Domain ...

引用

IEEE International Conference on data Mining (ICDM)

作者： Yunyun Wang Xuzhang Chen Songcan Chen Hui Xue College of Computer Science Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts & Telecommunications Nanjing China College of Computer Science & Technology/AI MIIT Key Laboratory of Pattern Analysis and Machine Intelligence Nanjing University of Aeronautics & Astronautics Nanjing China College of Computer Science and Engineering Southeast University Nanjing China

In heterogeneous domain adaptation (HDA), since the feature spaces of the source and target domains are different, knowledge transfer from the source to the target domain is really challenging. How to align the different feature spaces and then adaptively transfer the related knowledge is critical for HDA. In this paper, we develop an adaptive teacher-and-student model for heterogeneous domain adaptation (AtsHDA). In AtsHDA, the source domain as a teacher and the target domain as a student are aligned or co-adapted to each other first, so that their correlation can be maximized. Then the target domain adaptively learns from the source domain. Specifically, there is a balance between the learning by the target domain itself and the instruction from the source domain. That is, when the guidance from the source domain is helpful for learning, the learning of target classifier emphasizes the instruction of source knowledge, and considers its own knowledge more, otherwise. Further, an ensemble method is designed to decide such a balance. Finally, empirical results show that AtsHDA can achieve competitive results compared with the state-of-arts.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Non-SPF routing algorithm based on ordered semi-group preference algebra

引用

The Journal of China Universities of Posts and Telecommunications 2017年第6期24卷 14-23页

作者： Zhang Yongtang Fan Bo Department of Computer Science and Technology Guangdong Neusoft Institute Foshan 528225 China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou 510006 China

Layer 2 network technology is extending beyond its traditional local area implementation and finding wider acceptance in provider＇s metropolitan area networks and large-scale cloud data center networks. This is mainly due to its plug-and-play capability and native mobility support. Many efforts have been put to increase the bisection bandwidth in layer 2 network, which has been constrained by the spanning tree protocol （STP） that layer 2 network uses for preventing looping. The recent trend is to incorporate layer 3＇s routing approach into layer 2 network so that multiple paths can be used for forwarding traffic between any source-destination （S-D） node pair. Equal cost multipath （ECMP） is one such example. However, ECMP may still be limited in generating multiple paths due to its shortest path （lowest cost） requirement. In this paper, we consider a non-shortest-path routing approach, called equal preference multipath （EPMP） based on ordered semi group theory, which can generate more paths than ECMP. In EPMP routing, all the paths with different traditionally-defined costs, such as hops, bandwidth, etc., can be determined equally now and thus they become equal candidate paths. By the comparative tests with ECMP, EPMP routing not only generates more paths, provides 15% higher bisection bandwidth, but also identifies bottleneck links in a hierarchical network when different traffic patterns are applied EPMP is more flexible in controlling the number and length of multipath generation. Simulation results indicate the effectiveness of the proposed algorithm. It is a good reference for non-blocking running of big datacenter networks.

关键词： non-SPF routing algorithm algebraic routing equal preference multipath datacenter networks

来源：评论

学校读者我要写书评

暂无评论

Research on the Brain-inspired Cross-modal Neural Cognitive Computing Framework

arXiv

引用

arXiv 2018年

作者： Liu, Yang Key Laboratory of Big Data Analysis and Processing of Henan province Intelligent Technology and Application Engineering Research Centre of Henan province College of Computer Science and Information Engineering Henan University Kaifeng475004 China

To address modeling problems of brain-inspired intelligence, this thesis is focused on researching in the semantic-oriented framework design for multimedia and multimodal information. The Multimedia Neural Cognitive Computing (MNCC) model was designed based on the nervous mechanism and cognitive architecture. Furthermore, the semantic-oriented hierarchical Cross-modal Neural Cognitive Computing (CNCC) framework was proposed based on MNCC model, and formal description and analysis for CNCC framework was given. It would effectively improve the performance of semantic processing for multimedia and cross-modal information, and has far-reaching significance for exploration and realization brain-inspired computing. Copyright © 2018, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Controllability analysis of transcriptional regulatory networks for Saccharomyces cerevisiae 44

Controllability analysis of transcriptional regulatory netwo...

引用

44th Annual Conference of the IEEE Industrial Electronics Society, IECON 2018

作者： Liu, Suling Wang, Pei Xu, Qiong Chen, Aimin Lü, Jinhu School of Mathematics and Statistics Henan University Kaifeng China School of Mathematics and Statistics Institute of Applied Mathematics Laboratory of Data Analysis Technology Henan University Kaifeng China School of Mathematics and Statistics Institute of Applied Mathematics Henan University Kaifeng China School of Automation Science and Electrical Engineering State Key Laboratory of Software Development Environment Beijing Advanced Innovation Center for Big Data Brain Machine Intelligence Beihang University Beijing China

ISBN: (纸本)9781509066841

Structural controllability of complex networks has been a research focus in recent years. However, few works considered the structural controllability of biological networks, especially for dynamic biological networks. In this paper, structural controllability of one static and five dynamic transcriptional regulatory networks (TRNs) for Saccharomyces cerevisiae (S. cerevisiae) have been investigated. The five dynamic networks included two endogenous and three exogenous ones. We clarified the controllability properties of these networks, as well as explored the differences among different types of networks. Our results revealed that the structural properties of different types of networks are significantly different. We found that the TRNs are rather difficult to be fully controlled. However, the dynamic TRNs were relatively easier to be controlled than the static one, and one needs relatively more external inputs to control the exogenous TRNs than the endogenous ones. Based on the structural controllability analysis of subnetworks with the same sizes, as well as randomly perturbed networks by preserving degree distributions, we further illustrated that the structural controllability of the six networks may be mainly dominated by their degree distributions. Our investigations clarify the control properties of TRNs in S. cerevisiae, it provides some insights on real-world control of biological networks. © 2018 IEEE.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Bank Macro Safety Status Research Based on Robust MEWMA Process Control Method

Bank Macro Safety Status Research Based on Robust MEWMA Proc...

引用

2018 5th International Conference on Education,Management,Arts,Economics and Social Science(ICEMAESS 2018)

作者： Xie Xianfen Wang Binhui Gu Wanrong Zhang Ziye Jinan University Guangdong Key Laboratory of Big Data Analysis and Processing South China Agricultural University South China University of Technology

The issue of bank safety has always been one of the key contents of financial and economic ***,this paper establishes the bank macro safety status index system,obtain robust covariance matrix based on the Fast-MCD *** this basis,construct robust process control model of the bank macro safety status,analyze bank macro safety's antecedent status,consistent status and the lagging *** research shows that,the unsafe period of bank's macro safety status is mainly concentrated in the middle of 2005,end of 2008 to early 2009,end of 2011 to early 2012,which is basically consistent with China's actual financial *** addition,the antecedent status index is about 3 months ahead of the consistent index,and the lagging status index is roughly 6.3 months behind the consistent status *** results can be used to predict the macro safety status of the bank and take the corresponding policy measures in advance.

关键词： Bank Macro Safety Status Robust Statistics MEWMA Process Control

来源：评论

学校读者我要写书评

暂无评论

Type-Aware Question Answering over Knowledge Base with Attention-Based Tree-Structured Neural Networks

引用

Journal of Computer Science & Technology 2017年第4期32卷 805-813页

作者： Jun Yin Wayne Xin Zhao Xiao-Ming Li School of Electronic Engineering and Computer Science Peking University Beijing 100871 China School of Information Renmin University of China Beijing 100872 China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou 510006 China

Question answering (QA) over knowledge base (KB) aims to provide a structured answer from a knowledge base to a natural language question. In this task, a key step is how to represent and understand the natural language query. In this paper, we propose to use tree-structured neural networks constructed based on the constituency tree to model natural language queries. We identify an interesting observation in the constituency tree: different constituents have their own semantic characteristics and might be suitable to solve different subtasks in a QA system. Based on this point, we incorporate the type information as an auxiliary supervision signal to improve the QA performance. We call our approach type-aware QA. We jointly characterize both the answer and its answer type in a unified neural network model with the attention mechanism. Instead of simply using the root representation, we represent the query by combining the representations of different constituents using task-specific attention weights. Extensive experiments on public datasets have demonstrated the effectiveness of our proposed model. More specially, the learned attention weights are quite useful in understanding the query. The produced representations for intermediate nodes can be used for analyzing the effectiveness of components in a QA system.

关键词： question answering deep neural network knowledge base

来源：评论

学校读者我要写书评

暂无评论

Question generation from SQL queries improves neural semantic parsing

arXiv

引用

arXiv 2018年

作者： Guo, Daya Sun, Yibo Tang, Duyu Duan, Nan Yin, Jian Chi, Hong Cao, James Chen, Peng Zhou, Ming School of Data and Computer Science Sun Yat-sen University Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China Microsoft Research Harbin Institute of Technology

We study how to learn a semantic parser of state-of-the-art accuracy with less supervised training data. We conduct our study on WikiSQL, the largest hand-annotated semantic parsing dataset to date. First, we demonstrate that question generation is an effective method that empowers us to learn a state-ofthe-art neural network based semantic parser with thirty percent of the supervised training data. Second, we show that applying question generation to the full supervised training data further improves the state-of-the-art model. In addition, we observe that there is a logarithmic relationship between the accuracy of a semantic parser and the amount of training data. Copyright © 2018, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Crowd-Guided Entity Matching with Consolidated Textual data

引用

Journal of Computer Science & Technology 2017年第5期32卷 858-876页

作者： Zhi-Xu Li Qiang Yang An Liu Guan-Feng Liu Jia Zhu Jia-Jie Xu Kai Zheng Min Zhang School of Computer Science and Technology Soochow University Suzhou 215006 China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou 510006 China School of Computer Science and Technology Soochow University Suzhou 215006 China School of Computer South China Normal University Guangzhou 510631 China School of Computer Science and Technology Soochow University Suzhou 215006 China Beijing Key Laboratory of Big Data Management and Analysis Methods Beijing 100872 China

Entity matching (EM) identifies records referring to the same entity within or across databases. Existing methods using structured attribute values (such as digital, date or short string values) may fail when the structured information is not enough to reflect the matching relationships between records. Nowadays more and more databases may have some unstructured textual attribute containing extra consolidated textual information (CText) of the record, but seldom work has been done on using the CText for EM. Conventional string similarity metrics such as edit distance or bag-of-words are unsuitable for measuring the similarities between CText since there are hundreds or thousands of words with each piece of CText, while existing topic models either cannot work well since there are no obvious gaps between topics in CText. In this paper, we propose a novel cooccurrence-based topic model to identify various sub-topics from each piece of CText, and then measure the similarity between CText on the multiple sub-topic dimensions. To avoid ignoring some hidden important sub-topics, we let the crowd help us decide weights of different sub-topics in doing EM. Our empirical study on two real-world datasets based on Amzon Mechanical Turk Crowdsourcing Platform shows that our method outperforms the state-of-the-art EM methods and Text Understanding models.

关键词： entity matching consolidated textual data crowdsourcing

来源：评论

学校读者我要写书评

暂无评论

Dialog-to-action: conversational question answering over a large-scale knowledge base 18

Dialog-to-action: conversational question answering over a l...

引用

Proceedings of the 32nd International Conference on Neural Information processing Systems

作者： Daya Guo Duyu Tang Nan Duan Ming Zhou Jian Yin The School of Data and Computer Science Sun Yat-sen University Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou P.R. China Microsoft Research Asia Beijing China

We present an approach to map utterances in conversation to logical forms, which will be executed on a large-scale knowledge base. To handle enormous ellipsis phenomena in conversation, we introduce dialog memory management to manipulate historical entities, predicates, and logical forms when inferring the logical form of current utterances. Dialog memory management is embodied in a generative model, in which a logical form is interpreted in a top-down manner following a small and flexible grammar. We learn the model from denotations without explicit annotation of logical forms, and evaluate it on a large-scale dataset consisting of 200K dialogs over 12.8M entities. Results verify the benefits of modeling dialog memory, and show that our semantic parsing-based approach outperforms a memory network based encoder-decoder model by a huge margin.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：