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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Assessment of rotamer library for protein structure prediction

Assessment of rotamer library for protein structure predicti...

引用

2nd International Conference on information Science and Engineering, ICISE2010

作者： Huang, Xu Lü, Qiang Miao, Dajun Qian, Peide School of Computer Science and Technology Soochow University Suzhou 215006 China Jiangsu Provincial Key Lab for Information Processing Technologies Suzhou 215006 China

ISBN: (纸本)9781424480968

Side chain packing is a crucial step for protein structure prediction. And the quality of rotamer library has important implications in side chain packing. This paper assess dunbrack rotamer libraries and simple sampling rotamer libraries for certain structures by comparing the native structure and solutions come from rotamer libraries. Results of eleven hard targets in CASP9 show that the best solution is near to the native structure. Otherwise, there is no native structure in protein structure *** compare the best solutions which choosing by lower RMSD and energy, it shows that the best solution which choosing by lower energy is near to the best solution which choosing by low RMSD. So, in the case of unknown native structure, the energy guided choosing is necessary, but it must adopt some other method such as clustering to select the best solution. © 2010 IEEE.

关键词： Chains

来源：评论

学校读者我要写书评

暂无评论

An unsupervised discriminative random vector functional link network for efficient data clustering 4

An unsupervised discriminative random vector functional link...

引用

4th International Conference on Pattern Recognition and Artificial Intelligence, PRAI 2021

作者： Zhang, Yikai Zhu, Qi Peng, Yong Kong, Wanzeng School of Computer Science and Technology Hangzhou Dianzi University Hangzhou310018 China Provincial Key Lab. for Computer Information Processing Technology Soochow University Suzhou215123 China

ISBN: (纸本)9781665413220

Random Vector Functional Link (RVFL) is a single hidden layer feed forward network which can be trained with non-iterative learning methods. Concretely, the input weights and hidden biases in RVFL can be randomly generated and then the calculation of the output weights can be reduced to solve a regularized least squares regression formula. Though RVFL network obtained promising performance in diverse applications, most of its current variants work mainly for supervised tasks such as classification and regression while less effort was made to utilize the unlab.led data. In this paper, we propose an unsupervised RVFL model by simultaneously considering the local manifold structure and the global discriminative information of data. The newly formulated unsupervised discriminative RVFL (UDRVFL) model can be efficiently solved by handling an eigen-value decomposition operation. We conduct experiments by comparing UDRVFL with several state-of-the-arts on representative benchmark data sets and the results demonstrate that it has very competitive performance in data clustering. © 2021 IEEE.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Improving nominal SRL in Chinese language with verbal SRL information and automatic predicate recognition

Improving nominal SRL in Chinese language with verbal SRL in...

引用

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

作者： Li, Junhui Zhou, Guodong Zhao, Hai Zhu, Qiaoming Qian, Peide Jiangsu Provincial Key Lab. for Computer Information Processing Technologies School of Computer Science and Technology Soochow University Suzhou 215006 China Department of Chinese Translation and Linguistics City University of HongKong Hong Kong

This paper explores Chinese semantic role lab.ling (SRL) for nominal predicates. Besides those widely used features in verbal SRL, various nominal SRL-specific features are first included. Then, we improve the performance of nominal SRL by integrating useful features derived from a state-of-the-art verbal SRL system. Finally, we address the issue of automatic predicate recognition, which is essential for a nominal SRL system. Evaluation on Chinese NomBank shows that our research in integrating various features derived from verbal SRL significantly improves the performance. It also shows that our nominal SRL system much outperforms the state-of-the-art ones. © 2009 ACL and AFNLP.

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

Verifiable Fully Homomorphic Encryption scheme

Verifiable Fully Homomorphic Encryption scheme

引用

2012 2nd International Conference on Consumer Electronics, Communications and Networks, CECNet 2012

作者： Jin, Fangyuan Zhu, Yanqin Luo, Xizhao Department of Computer Science and Technology Soochow University Suzhou China Jiangsu Provincial Key Laboratory for Computer Information Processing Technology Soochow University Suzhou China

