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

Conference on Empirical Methods in Natural Language processing, EMNLP 2010

作者： Kong, Fang Zhou, Guodong JiangSu Provincial Key Lab. for Computer Information Processing Technology School of Computer Science and Technology Soochow University China

ISBN: (纸本)1932432868

This paper proposes a unified framework for zero anaphora resolution, which can be divided into three sub-tasks: zero anaphor detection, anaphoricity determination and antecedent identification. In particular, all the three sub-tasks are addressed using tree kernel-based methods with appropriate syntactic parse tree structures. Experimental results on a Chinese zero anaphora corpus show that the proposed tree kernel-based methods significantly outperform the feature-based ones. This indicates the critical role of the structural information in zero anaphora resolution and the necessity of tree kernel-based methods in modeling such structural information. To our best knowledge, this is the first systematic work dealing with all the three sub-tasks in Chinese zero anaphora resolution via a unified framework. Moreover, we release a Chinese zero anaphora corpus of 100 documents, which adds a layer of annotation to the manually-parsed sentences in the Chinese Treebank (CTB) 6.0. © 2010 Association for Computational Linguistics.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Content-based image retrieval using fuzzy hamming distance

Content-based image retrieval using fuzzy hamming distance

引用

2007 8th International Conference on Electronic Measurement and Instruments, ICEMI

作者： Hu, Xuelong Yang, Li Zhang, Gensheng School of Information Engineering Yangzhou University Yangzhou 225009 China Jiangsu Province Key Lab. for Image Processing and Communication Nanjing University of Post and Telecommunications Nanjing 215006 China Jiangsu Province Key Lab. for Computer Information Processing Technology Suzhou University Suzhou 215006 China

ISBN: (纸本)1424411351

This paper addresses an effective issue of content-based image retrieval (CBIR) by presenting Fuzzy Hamming Distance (FHD). Firstly, the theory of FHD is introduced, which includes degree of difference and cardinality of the fuzzy set, and then follows defuzzification of FHD which is used as a fuzzy similarity measure. In the experiment, the image retrieval results show this method can be employed to capture implicitly some semantic contents of the image in addition to other features such as color, texture and shape. Finally, an implemented prototype system demonstrates a promising retrieval performance for a test database, as compared with FUZZYCLUB system. © 2007 IEEE.

关键词： Hamming distance

来源：评论

学校读者我要写书评

暂无评论

A new method for semi-automatic image annotation

A new method for semi-automatic image annotation

引用

2007 8th International Conference on Electronic Measurement and Instruments, ICEMI

作者： Xuelong, Hu Yuhui, Zhang Li, Yang School of Information Engineering Yangzhou University Yangzhou 225009 China Jiangsu Province Key Lab. of Image Processing and Communication Nanjing University of Post and Telecommunications Nanjing 215006 China Jiangsu Province Key Lab. of Computer Information Processing Technology Suzhou University Suzhou 215006 China

ISBN: (纸本)1424411351

Semantic-based image retrieval bridges the gap between visual features and human understanding of image in the field of image retrieval. Image annotation is one important technology of image retrieval based on the semantic. This paper proposed one method to realize semi-automatic image annotation with the tool Support Vector Machine (SVM). The image collection was divided into two parts, one for manual annotation and the other for testing. After being classified by SVM, the output was changed into a probability, and K-NN algorithm was applied to get the keywords for unlabeled images. The experiments show that the approach is feasible. © 2007 IEEE.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

DMFVAE:miRNA-disease associations prediction based on deep matrix factorization method with variational autoencoder

引用

Frontiers of computer Science 2024年第6期18卷 259-270页

作者： Pijing WEI Qianqian WANG Zhen GAO Ruifen CAO Chunhou ZHENG Information Materials and Intelligent Sensing Laboratory of Anhui Province Institutes of Physical Science and Information TechnologyAnhui UniversityHefei 230601China Key Lab of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and TechnologyAnhui UniversityHefei 230601China Key Lab of Intelligent Computing and Signal Processing of Ministry of Education School of Artificial IntelligenceAnhui UniversityHefei 230601China

