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

MIPPR 2005: Geospatial information, Data Mining, and Applications

作者： Yao, Min Jiang, Zhiwei Shen, Bin College of Computer Zhejiang University Hangzhou 310027 China Provincial Key Lab. for Computer Information Processing Technology in Jiangsu Suzhou University Suzhou 215006 China

Self-organization feature mapping (SOFM) networks have strong ability for self-learning and self-adaptive. According to the characteristics of human thought, this paper constructed a kind of combined criterion, which may be used to guide the learning of self-organization feature mapping network. Then this paper presents subsection algorithm, amalgamation algorithm and dynamical adaptive algorithm for SOFM networks so as to solve a kind of problems of classification rule mining. Finally, a practical example shows its flexibility and practicability.

关键词： Self organizing maps

来源：评论

学校读者我要写书评

暂无评论

Multi-level threshold image segmentation based on PSNR using artificial bee colony algorithm

引用

Research Journal of Applied Sciences, Engineering and technology 2012年第2期4卷 104-107页

作者： Yun-Fei, Cao Yong-Hao, Xiao Wei-Yu, Yu Yong-Chang, Chen School of Electronic and Information Engineering South China University of Technology Guangzhou China Provincial Key Laboratory for Computer Information Processing Technology Soochow University Suzhou Jiangsu 215006 China

Image segmentation is still a crucial problem in image processing. It hasn yet been solved very well. In this study, we propose a novel multi-level thresholding image segmentation method based on PSNR using artificial bee colony algorithm (ABCA). PSNR is considered as an objective function of ABCA. The multi-level thresholds (t*1, t*2 ,...., t*n-1, t*n) are those maximizing the PSNR. We compare entropy and PSNR in segmenting gray-level images. The experiments results demonstrate proposed method is effective and efficient. © Maxwell Scientific Organization, 2012.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Semi-Supervised Learning for Relation Extraction 3

Semi-Supervised Learning for Relation Extraction

引用

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

作者： Zhou, Guo Dong Li, Jun Hui Qian, Long Hua 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 semi-supervised learning method for relation extraction. Given a small amount of lab.led data and a large amount of unlab.led data, it first bootstraps a moderate number of weighted support vectors via SVM through a co-training procedure with random feature projection and then applies a lab.l propagation (LP) algorithm via the bootstrapped support vectors. Evaluation on the ACE RDC 2003 corpus shows that our method outperforms the normal LP algorithm via all the availab.e lab.led data without SVM bootstrapping. Moreover, our method can largely reduce the computational burden. This suggests that our proposed method can integrate the advantages of both SVM bootstrapping and lab.l propagation.s. © 2008 IJCNLP 2008 - 3rd International Joint Conference on Natural Language processing, Proceedings of the Conference. All rights reserved.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

Dependency tree-based anaphoricity determination for coreference resolution

Dependency tree-based anaphoricity determination for corefer...

引用

International Conference on Asian Language processing

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

ISBN: (纸本)9780769542881

This paper proposes a new scheme to determine the tree span structure for tree kernel-based anaphoricity determination in coreference resolution. Given a sentence and current mention, it gets all the dependencies, encodes the order of all the words, constructs the corresponding dependency tree and keeps the nodes and the paths related with current mention based on constituent dependencies, while removing the noisy information, eventually leading to a dynamical dependency tree (DDT). Evaluation on the ACE 2003 corpus shows that the DDT is effective for anaphoricity determination, and that applying our anaphoricity determination module in coreference resolution achieves the improvement of performance. © 2010 IEEE.

关键词： Anaphoricity determination Coreference resolution Dependency tree Coreference Resolution DDT DEPENDENCE

来源：评论

学校读者我要写书评

暂无评论

The scientific literature corpus for Chinese negation and uncertainty identification

The scientific literature corpus for Chinese negation and un...

引用

14th Workshop on Chinese Lexical Semantics, CLSW 2013

作者： Chen, Zhancheng Zou, Bowei Zhu, Qiaoming Li, Peifeng School of Computer Science and Technology Soochow University Jiangsu 215006 China Key Lab. of Computer Information Processing Technology of Jiangsu Province Suzhou Jiangsu 215006 China

ISBN: (纸本)9783642451843

Negative and uncertain expressions widely exist in natural language. Negation and uncertainty identification has become an important task in computational linguistics community. Lacking of corpus hinders the development of Chinese negation and uncertainty identification. This paper reports on a corpus annotation project for Chinese negation and uncertainty identification on scientific literature. We introduce several important aspects during our annotation, such as selection of raw text, framework of annotation, guidelines, data consistency and statistic data summarized from corpus. In this corpus, we annotate negation and uncertainty cues and their corresponding scopes. Statistic for corpus shows that there are a certain proportion of negative and uncertain expressions in Chinese scientific literature. Accordingly, this corpus is able to support the research of Chinese negation and uncertainty identification in the future. © 2013 Springer-Verlag.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Chinese zero anaphor detection: Rule-based approach

