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

Nested relation extraction with iterative neural network

Frontiers of Computer Science 2021年第3期15卷 109-122页

作者： Yixuan CAO Dian CHEN Zhengqi XU Hongwei LI Ping LUO Key Lab of Intelligent Information Processing of Chinese Academy of Sciences(CAS) Institute of Computing TechnologyCASBeijing 100190China University of Chinese Academy of Sciences Beijing 100049China

Most existing researches on relation extraction focus on binary flat relations like Bomln relation between a Person and a *** a large portion of objective facts de-scribed in natural language are complex,especially in professional documents in fields such as finance and biomedicine that require precise *** example,“the GDP of the United States in 2018 grew 2.9%compared with 2017”describes a growth rate relation between two other relations about the economic index,which is beyond the expressive power of binary flat ***,we propose the nested relation extraction problem and formulate it as a directed acyclic graph(DAG)structure extraction ***,we propose a solution using the Iterative Neural Network which extracts relations layer by *** proposed solution achieves 78.98 and 97.89 FI scores on two nested relation extraction tasks,namely semantic cause-and-efFect relation extraction and formula ***,we observe that nested relations are usually expressed in long sentences where entities are mentioned repetitively,which makes the annotation difficult and ***,we extend our model to incorporate a mention-insensitive mode that only requires annotations of relations on entity concepts(instead of exact mentions)while preserving most of its *** mention-insensitive model performs better than the mention sensitive model when the random level in mention selection is higher than 0.3.

关键词： nested relation extraction mention insensitive relation iterative neural network

来源：评论

学校读者我要写书评

暂无评论

A Regularized Super Resolution Algorithm for Generalized Gaussian Noise

引用

Journal of Donghua University(English Edition) 2010年第1期27卷 25-35页

作者：陈文方向忠刘立峰蒋伟丁大为乔艳涛 Institute of Image Communication and Information Processing Shanghai Jiaotong University Computer and Information Department Shanghai University of Electric Power Key Lab oratory of Intelligent Computing & Signal Processing Ministry of EducationAnhui University

In this paper,an iterative regularized super resolution (SR) algorithm considering non-Gaussian noise is *** on the assumption of a generalized Gaussian distribution for the contaminating noise,an lp norm is adopted to measure the data fidelity term in the cost *** the meantime,a regularization functional defined in terms of the desired high resolution (HR) image is employed,which allows for the simultaneous determination of its value and the partly reconstructed image at each iteration *** convergence is thoroughly *** results show the effectiveness of the proposed algorithm as well as its superiority to conventional SR methods.

关键词： super resolution generalized p-Gaussian distribution regularization parameter

来源：评论

学校读者我要写书评

暂无评论

Robust low-rank tensor factorization by cyclic weighted median

引用

Science China(information Sciences) 2015年第5期58卷 145-155页

作者： MENG DeYu ZHANG Biao XU ZongBen ZHANG Lei GAO ChenQiang Institute for Information and System Sciences and Ministry of Education Key Lab for Intelligent Networks and Network Security Xi'an Jiaotong University Department of Computing Hong Kong Polytechnic University Chongqing Key Laboratory of Signal and Information Processing Chongqing University of Posts and Telecommunications

Low-rank tensor factorization(LRTF) provides a useful mathematical tool to reveal and analyze multi-factor structures underlying data in a wide range of practical applications. One challenging issue in LRTF is how to recover a low-rank higher-order representation of the given high dimensional data in the presence of outliers and missing entries, i.e., the so-called robust LRTF problem. The L1-norm LRTF is a popular strategy for robust LRTF due to its intrinsic robustness to heavy-tailed noises and outliers. However, few L1-norm LRTF algorithms have been developed due to its non-convexity and non-smoothness, as well as the high order structure of data. In this paper we propose a novel cyclic weighted median(CWM) method to solve the L1-norm LRTF problem. The main idea is to recursively optimize each coordinate involved in the L1-norm LRTF problem with all the others fixed. Each of these single-scalar-parameter sub-problems is convex and can be easily solved by weighted median filter, and thus an effective algorithm can be readily constructed to tackle the original complex problem. Our extensive experiments on synthetic data and real face data demonstrate that the proposed method performs more robust than previous methods in the presence of outliers and/or missing entries.

