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

Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing, ACL-IJCNLP 2021

作者： Xu, Zenan Guo, Daya Tang, Duyu Su, Qinliang Shou, Linjun Gong, Ming Zhong, Wanjun Quan, Xiaojun Jiang, Daxin Duan, Nan School of Computer Science and Engineering Sun Yat-Sen University Guangzhou China Microsoft Research Asia Beijing China Microsoft Search Technology Center Asia Beijing China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China Key Lab. of Machine Intelligence and Advanced Computing Ministry of Education China

ISBN: (纸本)9781954085527

We study the problem of leveraging the syntactic structure of text to enhance pre-trained models such as BERT and RoBERTa. Existing methods utilize syntax of text either in the pre-training stage or in the fine-tuning stage, so that they suffer from discrepancy between the two stages. Such a problem would lead to the necessity of having human-annotated syntactic information, which limits the application of existing methods to broader scenarios. To address this, we present a model that utilizes the syntax of text in both pre-training and fine-tuning stages. Our model is based on Transformer with a syntax-aware attention layer that considers the dependency tree of the text. We further introduce a new pre-training task of predicting the syntactic distance among tokens in the dependency tree. We evaluate the model on three downstream tasks, including relation classification, entity typing, and question answering. Results show that our model achieves state-of-the-art performance on six public benchmark datasets. We have two major findings. First, we demonstrate that infusing automatically produced syntax of text improves pre-trained models. Second, global syntactic distances among tokens bring larger performance gains compared to local head relations between contiguous tokens. © 2021 Association for Computational Linguistics

关键词： Syntactics

来源：评论

学校读者我要写书评

暂无评论

Structure preserving low-rank representation for semi-supervised face recognition

Structure preserving low-rank representation for semi-superv...

引用

20th International Conference on Neural Information Processing, ICONIP 2013

作者： Peng, Yong Wang, Suhang Wang, Shen Lu, Bao-Liang Center for Brain-Like Computing and Machine Intelligence Department of Computer Science and Engineering Shanghai Jiao Tong Unviersity Shanghai 200240 China Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI 48109 United States MOE-Microsoft Key Lab. for Intelligent Computing and Intelligent Systems Shanghai Jiao Tong Unviersity Shanghai 200240 China

ISBN: (纸本)9783642420412

Constructing an informative and discriminative graph plays an important role in the graph based semi-supervised learning methods. Among these graph construction methods, low-rank representation based graph, which calculates the edge weights of both lab.led and unlab.led samples as the low-rank representation (LRR) coefficients, has shown excellent performance in semi-supervised learning. In this paper, we additionally impose twofold constraints (local affinity and distant repulsion) on the LRR graph. The improved model, termed structure preserving LRR (SPLRR), can preserve the local geometrical structure but without distorting the distant repulsion property. Experiments are taken on three widely used face data sets to investigate the performance of SPLRR and the results show that it is superior to some state-of-the-art semi-supervised graphs. © Springer-Verlag 2013.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

Marginalized denoising autoencoder via graph regularization for domain adaptation

Marginalized denoising autoencoder via graph regularization ...

引用

20th International Conference on Neural Information Processing, ICONIP 2013

作者： Peng, Yong Wang, Shen Lu, Bao-Liang Center for Brain-Like Computing and Machine Intelligence Department of Computer Science and Engineering Shanghai Jiao Tong Unviersity Shanghai 200240 China Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI 48109 United States MoE-Microsoft Key Lab. for Intelligent Computing and Intelligent Systems Shanghai Jiao Tong Unviersity Shanghai 200240 China

ISBN: (纸本)9783642420412

Domain adaptation, which aims to learn domain-invariant features for sentiment classification, has received increasing attention. The underlying rationality of domain adaptation is that the involved domains share some common latent factors. Recently neural network based on Stacked Denoising Auto-Encoders (SDA) and its marginalized version (mSDA) have shown promising results on learning domain-invariant features. To explicitly preserve the intrinsic structure of data, this paper proposes a marginalized Denoising Autoencoders via graph Regularization (GmSDA) in which the autoencoder based framework can learn more robust features with the help of newly incorporated graph regularization. The learned representations are fed into the sentiment classifiers and experiments show that the GmSDA can effectively improve the classification accuracy when comparing with some state-of-the-art models on the cropped Amazon benchmark data set. © Springer-Verlag 2013.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

EEG-based fatigue classification by using parallel hidden Markov model and pattern classifier combination

EEG-based fatigue classification by using parallel hidden Ma...

引用

19th International Conference on Neural Information Processing, ICONIP 2012

作者： Sun, Hui Lu, Bao-Liang Center for Brain-Like Computing and Machine Intelligence Department of Computer Science and Engineering Shanghai Jiao Tong University 800 Dongchuan Road Shanghai 200240 China MOE-Microsoft Key Lab. for Intelligent Computing and Intelligent Systems Shanghai Jiao Tong University 800 Dongchuan Road Shanghai 200240 China Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University 800 Dongchuan Road Shanghai 200240 China MOE Key Laboratory of Systems Biomedicine Shanghai Jiao Tong University 800 Dongchuan Road Shanghai 200240 China