MicroRNAs(miRNAs)are closely related to numerous complex human diseases,therefore,exploring miRNA-disease associations(MDAs)can help people gain a better understanding of complex disease *** increasing number of computational methods have been developed to predict ***,the sparsity of the MDAs may hinder the performance of many *** addition,many methods fail to capture the nonlinear relationships of miRNA-disease network and inadequately leverage the features of network and neighbor *** this study,we propose a deep matrix factorization model with variational autoencoder(DMFVAE)to predict potential *** first decomposes the original association matrix and the enhanced association matrix,in which the enhanced association matrix is enhanced by self-adjusting the nearest neighbor method,to obtain sparse vectors and dense vectors,***,the variational encoder is employed to obtain the nonlinear latent vectors of miRNA and disease for the sparse vectors,and meanwhile,node2vec is used to obtain the network structure embedding vectors of miRNA and disease for the dense ***,sample features are acquired by combining the latent vectors and network structure embedding vectors,and the final prediction is implemented by convolutional neural network with channel *** evaluate the performance of DMFVAE,we conduct five-fold cross validation on the HMDD v2.0 and HMDD v3.2 datasets and the results show that DMFVAE performs ***,case studies on lung neoplasms,colon neoplasms,and esophageal neoplasms confirm the ability of DMFVAE in identifying potential miRNAs for human diseases.

关键词： miRNA-disease association deep matrix factorization self-adjusted nearest neighbor variational encoder network structure

来源：评论

学校读者我要写书评

暂无评论

Wireless Service Prediction Algorithm in Mobile Social Environment 2

Wireless Service Prediction Algorithm in Mobile Social Envir...

引用

2017 IEEE 2nd International Conference on Big Data Analysis（ICBDA 2017）

作者： Hui Zhang Min Wang Jiangsu Key Lab of Wireless Communications Nanjing University of Posts and Telecommunications Provincial Key Laboratory for Computer Information Processing Technology Soochow University

ISBN: (纸本)9781509036202

First,according to characteristics of mobile social environment,by using optimization models based on similarity degree and interaction degree respectively,the optimal correlated users can be selected for analyzing two main factors of a target user's behaviors(***-term habits and shortterm influences);furthermore,an adaptive update strategy based on fuzzy theory is proposed to describe the importance of two factors in real time and quantitative ***,an improved Apriori theory is introduced to predict user service behaviors accurately;particularly,a new update mechanism for Apriori sample database is built to effectively integrate the samples of optimal correlated ***,simulation results verify the effectiveness of proposed algorithm.

关键词： mobile social environment user behavior prediction fuzzy theory adaptive update strategy improved Apriori theory

来源：评论

学校读者我要写书评

暂无评论

Genetic algorithm for pareto optimum-based route selection

引用

Journal of Systems Engineering and Electronics 2007年第2期18卷 360-368页

作者： Cui Xunxue Li Qin Tao Qing New Star Research Inst. of Applied Technology Hefei 230031 P. R. China Jiangsu Key Lab of Computer Information Processing Technology Soochow Univ. Suzhou 215006 P. R. China

A quality of service （QoS） or constraint-based routing selection needs to find a path subject to multiple constraints through a network. The problem of finding such a path is known as the multi-constrained path （MCP） problem, and has been proven to be NP-complete that cannot be exactly solved in a polynomial time. The NPC problem is converted into a multiobjective optimization problem with constraints to be solved with a genetic algorithm. Based on the Pareto optimum, a constrained routing computation method is proposed to generate a set of nondominated optimal routes with the genetic algorithm mechanism. The convergence and time complexity of the novel algorithm is analyzed. Experimental results show that multiobjective evolution is highly responsive and competent for the Pareto optimum-based route selection. When this method is applied to a MPLS and metropolitan-area network, it will be capable of optimizing the transmission performance.

关键词： Route selection Multiobjective optimization Pareto optimum Multi-constrained path Genetic algorithm.

来源：评论

学校读者我要写书评

暂无评论

IPv6-based dynamic quality of service control strategy for wireless network

引用

Journal of Networks 2010年第9期5卷 1098-1105页

作者： Chen, Zhifeng Zhu, Qiaoming Qian, Peide Chen, Fengyan Key Laboratory of Computer Information Processing Technology of Jiangsu Province School of Computer Science and Technology Soochow University Suzhou 215006 China Suzhou Institute of Trade and Commerce Suzhou 215009 China School of Foreign Language Soochow University Suzhou 215006 China

