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

International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Shifei Ding Zhongzhi Shi Shixiong Xia Fengxiang Jin College of Computer Science and Technology China University of Mining and Technology Xuzhou China Key Laboratory of Intelligent Information Processing Chinese Academy of Sciences Institute for Computing Technology Beijing China College of Geoinformation Science and Engineering Shandong University of Science and Technology Qingdao China

Fuzzy information measures play an important part in measuring the similarity degree between two pattern vectors in fuzzy circumstance. In this paper, two new fuzzy information measures are set up. Firstly, the classical similarity measures, such as dissimilarity measure (DM) and similarity measure (SM) are studied, an axiom theory about fuzzy entropy is surveyed, and all kinds of definitions of fuzzy entropy are discussed. Secondly, based on the idea of Shannon information entropy, two concepts of fuzzy joint entropy and fuzzy conditional entropy are proposed and the basic properties of them are given and proved. At last, two new measures, fuzzy absolute information measure (FAIM) and fuzzy relative information measure (FRIM), are set up, which can be used to measure the similarity degree between a fuzzy set A and a fuzzy set B. So, It provides a new research approach for studies on pattern similarity measure.

关键词： Fuzzy sets Pattern recognition Delta modulation Samarium information entropy Random variables Probability distribution Educational institutions Mutual information Computer science

来源：评论

学校读者我要写书评

暂无评论

Progress and Challenge of Artificial Intelligence

引用

Journal of Computer Science & Technology 2006年第5期21卷 810-822页

作者：史忠植郑南宁 Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 P.R. China The Laboratory of Artificial Intelligence and Robotics Xi'an Jiaotong University Xi'an 710049 P.R. China

Artificial Intelligence （AI） is generally considered to be a subfield of computer science, that is concerned to attempt simulation, extension and expansion of human intelligence. Artificial intelligence has enjoyed tremendous success over the last fifty years. In this paper we only focus on visual perception, granular computing, agent computing, semantic grid. Human-level intelligence is the long-term goal of artificial intelligence. We should do joint research on basic theory and technology of intelligence by brain science, cognitive science, artificial intelligence and others. A new cross discipline intelligence science is undergoing a rapid development. Future challenges are given in final section.

关键词： artificial intelligence visual perception machine learning agent computing semantic web intelligence science

来源：评论

学校读者我要写书评

暂无评论

MFC: A method of Co-referent relation acquisition from large-scale chinese corpora

引用

3rd International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2006

作者： Guogang, Tian Cungen, Cao Lei, Liu Haitao, Wang Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China Graduate University Chinese Academy of Sciences Beijing 100080 China

ISBN: (纸本)3540459162

This paper proposes a multi-feature constrained method (MFC) to acquire co-referent relations from large-scale Chinese corpora. The MFC has two phases: candidate relations extraction and verification. The extraction phase uses distribution distance, pattern homogeneity and coordination distribution features of co-referent target words to extract candidate relations from Chinese corpora. In the verification phase, we define an ontology for co-referent token words, and build a relation graph for all candidate relations. Both the ontology and the graph are integrated to generate individual, joint and reinforced strategies to verify candidate relations. Comprehensive experiments have shown that the MFC is practical, and can also be extended to acquire other types of relations. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Data acquisition

来源：评论

学校读者我要写书评

暂无评论

Divergence-based supervised information feature compression algorithm

Divergence-based supervised information feature compression ...

引用

3rd International Symposium on Neural Networks, ISNN 2006 - Advances in Neural Networks

作者： Ding, Shi-Fei Shi, Zhong-Zhi College of Information Science and Engineering Shandong Agricultural University Taian 271018 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China

ISBN: (纸本)354034439X

In this paper, a novel supervised information feature compression algorithm based on divergence is set up. Firstly, according to the information theory, the concept and its properties of the divergence, i.e. average separability information (ASI) is studied, and a concept of symmetry average separability information (SASI) is proposed, and proved that the SASI here is a kind of distance measure, i.e. the SASI satisfies three requests of distance axiomatization, which can be used to measure the difference degree of a two-class problem. Secondly, based on the SASI, a compression theorem is given, and can be used to design information feature compression algorithm. Based on these discussions, we design a novel supervised information feature compression algorithm based on the SASI, At last, the experimental results demonstrate that the algorithm here is valid and reliable. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Algorithms

来源：评论

学校读者我要写书评

暂无评论

Default Description Logics with Reversing Inference Rules

Default Description Logics with Reversing Inference Rules

引用

Firth IEEE International Conference on Cognitive Informatics(第五届认知信息国际会议)

作者： Yu Sun Yuefei Sui Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Acade Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Acade

ISBN: (纸本)9781424404759

Default description logics are extensions of description logics by Reiter's default logic in order to represent and reason about non-monotonic knowledge. A default says that if its prerequisite is provable, and the negation of its justification is not provable, then its consequence is provable. As a method of using defaults in a reverse way, reversing inference rules are introduced to default description logics. For a default, its reversing inference rule says if the negation of the consequence of the default is provable, then the negation of the prerequisite or the negation of the justification of the default is provable. Then a default description theory is extended to an extended default description theory with reversing inference rules and the definition of extensions of the extended default description theory is given. A default description theory can infer statements by using its defaults. However, an extended default description theory can infer statements not only by using its defaults, but by using its reversing inference rules. The relations between default description theories and their extended default description theories are discussed. For a default description theory without extensions, its extended default description theory may have extensions.

