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

2005 International Conference on Neural Networks and Brain(ICNN&B’05)

作者： Tian Yan Liu Bin Li Tao Department of electronic and information engineering Huazhong University of Science & Technology School of computer science and technology Huazhong University of Science & Technology Key Laboratory of Education Ministry for Image Processing and Intelligent Control Huazhong University of Science & Technology

ISBN: (纸本)0780394224

Image interpolation has been widely used and studied in the fields of image *** the different complexities along the different directions,a novel image interpolation method based on gradient analysis is presented in this ***,for each point that need to be interpolated,it's the gradient values along the horizontal and vertical directions are estimated ***,different interpolation methods are carried out along these two directions according to the gradient values,that is a higher order interpolation method is applied if the gradient value is greater than certain threshold;otherwise,a lower order interpolation method is *** method gives an attention to the precision and complexity of interpolation procedure. Experimental results show that the proposed method is feasible and promising.

关键词： Gradient image interpolation root mean square error

来源：评论

学校读者我要写书评

暂无评论

Distributed english text chunking using multi-agent based architecture

Distributed english text chunking using multi-agent based ar...

引用

4th Mexican International Conference on Artificial Intelligence, MICAI 2005

作者： Liang, Ying-Hong Zhao, Tie-Jun MOE-MS Key Laboratory of Natural Language Processing and Speech Harbin Institute of Technology Harbin 150001 School of Information and Computer Engineering North East Forestry University Harbin 150080

ISBN: (纸本)3540298967

The traditional English text chunking approach identifies phrases by using only one model and phrases with the same types of features. It has been shown that the limitations of using only one model are that: the use of the same types of features is not suitable for all phrases, and data sparseness may also result. In this paper, the Distributed Multi-Agent based architecture approach is proposed and applied in the identification of English phrases. This strategy put phrases into agents according to their sensitive features and identifies different phrases in parallel, where the main features are: one, easy and quick communication between phrases;two, avoidance of data sparseness. By applying and testing the approach on the public training and test corpus, the F score for arbitrary phrases identification using Distributed Multi-Agent strategy achieves 95.70% compared to the previous best F score of 94.17%. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

A multi-agent strategy for Chinese text chunking

A multi-agent strategy for Chinese text chunking

引用

International Conference on Machine Learning and Cybernetics, ICMLC 2005

作者： Liang, Ying-Hong Zhao, Tie-Jun Mao, Lei MOE-MS Key Laboratory of Natural Language Processing and Speech Harbin Institute of Technology Harbin 150001 School of Information and Computer Engineering North East Forestry University Harbin 150040

ISBN: (纸本)078039092X

Traditional Chinese text chunking approach is to identify phrases using only one model and same features. It is shown that one model couldn't comprise each phrase's characteristics, and same features are not suitable to all phrases, data sparseness also appears. Multi-agent strategy uses several model and sensitive features of each phrase to identify different phrases. This paper describes the Multi-agent strategy applied in the identification of Chinese phrases whose main features are: 1) easy and quick communication between phrases;2) avoidance of data sparseness. Through testing on Chinese Penn Treebank, F score of Chinese text chunking using Multi-agent strategy achieves to 95.82%, which is higher than the best result that has been reported. © 2005 IEEE.

关键词： Pattern recognition

来源：评论

学校读者我要写书评

暂无评论

High precision English base noun phrase identification based on "waterfall" model

High precision English base noun phrase identification based...

引用

International Conference on Machine Learning and Cybernetics, ICMLC 2005

作者： Liang, Ying-Hong Zhao, Tie-Jun Yu, Hao Yao, Jian-Min MOE-MS Key Laboratory of Natural Language Processing and Speech Harbin Institute of Technology Harbin 150001 School of Information and Computer Engineering North East Forestry University Harbin 150040

ISBN: (纸本)078039092X

Based on classical model that used by software exploitation in the subject of Software Engineering - waterfall model, a high precision model for English noun phrase identification is presented. In this model, three important features (interior structure, context information and boundary character) in base noun phrase identification are orderly used, and the relative method (the rule method, the transfer- based and error-driven method, and the boundary statistic method) are used from top to bottom. Thus the precision of base noun phrase identification improved steadily. The "waterfall" model combined the rule method and the statistical method so as to make them complement each other. The precision of base noun phrase identification achieves 98.10% and the F score is 95.25%. Compared to other method, our method achieves the highest precision and F score. © 2005 IEEE.