ISBN: (纸本)9783642344770

Fatigue is the most important reason leading to traffic accidents. In order to ensure traffic safety, various methods based on electroencephalogram (EEG) are proposed. But most of them, either regression or classification, are focused on the relationship between feature space and observation values, so the changing patterns of features are ignored or discarded. In this paper, we propose a new fatigue classification method by using parallel hidden-Markov-model and pattern classifier combination techniques, where each model represents a particular fatigue-high-related feature. In the experiment, subjects are asked to accomplish some simple tasks, and both their fatigue states and their EEG signals are recorded simultaneously. Experimental results indicate that the mean error rate obtained by using our new method are 11.15% for classifying 3 states and 16.91% for classifying 4 states, respectively, while the existing approach can only reach 16.45% and 23.55% under the same condition. © 2012 Springer-Verlag.

关键词： Electroencephalography

来源：评论

学校读者我要写书评

暂无评论

Online vigilance analysis combining video and electrooculography features

Online vigilance analysis combining video and electrooculogr...

引用

19th International Conference on Neural Information Processing, ICONIP 2012

作者： Du, Ruo-Fei Liu, Ren-Jie Wu, Tian-Xiang Lu, Bao-Liang Center for Brain-like Computing and Machine Intelligence Department of Computer Science and Engineering Shanghai Jiao Tong University 800 Dongchuan Road Shanghai 200240 China MOE-Microsoft Key Lab. for Intelligent Computing and Intelligent Systems Shanghai Jiao Tong University 800 Dongchuan Road Shanghai 200240 China Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University 800 Dongchuan Road Shanghai 200240 China MOE Key Laboratory of Systems Biomedicine Shanghai Jiao Tong University 800 Dongchuan Road Shanghai 200240 China

ISBN: (纸本)9783642344992

In this paper, we propose a novel system to analyze vigilance level combining both video and Electrooculography (EOG) features. For one thing, the video features extracted from an infrared camera include percentage of closure (PERCLOS) and eye blinks, slow eye movement (SEM), rapid eye movement (REM) are also extracted from EOG signals. For another, other features like yawn frequency, body posture and face orientation are extracted from the video by using Active Shape Model (ASM). The results of our experiments indicate that our approach outperforms the existing approaches based on either video or EOG merely. In addition, the prediction offered by our model is in close proximity to the actual error rate of the subject. We firmly believe that this method can be widely applied to prevent accidents like fatigued driving in the future. © 2012 Springer-Verlag.

关键词： Eye movements

来源：评论

学校读者我要写书评

暂无评论

A Parallel Implementation of Multiobjective Particle Swarm Optimization Algorithm Based on Decomposition

A Parallel Implementation of Multiobjective Particle Swarm O...

引用

IEEE Symposium Series on Computational intelligence

作者： Jin-Zhou Li Wei-Neng Chen Jun Zhang Zhi-hui Zhan Sun Yat-sen University Collaborative Innovation Center of High Performance Computing Sun Yat-sen University Key Lab. Machine Intelligence and Advanced Computing Ministry of Education

ISBN: (纸本)9781479975617

Multiobjective particle swarm optimization based on decomposition (MOPSO/D) is an effective algorithm for multiobjective optimization problems (MOPs). This paper proposes a parallel version of MOPSO/D algorithm using both message passing interface (MPI) and OpenMP, which is abbreviated as MO-MOPSO/D. It adopts an island model and divides the whole population into several subspecies. Based on the hybrid of distributed and shared-memory programming models, the proposed algorithm can fully use the processing power of today's multicore processors and even a cluster. The experimental results show that MO-MOPSO/D can achieve speedups of 2× on a personal computer equipped with a dual-core four-thread CPU. In terms of the quality of solutions, it can perform similarly to the serial MOPSO/D but greatly outperform NSGA-II. An additional experiment is done on a cluster, and the results show the speedup is not obvious for small-scale MOPs and it is more suitable for solving highly complex problems.

关键词： Particle swarm optimization decomposition Speeding MOP Mops processing power efficient algorithm Personal computers message passing subspecies Parallel Lines Distribute degradation

来源：评论

学校读者我要写书评

暂无评论

A dynamic competitive swarm optimizer based-on entropy for large scale optimization

A dynamic competitive swarm optimizer based-on entropy for l...

引用

International Workshop on advanced Computational intelligence (IWACI)

作者： Wen-Xiao Zhang Wei-Neng Chen Jun Zhang School of Data and Computer Science Sun Yat-sen University Guangzhou China Key Lab. of Machine Intelligence and Advanced Computing Ministry of Education Guangzhou China

In this paper, a dynamic competitive swarm optimizer (DCSO) based on population entropy is proposed. The new algorithm is derived from the competitive swarm optimizer (CSO). The new algorithm uses population entropy to make a quantitative description about the diversity of population, and to divide the population into two sub-groups dynamically. During the early stage of the execution process, to speed up convergence of the algorithm, the sub-group with better fitness will have a small size, and worse large sub-group will learn from small one. During the late stage of the execution process, to keep the diversity of the population, the sub-group with better fitness will have a large size, and small worse sub-group will learn from large group. The proposed DCSO is evaluated on CEC'08 benchmark functions on large scale global optimization. The simulation results of the example indicate that the new algorithm has better and faster convergence speed than CSO.