关键词： tensor factorization low-rank weighted median filter tensorface

来源：评论

学校读者我要写书评

暂无评论

Localization Optimization Algorithm of Maximum Likelihood Estimation Based on Received Signal Strength 9

Localization Optimization Algorithm of Maximum Likelihood Es...

引用

2017 9th IEEE International Conference on Communication Software and Networks (ICCSN 2017)

作者： Jun Zhu Qiang Chen Jingjing Zhang Key Lab of Intelligent Computing and Signal Processing Ministry of Education School of Electronics and Information Engineering Anhui University

ISBN: (纸本)9781509038237;9781509038220

In this paper, we propose a method to improve localization algorithm of maximum likelihood estimation;the localization scheme relies on the distance threshold. In order to suppress effectively the effects of received signal strength error to node localization precision. This paper presents an indoor localization algorithm based on received signal strength to select anchor nodes. Compared with the traditional localization algorithm, this scenario not only improve the localization accuracy, but also reduce the calculation complexity of nodes. The simulation results show that the average error of the proposed method is less than 0.15 m. Moreover, when there are a large number of anchor nodes, the computational complexity is effectively reduced. Verification result verifies the effectiveness and reliability of the algorithm.

关键词： localization received signal strength(RSS) maximum likelihood estimation(MLE) least squares threshold

来源：评论

学校读者我要写书评

暂无评论

Speaker Recognition Based on the Improved Double-Threshold Endpoint Algorithm and Multistage Vector Quantization 9

Speaker Recognition Based on the Improved Double-Threshold E...

引用

2017 9th IEEE International Conference on Communication Software and Networks (ICCSN 2017)

作者： Jun Zhu Jingjing Zhang Qiang Chen Peipei Tu Key Lab of Intelligent Computing and Signal Processing Ministry of Education School of Electronics and Information Engineering Anhui University

ISBN: (纸本)9781509038237;9781509038220

The traditional double-threshold endpoint detection method has the phenomenon of missing detection. Therefore, the speech recognition(SR) system based on vector quantization(VQ) in this paper proposes an improved algorithm for this phenomenon, which effectively avoids the problem of missing detection. Then, Mel Frequency Cepstral Coefficients(MFCC) is used to extract the characteristic parameters of the speech signal, and the multistage vector quantization is used to quantify the characteristic parameters. Experimental results show that, the proposed algorithm improves the recognition rate of the text-independent speaker recognition system by 8.7%, and it also confirms that the longer the training speech is, the higher the recognition rate will be.

关键词： the multistage vector quantization MFCC double-threshold endpoint detection method missing detection characteristic parameters

来源：评论

学校读者我要写书评

暂无评论

Semantic-driven management and search for resources in research community

Semantic-driven management and search for resources in resea...

引用

2006 2nd International Conference on Semantics Knowledge and Grid, SKG

作者： Junsheng, Zhang Zhixian, Yan Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences

ISBN: (纸本)0769532055

In recent years, semantic search has become one hot motivation of the semantic web. In this paper, we propose a semantic-based resource management and search architecture and its implementation in research community, including most of the research relevant resources. We have built two authoring tools respectively for concepts and instances. With the authoring tools, semantic search portal is provided, which has three different interfaces, respectively for retrieval of concept, instance and semantic relationship. Compared with the traditional search methods, semantic search methodology not only gives us more interesting and satisfying search results, whose precision is higher than those of traditional ones only based on keywords, but also displays the results in a more structural and semantic way. © 2006 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Merging complex networks

Merging complex networks

引用

7th International Conference on Semantics, Knowledge, and Grids, SKG 2011

作者： Sun, Xiaoping Zhuge, Hai Key Lab of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China

ISBN: (纸本)9780769545158