关键词： information analysis

来源：评论

学校读者我要写书评

暂无评论

Feature selection for high dimensional face image using self-organizing maps

引用

9th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, PAKDD 2005

作者： Tan, Xiaoyang Chen, Songcan Zhou, Zhi-Hua Zhang, Fuyan National Laboratory for Novel Software Technology Nanjing University Nanjing 210093 China Department of Computer Science and Engineering Nanjing University of Aeronautics and Astronautics Nanjing 210016 China Shanghai Key Laboratory of Intelligent Information Processing Fudan University Shanghai 200433 China

ISBN: (纸本)3540260765

While feature selection is very difficult for high dimensional, unstructured data such as face image, it may be much easier to do if the data can be faithfully transformed into lower dimensional space. In this paper, a new method is proposed to transform the high dimensional face images into low-dimensional SOM topological space, and then identify important local features of face images for face recognition automatically using simple statistics computed from the class distribution of the face image data. The effectiveness of the proposed method are demonstrated by the experiments on AR face databases, which reveal that up to 80% local features can be pruned with only slightly loss of the classification accuracy. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Image processing

来源：评论

学校读者我要写书评

暂无评论

The Applications of Generalized Computing In Knowledge Management

The Applications of Generalized Computing In Knowledge Manag...

引用

2005年公共管理国际会议

作者： YAO Min SHEN Bin ZHANG Yan-gu College of Computer Zhejiang University Provincial Key Lab. for Computer Information processing Technology in Jiangsu Suzhou University School of Computer Wenzhou Normal College

Generalized computing is a new kind of intelligent computing systems, which combines symbolic intelligence and computational intelligence (including neural computing, fuzzy computing and evolutional computing) together. By introducing generalized computing into knowledge management, this paper presents a kind of knowledge decision-making model, and a kind of control model of enterprise knowledge flow.

关键词： Generalized computing, Knowledge management, Enterprise management

来源：评论

学校读者我要写书评

暂无评论

TRANSLATING ONTOLOGIES TO DEFAULT LOGIC

TRANSLATING ONTOLOGIES TO DEFAULT LOGIC

引用

IFIP TC12 WG12.5-Second IFIP Conference on Artificial Intelligence Applications and Innovations(AIAI2005)

作者： Yu Sun Yuefei Sui Key Laboratory of Intelligent Information Processing Institute of Computing TechnologyChinese Academy of Sciences Institute of Computer Science and Information Technology Yunnan Normal University

The translation of inheritance nets to default logic has been discussed by Etherington[9],Touretzky[10],*** and inheritance nets are similar in some aspects and based on methods of translating inheritance nets to default logic,a translation of ontologies to default logic with a priority order on defaults is ***,properties of an ontology and the revision of ontologies can be studied in terms of default *** are assumed to be trees under the subsumption relation between concepts and have deduction rules to infer what are not explicitly *** statements in ontologies are translated to facts of default theories of the ontologies and the default inheritance of properties are represented by normal defaults with a priority order on them due to the intuition that subclasses overriding *** an ontology with a tree structure,it is consistent if and only if the default theory of the ontology has a unique extension.

关键词： ontology default logic priority order extension

来源：评论

学校读者我要写书评

暂无评论

A multicast routing algorithm with multiple trees

引用

Journal of Systems Engineering and Electronics 2005年第2期16卷 426-432页

作者： Cui Xunxue 1,2 , Gao Wei3 & Fang Hongyu41. New Star Research Institute of Applied technology, Hefei 230031, P. R. China 2. jiangsu key laboratory of computer information processing technology,Soochow University, Suzhou 215006, P. R. China 3. Department of Electronic Engineering and information Science,University of Science and technology of China, Hefei 230027, P. R. China 4. School of Electronic Science and technology, Anhui University, Hefei 230039, P. R. China New Star Research Institute of Applied Technology Hefei 230031 P. R. China 2. Jiangsu Key Laboratory of Computer Information Processing Technology Soochow University Suzhou 215006 P. R. China Department of Electronic Engineering and Information Science University of Science and Technology of China Hefei 230027 P. R. China School of Electronic Science and Technology Anhui University Hefei 230039 P. R. China