Chinese zero anaphor detection: Rule-based approach

引用

作者： Qin, Kaiwei Kong, Fang Li, Peifeng Zhu, Qiaoming School of Computer Science and Technology Soochow University Jiangsu 215006 China Key Lab. of Computer Information Processing Technology of Jiangsu Province Suzhou Jiangsu 215006 China

ISBN: (纸本)9783642256608

A rule-based approach for Chinese zero anaphor detection is proposed. Given a parse tree, the smallest IP sub-tree covering the current predicate is captured. Based on this IP sub-tree, some rules are proposed for detecting whether a Chinese zero anaphor exists. This paper also systematically evaluates the rule-based method on OntoNotes corpus. Using golden parse tree, our method achieves 82.45 in F-measure. And the F-measure is 63.84 using automatic parser. The experiment results show that our method is very effective on Chinese zero anaphor detection. © 2011 Springer-Verlag Berlin Heidelberg.

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

Semi-supervised learning for semantic relation classification using stratified sampling strategy

Semi-supervised learning for semantic relation classificatio...

引用

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

作者： Qian, Longhua Zhou, Guodong Kong, Fang Zhu, Qiaoming Jiangsu Provincial Key Lab for Computer Information Processing Technology School of Computer Science and Technology Soochow University 1 Shizi Street Suzhou 215006 China

This paper presents a new approach to selecting the initial seed set using stratified sampling strategy in bootstrapping-based semi-supervised learning for semantic relation classification. First, the training data is partitioned into several strata according to relation types/subtypes, then relation instances are randomly sampled from each stratum to form the initial seed set. We also investigate different augmentation strategies in iteratively adding reliable instances to the lab.led set, and find that the bootstrapping procedure may stop at a reasonable point to significantly decrease the training time without degrading too much in performance. Experiments on the ACE RDC 2003 and 2004 corpora show the stratified sampling strategy contributes more than the bootstrapping procedure itself. This suggests that a proper sampling strategy is critical in semi-supervised learning. © 2009 ACL and AFNLP.

关键词： Supervised learning

来源：评论

学校读者我要写书评

暂无评论

Research of secure intranet/internet access platform based on ontology

引用

Journal of Networks 2009年第10期4卷 1009-1016页

作者： Shen, Shigen Ye, Lihua Yue, Guangxue Yu, Fei College of Mathematics and Information Engineering Jiaxing University Jiaxing China College of Computer and Communication Hunan University Changsha China Department of Computer Science and Technology Huaihua University Huaihua China Jiangsu Provincial Key Laboratory of Computer Information Processing Technology Suzhou China

Faced with the general trend of centralization of information, the biggest challenge to enterprise is how to ensure that all fixed computers and different mobile devices anywhere can access securely and quickly enterprise's businesses. To solve this problem, an Ontology-based Secure intranet/Internet Access Platform (OSAP) is presented. Ontology has been applied to the field of software resources sharing. Software resource ontology is defined for building the foundation of Software Resource Ontology Sharing Model (SROSM) and the OSAP. The OSAP framework is presented by semantic modeling based on SROSM for providing users with better and higher QOS in sharing software resources. The OSAP is designed with OSAP Portal, Connection Module, Session Management Module, Security Module, RDP Module, and Bitmap Caching Module. The design ideas and functionalities of all modules are introduced. Based on the open Remote Desktop Protocol (RDP), the OSAP prototype is realized and key technologies including client display, data compression and security are described. To guarantee data transmission security and avoid access problem due to the firewall obstructing port 3389, the SSL protocol is employed to encapsulate RDP data packages between clients and OSAP as the RDP is used between OSAP and Terminal Services servers. Experimental results demonstrate that the OSAP has better performance involving response time, network usage, RAM usage and CPU usage. © 2009 ACADEMY PUBLISHER.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

An access control model in lager-scale P2P file sharing systems

An access control model in lager-scale P2P file sharing syst...

引用

7th International Conference on Computational Science (ICCS 2007)

作者： Yue Guang-xue Yu Fei Chen Li-ping Chen Yi-jun College of Information Engineering Jiaxing University 314000 China Department of Computer Science and Technology Huaihua University 418000 China State Key Lab. for Novel Software Technology Nanjing University 210093 China Jiangsu Provincial Key Laboratory of Computer Information Processing Technology Suzhou University 2150063 China

ISBN: (纸本)9783540725893

In lager-scale P2P file sharing systems, peers often must interact with unknown or unfamiliar peers without the benefit of trusted third parties or authorities to mediate the interactions. The decentralized and anonymous characteristics of P2P environments make the task of controlling access to sharing information more difficult. In this paper, we identify access control requirements and propose a trust based access control framework for P2P file-sharing systems. The model integrates aspects of trust and recommendation, fairness based participation schemes and access control schemes.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：