We construct a general Verifiable Fully Homomorphic Encryption, using the existed Fully Homomorphic Encryption schemes. The main appeal of the scheme is the verifiability of Evaluate function. Its security and other p... 详细信息

ISBN: (纸本)9781457714153

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Dependency tree-based SRL with proper pruning and extensive feature engineering

Dependency tree-based SRL with proper pruning and extensive ...

引用

12th Conference on Computational Natural Language Learning, CoNLL 2008

作者： Wang, Hongling Wang, Honglin Zhou, Guodong Zhu, Qiaoming Jiang Su Provincial Key Lab for Computer Information Processing Technology School of Computer Science and Technology Soochow University Suzhou 215006 China

ISBN: (纸本)1905593481

This paper proposes a dependency tree-based SRL system with proper pruning and extensive feature engineering. Official evaluation on the CoNLL 2008 shared task shows that our system achieves 76.19 in lab.led macro F1 for the overall task, 84.56 in lab.led attachment score for syntactic dependencies, and 67.12 in lab.led F1 for semantic dependencies on combined test set, using the standalone MaltParser. Besides, this paper also presents our unofficial system by 1) applying a new effective pruning algorithm;2) including additional features;and 3) adopting a better dependency parser, MSTParser. Unofficial evaluation on the shared task shows that our system achieves 82.53 in lab.led macro F1, 86.39 in lab.led attachment score, and 78.64 in lab.led F1, using MSTParser on combined test set. This suggests that proper pruning and extensive feature engineering contributes much in dependency tree-based SRL. © 2008.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Approaches to image retrieval using fuzzy set theory

Approaches to image retrieval using fuzzy set theory

引用

2008 IEEE International Conference Neural Networks and Signal processing, ICNNSP

作者： Li, Yang Xuelong, Hu Jun, Pan School of Information Engineering Yangzhou University Yangzhou Jiangsu 225009 China Jiangsu Province Key Lab. for Image Processing and Image Communication Nanjing University of Posts and Communications Nanjing Jiangsu 210003 China Jiangsu Prov. Key Lab. for Computer Information Processing Technology Suzhou University Suzhou Jiangsu 215006 China

ISBN: (纸本)9781424423118

This paper mainly presents two approaches for image retrieval. There is some faintness in color locating in quantification boundary when image color is quantized. The membership function in fuzzy set theory can describe the fuzzy transition preferably. In this paper, the membership function in HSI color space is adopted to solve the problem above. At the same time, spatial information is integrated with color feature to describe the image content more truly. Due to the importance of texture feature, gray concurrence matrix is extracted. In the second part of this paper, retrieval scheme combining four image feature descriptors is presented, and then follows Fuzzy Hamming Distance (FHD) which is used as a fuzzy similarity measure. We have performed an experiment on a 1000 images database and our results show higher retrieval accuracy. © 2008 IEEE.

关键词： Fuzzy sets

来源：评论

学校读者我要写书评

暂无评论

A content-based classified hierarchical vector quantization algorithm for volume compression

Journal of Software

引用

Journal of Software 2011年第2期6卷 322-330页

作者： Zhao, Li-Ping Yue, Guang-Xue Xiao, De-Gui Zhou, Xu Yu, Xiang Yu, Fei School of Mathematics and Information Engineering Jiaxing University Jiaxing Zhejiang China School of Computer and Communication Engineering Hunan University Changsha Hunan China Department of Computer Science and Technology Huaihua University Huaihua China Jiangsu Provincial Key Laboratory for Computer Information Processing Technology Soochow University Soochow China

An improved volumetric compression algorithm is presented in this paper. Histogram technique is used for analyzing the trait of volume data. The volume data is then partitioned into volume bricks which will be classified into two groups, the blocks with meaningless information as one group (also called empty blocks), and those with meaningful information as the other group (also called object blocks). An efficient hierarchical VQ is applied to compress object blocks while for empty blocks, nothing is saved. Compare with analogous Volume Compression algorithm, experimental results demonstrate the proposed algorithm not only can improve the compression rate significantly on the premise of the good quality of reconstruction image, but also can obtain fast decoding speed. © 2011 ACADEMY PUBLISHER.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

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.

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：