Quality of service (QoS) multicast routing has continued to be a very important research topic in the Internet. A method of multicast routing is proposed to simultaneously optimize several parameters based on multiobjective genetic algorithm, after the related work is reviewed. The contribution lies on that the selection process of such routing is treated with multiobjective optimization. Different quality criterions in IP network are taken into account for multicast communications. A set of routing trees is generated to approximate the Pareto front of multicast problem. Multiple trees can be selected from the final set of nondominated solutions, and applied to obtain a good overall link cost and balance traffic distribution according to some simulation results.

关键词： multicast routing quality of service multiobjective optimization genetic algorithms.

来源：评论

学校读者我要写书评

暂无评论

Investigating manifold learning algorithms based on magnification factors and principal spread directions

引用

Jisuanji Xuebao/Chinese Journal of computers 2005年第12期28卷 2000-2009页

作者： He, Li Zhang, Jun-Ping Zhou, Zhi-Hua Shanghai Key Laboratory of Intelligent Information Processing Department of Computer Science and Engineering Fudan University Shanghai 200433 China Key Laboratory of Complex Systems and Intelligence Science Chinese Academy of Sciences Shanghai 200433 China Department of Computer Science and Engineering School of Mathematical Sciences Fudan University Shanghai 200433 China National Laboratory for Novel Software Technology Nanjing University Nanjing 210093 China

As a new unsupervised learning technique, manifold learning has captured the attention of many researchers in the field of machine learning and cognitive sciences. The major algorithms include Isometric mapping (ISOMAP) and Locally Linear Embedding (LLE). The approaches can be used for discovering the intrinsic dimensions of nonlinear high-dimensional data effectively and aim researchers to analyze the data better. How to quantitatively analyze the relationship between the intrinsic dimensions and the observation space, however, has fewer reports. And thus further works in manifold learning may have suffered some difficulties. The paper focuses on two kinds of manifold learning algorithms (ISOMAP, LLE), and discusses magnification factors and principal spread directions from the observation space to the intrinsic low-dimensional space. Also the corresponding algorithm is proposed. Experiments show the effectiveness and advantages of the research.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Approximate information retrieval for heterogeneity ontologies

Approximate information retrieval for heterogeneity ontologi...

引用

2005 International Conference on Cyberworlds, CW 2005

作者： Kang, Dazhou Xu, Baowen Lu, Jianjiang Li, keyue Chu, William C. Chen, Hanwu Department of Computer Science and Engineering Southeast University Nanjing 210096 China Jiangsu Institute of Software Quality Nanjing 210096 China State Key Laboratory of Software Wuhan University Wuhan 430072 China PLA University of Science and Technology Nanjing 210007 China Department of Computer Science and Information Engineering TungHai University Taiwan Taiwan Department of Computer Science and Engineering Southeast University 210096 Nanjing China

ISBN: (纸本)0769523781

Ontology-based information retrieval is precise and effective but suffers from the problem of ontology heterogeneity. This paper focuses on the approximate information retrieval approach to solve the heterogeneity problem of both common ontologies as well as fuzzy ontologies on the semantic web. Approximate information retrieval needs to find approximations of concepts. However, current methods cannot find the best approximations of concepts for common ontologies, and there is still no published work for fuzzy ontologies. This paper firstly proposes a method of approximate information retrieval between common ontologies. It defines multielement least upper bounds and multielement greatest lower bounds, and then simplifies the multielement bounds to remove redundancy. It provides effective algorithms to find the simplified multielement bounds, and get the best approximations of concepts from the bounds. Then for the fuzzy ontologies, the paper defines cut concepts to transform fuzzy concepts into common concepts, and then applies the proposed method for approximate information retrieval between fuzzy ontologies. The improved algorithms for fuzzy ontologies are given to make the method more feasible and effective. © 2005 IEEE.

关键词： information retrieval

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：