关键词： Description logics Default logics Reversing inference rules Extensions.

来源：评论

学校读者我要写书评

暂无评论

A framework for automated test generation in intelligent tutoring systems 1

引用

1st International Conference on Knowledge Science, Engineering and Management, KSEM 2006

作者： Suqin, Tang Cungen, Cao College of Computer Science and Information Technology Guangxi Normal University Guilin 541004 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China

ISBN: (数字)9783540370352

ISBN: (纸本)3540370331

intelligent tutoring systems have being extensively researched, and are viewed as cost-effective alternatives to traditional education. However, it has been long recognized that development of such systems is labor-intensive and time-consuming, and that a certain degree of automation in the development process is necessary. This paper proposes a framework for automating test generation - one of the key components in an intelligent tutoring system. The core of the framework is a domain conceptual model, a collection of testing goals, and a collection of test-generation rules, and the latter two are formulated from an analysis of various modes of error and on the basis of the domain conceptual model. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Context optimization of AI planning for services composition

Context optimization of AI planning for services composition

引用

IEEE International Conference on e-Business Engineering, ICEBE 2006

作者： Lirong, Qiu Zhongzhi, Shi Fen, Lin Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences 100080 Beijing China Graduate School Chinese Academy of Sciences 100039 Beijing China

ISBN: (纸本)0769526454

Web services composition techniques are gaining momentum as the opportunity to establish reusable and versatile inter-op er ability applications. Many researchers propose their composition approach based on planning techniques. We propose our context aware planning method which comprises global planning and local optimization based on context information. The major technical contributions of this paper are: (1) We propose an ontology-based framework for the context-aware composition of Web services. Context model, which are structured based on OWLS, captures the Service-related, Environment-related, and User-related context and can be used in an unambiguous, machine interpretable form. (2) We propose context-aware plan architecture and thus is more scalability and flexibility for the planning process, and thereby improving the efficiency and precision. (3) We propose a hybrid approach to build a plan corresponding to a context-aware service composition, based on global planning and local optimization, considering both the usability and adoption. We test our approach on a simple, yet realistic example, and the preliminary results demonstrate that our implementation provides a practical solution. © 2006 IEEE.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Tolerance relation based granular space

Tolerance relation based granular space

引用

High-Power Diode Laser Technology and Applications IV

作者： Zheng, Zheng Hu, Hong Shi, Zhongzhi Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences 100080 Beijing China Graduate School Chinese Academy of Sciences 100039 Beijing China

ISBN: (纸本)0819461466

Granular computing as an enabling technology and as such it cuts across a broad spectrum of disciplines and becomes important to many areas of applications. In this paper, the notions of tolerance relation based information granular space are introduced and formalized mathematically. It is a uniform model to study problems in model recognition and machine learning. The key strength of the model is the capability of granulating knowledge in both consecutive and discrete attribute space based on tolerance relation. Such capability is reestablished in granulation and an application in information classification is illustrated. Simulation results show the model is effective and efficient. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Knowledge representation

来源：评论

学校读者我要写书评

暂无评论

Rule sets based bilevel decision model

Rule sets based bilevel decision model

引用

29th Australasian Computer Science Conference, ACSC 2006

作者： Zheng, Z. Zhang, G. He, Q. Lu, J. Shi, Z. Faculty of Information Technology University of Technology Sydney PO BOX 123 Broadway NSW 2007 Australia Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China

ISBN: (纸本)1920682309

Bilevel decision addresses the problem in which two levels of decision makers, each tries to optimize their individual objectives under constraints, act and react in an uncooperative, sequential manner. Such a bilevel optimization structure appears naturally in many aspects of planning, management and policy making. However, bilevel decision making may involve many uncertain factors in a real world problem. Therefore it is hard to determine the objective functions and constraints of the leader and the follower when build a bilevel decision model. To deal with this issue, this study explores the use of rule sets to format a bilevel decision problem by establishing a rule sets based model. After develop a method to construct a rule sets based bilevel model of a real-world problem, an example to illustrate the construction process is presented. Copyright © 2006, Australian Computer Society, Inc.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

The graph-theoretical properties of partitions and information entropy

The graph-theoretical properties of partitions and informati...

引用

High-Power Diode Laser Technology and Applications IV

作者： Cao, Cungen Sui, Yuefei Xia, Youming Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China Department of Computer Science Yunnan Normal University Kunming 650092 Yunnan China

ISBN: (纸本)0819461466

The information entropy, as a measurement of the average amount of information contained in an information system, is used in the classification of objects and the analysis of information systems. The information entropy of a partition is non-increasing when the partition is refined, and is related to rough sets by Wong and Ziarko. The partitions and information entropy have some graph-theoretical properties. Given a non-empty universe U, all the partitions G on U are taken as nodes, and a relation V between partitions are defined and taken as edges. The graph obtained is denoted by (G, V), which represents the connections between partitions on U. According to the values of the information entropy of partitions, a directed graph (G, V&rarr) is defined on (G, V). It will be proved that there is a set of partitions with the minimal entropy;and a set of partitions with the maximal entropy;and the entropy is non-decreasing on any directed pathes in (G, V) from a partition with the minimal entropy to one of the partitions with the maximal entropy. Hence, in (G, V), the information entropy of partitions is represented in a clearly structured way. © Springer-Verlag Berlin Heidelberg 2005 information systems, information entropy, classification, partitions.

关键词： information analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：