On the basis of the architecture for fast handover of hierarchical IPv6, a coordinated call admission control mechanism was presented, providing an end-to-end RSVP context transfer for real-time applications to overcome the weakness of the context transfer protocol which cannot meet the need of end-to-end QoS mechanisms because the contexts were only transferred between the previous and new access routers. The mechanism decreased the delay caused by re-initiate QoS signaling from scratch to reestablish QoS forwarding process, and minimized the handover service disruption. The signaling overhead and handover latencies could be reduced by adopting t he fast handover for hierarchical IPv6 architecture. The approach was compared with the re-initiating RSVP signaling to reestablish QoS states using network simulator ns2. The numerical results showed that the scheme has the less latency and packet loss than that of the re-initiating approach. © 2010 ACADEMY PUBLISHER.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Context-Sensitive Convolution Tree Kernel for Pronoun Resolution 3

Context-Sensitive Convolution Tree Kernel for Pronoun Resolu...

引用

3rd International Joint Conference on Natural Language processing, IJCNLP 2008

作者： Zhou, GuoDong Kong, Fang Zhu, Qiaoming JiangSu Provincial Key Lab for Computer Information Processing Technology School of Computer Science and Technology Soochow Univ. Suzhou215006 China

This paper proposes a context-sensitive convolution tree kernel for pronoun resolution. It resolves two critical problems in previous researches in two ways. First, given a parse tree and a pair of an anaphor and an antecedent candidate, it implements a dynamic-expansion scheme to automatically determine a proper tree span for pronoun resolution by taking predicate- and antecedent competitor-related information into consideration. Second, it applies a context-sensitive convolution tree kernel, which enumerates both context-free and context-sensitive sub-trees by considering their ancestor node paths as their contexts. Evaluation on the ACE 2003 corpus shows that our dynamic-expansion tree span scheme can well cover necessary structured information in the parse tree for pronoun resolution and the context- sensitive tree kernel much outperforms previous tree kernels. © 2008 IJCNLP 2008 - 3rd International Joint Conference on Natural Language processing, Proceedings of the Conference. All rights reserved.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

A parallel ACO approach based on one pheromone matrix

引用

Ant Colony Optimization and Swarm Intelligence - 5th International Workshop, ANTS 2006, Proceedings

作者： Qiang, Lv Xiaoyan, Xia Peide, Qian School of Computer Science and Technology Soochow Univeristy China Jiangsu Provincial Key Lab. of Computer Information Processing Technology Suzhou China

ISBN: (纸本)3540384820

This paper presents and implements an approach to parallel ACO algorithms. The principal idea is to make multiple ant colonies share and utilize only one pheromone matrix. We call it SHOP (SHaring One Pheromone matrix) approach. We apply this idea to the two currently best instances of ACO sequential algorithms (MMAS and ACS), and try to hybridize these two different ACO instances. We mainly describe how to design parallel ACS and MMAS based on SHOP. We present our computing results of applying our approach to solving 10 symmetric traveling salesman problems, and give comparisons with the relevant sequential versions under the fair computing environment. The experimental results indicate that SHOP-ACO algorithms perform overall better than the sequential ACO algorithms in both the computation time and solution quality. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Global optimization

来源：评论

学校读者我要写书评

暂无评论

Global learning of noun phrase anaphoricity in coreference resolution via label propagation

Global learning of noun phrase anaphoricity in coreference r...

引用

2009 Conference on Empirical Methods in Natural Language processing, EMNLP 2009, Held in Conjunction with ACL-IJCNLP 2009

作者： Zhou, Guo Dong Kong, Fang JiangSu Provincial Key Lab. for Computer Information Processing Technology School of Computer Science and Technology Soochow University Suzhou 215006 China

Knowledge of noun phrase anaphoricity might be profitably exploited in coreference resolution to bypass the resolution of non-anaphoric noun phrases. However, it is surprising to notice that recent attempts to incorporate automatically acquired anaphoricity information into coreference resolution have been somewhat disappointing. This paper employs a global learning method in determining the anaphoricity of noun phrases via a label propagation algorithm to improve learning-based coreference resolution. In particular, two kinds of kernels, i.e. the feature-based RBF kernel and the convolution tree kernel, are employed to compute the anaphoricity similarity between two noun phrases. Experiments on the ACE 2003 corpus demonstrate the effectiveness of our method in anaphoricity determination of noun phrases and its application in learning-based coreference resolution. © 2009 ACL and AFNLP.

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：