关键词： Sociology Statistics Entropy Optimization Convergence Heuristic algorithms Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

Interest Tree Based Information Dissemination via Vehicular Named Data Networking

Interest Tree Based Information Dissemination via Vehicular ...

引用

International Conference on Computer Communications and Networks (ICCCN)

作者： Xiaokun Li Siyang Wang Weigang Wu Xu Chen Bin Xiao Ministry of Education Sun Yet-Sen University Guangdong Province Key Lab. of Big Data Analysis and Processing Key Lab. of Machine Intelligence and Advanced Computing Guangzhou Guangdong China Department of Computing Hong Kong Polytechnic University Hong Kong China

Named Data Networking (NDN) is a promising technology for content centric networks, and it is suitable for vehicular networks since no IP architecture is required. Quite a number of solutions have been proposed for vehicular NDN (V- NDN), but high communication cost due to frequent topology changes caused by high mobility of vehicles is still a challenge to be addressed. In this paper, we study how to disseminate traffic information to vehicles via V-NDN. Different from existing works, we consider navigation route based data interests, i.e., a vehicle is concerned about the traffic information along road segments planned to take. According to such a data interest scenario, we propose a tree based data interest structure and associated maintenance operations to merge identical data interests due to overlapping navigation routes among different vehicles. With the tree based data interest management, the number of interest packets can be significantly reduced. Then, we propose trigger based mechanisms for data interest packet re-sending and forwarding, which can avoid unnecessary interest packets re-sending. With our design, traffic information can be disseminated to interested nodes with high success ratio and low communication cost simultaneously. Simulations via SUMO and ndnSIM confirm such advantages of our work.

关键词： Roads Navigation Vehicular ad hoc networks Network topology Data communication Prototypes Wireless communication

来源：评论

学校读者我要写书评

暂无评论

Tournament selection based artificial bee colony algorithm with elitist strategy

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial intelligence and Lecture Notes in Bioinformatics) 2014年 8916卷 387-396页

作者： Zhang, Meng-Dan Zhan, Zhi-Hui Li, Jing-Jing Zhang, Jun Department of Computer Science Sun Yat-sen University 510275 China Key Lab. Machine Intelligence and Advanced Computing Ministry of Education China Engineering Research Center of Supercomputing Engineering Software MOE China Key Lab. Software Technology Education Department of Guangdong Province China School of Computer Science South China Normal University China

Artificial bee colony (ABC) algorithm is a novel heuristic algorithm inspired from the intelligent behavior of honey bee swarm. ABC algorithm has a good performance on solving optimization problems of multivariable functions and has been applied in many fields. However, traditional ABC algorithm chooses solutions on the onlooker stage with roulette wheel selection (RWS) strategy which has several disadvantages. Firstly, RWS is suitable for maximization optimization problem. The fitness value has to be converted when solving minimization optimization problem. This makes RWS difficult to be generally used in real-world applications. Secondly, RWS has no any parameter that can control the selection pressure. Therefore, RWS is not easy to adapt to various optimization problems. This paper proposes a tournament selection based ABC (TSABC) algorithm to avoid these disadvantages of RWS based ABC. Moreover, this paper proposes an elitist strategy that can be applied to traditional ABC, TSABC, and any other ABC variants, so as to avoid the phenomenon that ABC algorithm may abandon the globally best solution in the scout stage. We compare the performance of traditional ABC and TSABC on a set of benchmark functions. The experiment results show that TSABC is more flexible and can be efficiently adapted to solve various optimization problems by controlling the selection pressure. © Springer International Publishing Switzerland 2014.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

Converting continuous-space language models into N-gram language models for statistical machine translation

Converting continuous-space language models into N-gram lang...

引用

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

作者： Wang, Rui Utiyama, Masao Goto, Isao Sumita, Eiichro Zhao, Hai Lu, Bao-Liang Center for Brain-Like Computing and Machine Intelligence Department of Computer Science and Engineering Shanghai Jiao Tong Unviersity Shanghai200240 China Multilingual Translation Laboratory MASTAR Project National Institute of Information and Communications Technology 3-5 Hikaridai Keihanna Science City Kyoto619-0289 Japan MOE-Microsoft Key Lab. for Intelligent Computing and Intelligent Systems Shanghai Jiao Tong Unviersity Shanghai200240 China

ISBN: (纸本)9781937284978

Neural network language models, or continuous-space language models (CSLMs), have been shown to improve the performance of statistical machine translation (SMT) when they are used for reranking n-best translations. However, CSLMs have not been used in the first pass decoding of SMT, because using CSLMs in decoding takes a lot of time. In contrast, we propose a method for converting CSLMs into back-off n-gram language models (BNLMs) so that we can use converted CSLMs in decoding. We show that they outperform the original BNLMs and are comparable with the traditional use of CSLMs in reranking. © 2013 Association for Computational Linguistics.

关键词： Decoding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：