In the cyber-physical society, networks are constructed for information transportation. Among them, power law networks with the scale free property are extensively found in self-organized systems. The dynamicity of the cyber-physical society drives large-scale networks keeping interacting and evolving. Several networks can be integrated or merged into one network during the evolving process of the whole cyber-physical society either because they share the same nodes or because one network is trying to connect to the other. A natural question is that in what way two or more networks will merge with each other so that their previous scale-free properties still hold. In this paper, we conducted a set of simulation experiments to study the effects of different merging processes on the degree distribution of merged networks. The result can be used to understand the merging process of complex networks in the cyber-physical society and also can be used to design an integration strategy for multiple networks. © 2011 IEEE.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Novel Retinex algorithm by interpolation and adaptive noise suppression

引用

Journal of Central South University 2012年第9期19卷 2541-2547页

作者：李武劲古博黄江涛王明辉 College of Computer Science Sichuan University College of Computer and Information Engineering Guangxi Teachers Education University Key Laboratory of Scientific Computing and Intelligent Information Processing of Guangxi Province (Guangxi University)

In order to improve image quality, a novel Retinex algorithm for image enhancement was presented. Different from conventional algorithms, it was based on certain defined points containing the illumination information in the intensity image to estimate the illumination. After locating the points, the whole illumination image was computed by an interpolation technique. When attempting to recover the reflectance image, an adaptive method which can be considered as an optimization problem was employed to suppress noise in dark environments and keep details in other areas. For color images, it was taken in the band of each channel separately. Experimental results demonstrate that the proposed algorithm is superior to the traditional Retinex algorithms in image entropy.

关键词： Retinex algorithm illumination estimation interpolation adaptive noise suppression

来源：评论

学校读者我要写书评

暂无评论

Research on automatic construction of the dynamic Chinese porn feature knowledge system

Research on automatic construction of the dynamic Chinese po...

引用

2010 International Conference on Computer Design and Applications, ICCDA 2010

作者： Peno, Yu-Zhong Yuan, Chang-An Qin, Xiao Key Lab. of Scientific Computing and Intelligent Information Processing in Universities of Guangxi School of Computer and Information Engineering Guangxi Teacher Education University Nanning 530001 China

ISBN: (纸本)9781424471638

As the Web continues to grow, the pornographic texts in varied forms run rampant on Internet, despite repeated prohibitionsm. It severely does harms to the development of people's mental health and the stability of sociality. In this paper, We propose a novel and effective feature weight-value calculating method named FEFP for such objectionable information, and design a scheme to auto-build system of porn feature knowledge which can be dynamically updated. The experiments are designed and conducted to compare the FEFP with four famous existing methods of Web page feature extraction. Experimental results show that the proposed approach has both higher feature coverage and lower redundancy rates for either porn on conventional forms or porn whose form has been changed. It is very good and very suitable for processing the harmful information in current form which is volatile and increasingly hidden. © 2010 IEEE.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Discrete clothoid spline surfaces on open meshes

引用

International Journal of Image and Graphics 2001年第4期1卷 575-589页

作者： Li, Guiqing Li, Xianmin Li, Hua State Key Lab of CADandCG Zhejiang University Hangzhou310027 China Intelligent Information Processing Institute of Computing Technology Chinese Academic Sciences Beijing100080 China

By introducing a discrete Frenet frame, this paper first proposes 3D discrete clothoid splines to extend the planar discrete clothoid splines of Schneider and Kobbelt. On the basis of 3D discrete clothoid spline curves, discrete clothoid spline surfaces for arbitrary meshes are defined as a generalization of their closed discrete clothoid spline surfaces. Moreover, a discrete mean curvature normal operator instead of the conic surface fitting method is employed to compute curvature values. This induces a new iteration algorithm for generating the discrete clothoid spline surfaces. Since the curvature at a vertex is an area average over a region around this vertex and no linear system needs to be settled, the algorithm works more steadily and efficiently. Besides being directly used to produce fair mesh surfaces, the approach can also be employed to smooth control nets of spline surfaces. © 2001 World scientific Publishing Company.

关键词： Linear systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：