Multilayered reasoning by means of conceptual fuzzy sets

The real world consists of instances of events and continuous numeric values, while people represent and process their knowledge in terms of symbols. Fuzzy sets provide a strong notation connecting the symbolic representation to the real world. In previously proposed Conceptual Fuzzy Sets (CFS), the meaning of a concept is represented by the distribution of activations of labels in a bidirectional associative memory. In particular, a multilayered structured CFS represents the meaning of the same concept as it is used in various expressions in each layer. The propagation of activations corresponds to reasoning. Therefore, we propose a multilayered reasoning method associated to a multilayered structured CFS, which has the following features: (1) capable of simultaneous symbolic and quantitative processing, (2) capable of simultaneous top-down and bottom-up processing. The effectiveness of the proposed method is illustrated by practical examples of decision regarding the amount of steering in the task of parking a car, and recognition of facial expressions for an image understanding system. © 1996 John Wiley & Sons, Inc.     

一种有效的模糊关联规则挖掘的形式化方法

模糊关联规则用于处理数据库中的不精确信息,并提供一个知识发现的良好表示。利用约束级别表示理论将GUHA模型泛化用于模糊关联规则,通过约束级别管理模糊规则,并给出一个扩展的验证度量过程。使用形式化方法的挖掘算法,在不同的约束级别上并行化挖掘过程,总结得到的结果。算法的复杂度分析以及实验结果表明该形式化方法是有效可行的,从而确立了模糊关联规则表示和评价的逻辑基础。     

Enhancing neural control systems by fuzzy logic and evolutionary reinforcement

Neural networks are widely used for system modelling and control because of their ability to approximate complex non-linear functions. Fuzzy systems, similarly, have been shown to be able to approximate or model any nonlinear system. Fuzzy-logic and neural systems, however, have very contrasting application requirements and it has been said that their integration offers a facility to bridge symbolic knowledge processing and connectionist learning. The significance of the integration becomes more apparent by considering their disparities. Neural networks do not provide a strong scheme for knowledge representation, while fuzzy systems do not possess capabilities for automated learning. On the other hand, another learning method has emerged recently, as an alternative to inductive techniques used with neural networks, namely, genetic or evolutionary learning. This paper will present a technique for the fusion of the three paradigms in a learning control context. It will describe a type of learning, known as Evolutionary Algorithm Reinforcement Learning (EARL), which is used to optimise a fuzzy neural control system. An application case study is also presented.     

Impact of Knowledge Representations on Problem-Oriented Learning in Online Environments

The objective of this study was to investigate the impact of knowledge representations on problem-oriented learning in online learning environments. The study compared the impact of knowledge map representation with traditional hierarchical representation with regard to learning memory and problem-solving performance. Twenty-nine students participated in an experiment in which they studied online materials with the goal of solving two programming problems (simple and complex). It was found that participants who used the hierarchical representation read in the depth-first sequence, whereas participants who used the knowledge map representation read in a sequence reflecting the system running mechanism implied by the graphical representation. In addition, participants who used the knowledge map representation had better memory of the learning content, especially about relations between knowledge nodes. When solving the complex problem, participants who used the knowledge map representation made a deeper analysis of the problem and had better problem-solving performance. These results were not significant in the simple problem-solving task.     

基于异质信息网络的推荐模型

为了解决推荐系统的冷启动和稀疏性问题, 本文提出了一种基于异质信息网络的推荐模型. 传统的推荐方法无法在知识图谱表示学习中融入隐含的路径信息, 这样使得知识推荐系统性能较为一般. 本文提出的模型在异质信息网络中设置元路径, 通过图神经网络融入到知识图谱表示学习中. 再利用注意力网络连接推荐任务和知识图谱表示任务, 其可以学习两个任务之中潜在的特征, 并且能够增强推荐系统中被推荐项和知识图谱中实体的相互作用. 最后在推荐任务中进行用户点击率预测. 模型在公开数据集Book-Crossing和通过DBLP数据集构建的图谱上进行了实验. 最后结果表明, 模型在AUC, 召回率和F1值3个指标上均比其他算法有更好的表现.     

On the influence of using fuzzy extensions in linguistic fuzzy rule-based regression systems

Fuzzy Rule-Based Systems, FRBSs, are powerful tools to address regression problems. They can model the relationship between inputs and outputs by linguistic concepts. However, those FRBSs which are based on the conventional Type-1 fuzzy sets may not be able to handle some difficulties of real-world applications. In such situations, using novel representations of fuzzy sets seems like a good idea. Different extensions of fuzzy sets usually help to provide more precise models in the real-world problems. In this study, the influence of using fuzzy extensions in improving the efficiency of linguistic fuzzy rule-based regression models is investigated. For this purpose, a conventional Type-1 Mamdani FRBS is adapted to the three extensions of fuzzy sets, namely Interval Type-2, Intuitionistic, and Interval Type-2 Intuitionistic fuzzy sets. A two-pass method is proposed to define membership (non-membership) functions of these fuzzy sets; this method is based on the 3-tuples representation of the standard Type-1 membership functions. Wang and Mendel’s rule learning method is adapted to extract fuzzy rules from regression data. In order to tune the membership functions up to different extents, three evolutionary extensions are also presented for each type of the proposed FRBSs. Individual, internal, and external comparisons of the proposed FRBSs were done using 22 real-world regression datasets and statistical tests. Experimental results confirm that all the three proposed FRBSs outperform the classical Type-1 framework; furthermore, the Interval Type-2 Intuitionistic FRBS is the superior system so that an appropriate tuning of its parameters makes it the most accurate model.     

A neuro-fuzzy controller for mobile robot navigation and multirobotconvoying

A Neural integrated Fuzzy conTroller (NiF-T) which integrates the fuzzy logic representation of human knowledge with the learning capability of neural networks is developed for nonlinear dynamic control problems. NiF-T architecture comprises of three distinct parts: (1) Fuzzy logic Membership Functions (FMF), (2) a Rule Neural Network (RNN), and (3) an Output-Refinement Neural Network (ORNN). FMF are utilized to fuzzify sensory inputs. RNN interpolates the fuzzy rule set; after defuzzification, the output is used to train ORNN. The weights of the ORNN can be adjusted on-line to fine-tune the controller. In this paper, real-time implementations of autonomous mobile robot navigation and multirobot convoying behavior utilizing the NiF-T are presented. Only five rules were used to train the wall following behavior, while nine were used for the hall centering. Also, a robot convoying behavior was realized with only nine rules. For all of the described behaviors-wall following, hall centering, and convoying, their RNN's are trained only for a few hundred iterations and so are their ORNN's trained for only less than one hundred iterations to learn their parent rule sets.     

融合实体概念描述与图像特征的知识图谱表示学习研究

知识图谱表示学习将实体和关系映射到一个连续的低维空间.传统学习方法是从结构化的三元组学习知识表示,忽略了三元组之外与实体相关的丰富多源信息.针对该问题,提出一种将实体概念描述和图像特征与事实三元组相结合的知识图谱表示学习模型DIRL.首先,利用BERT模型进行实体概念描述的语义表示;其次,使用CNN编码器对图像总体特征进行提取,然后通过基于注意力的方法表示图像特征;最后,将基于概念描述的表示和基于图像特征的表示与翻译模型TransR结合起来进行知识图谱表示学习.通过实验验证,DIRL模型优于现有方法,提高了多源信息知识图谱表示的有效性.     

A new hybrid method using evolutionary algorithms to train Fuzzy Cognitive Maps

A novel hybrid method based on evolutionary computation techniques is presented in this paper for training Fuzzy Cognitive Maps. Fuzzy Cognitive Maps is a soft computing technique for modeling complex systems, which combines the synergistic theories of neural networks and fuzzy logic. The methodology of developing Fuzzy Cognitive Maps relies on human expert experience and knowledge, but still exhibits weaknesses in utilization of learning methods and algorithmic background. For this purpose, we investigate a coupling of differential evolution algorithm and unsupervised Hebbian learning algorithm, using both the global search capabilities of Evolutionary strategies and the effectiveness of the nonlinear Hebbian learning rule. The use of differential evolution algorithm is related to the concept of evolution of a number of individuals from generation to generation and that of nonlinear Hebbian rule to the concept of adaptation to the environment by learning. The hybrid algorithm is introduced, presented and applied successfully in real-world problems, from chemical industry and medicine. Experimental results suggest that the hybrid strategy is capable to train FCM effectively leading the system to desired states and determining an appropriate weight matrix for each specific problem.     

模糊属性Petri网建模方法及学习模型研究

定性映射易于表达模糊不确定性知识,但其在表达人类认知思维活动动态特征上存在不足;模糊Petri网比较符合人类思维方式,但相关参数不易获得且其自学习能力存在较大局限性。为此,提出一种模糊属性Petri网(FAPN)形式定义及建模方法。在FAPN结构中构建定性基准参数学习方法,通过定性映射定义4类变迁发生的模糊定性判断规则和相应变迁发生后的结果运算公式,给出FAPN模型的推理算法和学习机制,并模拟系统的动态运行过程。分析结果表明,该方法能有效提高FAPN的学习能力,可适用于以定性判断为特点的诊断系统。     

Concept Formation During Interactive Theory Revision

This article examines the problem of concept formation in machine learning, and focuses in particular on the problem of aggregation, i .e., the decision of which objects are to be grouped together into a new concept. While existing concept formation approaches have mainly concentrated on aggregation constraints that rely on structural or correlational properties of the concepts themselves, we argue that in an integrated learning system, other learning activities can provide an additional context that focuses concept formation before structural criteria are applied. In particular, we present the concept formation method realized by the KRT and CLT components of the integrated learning system MOBAL. In MOBAL, a concept formation attempt is triggered whenever no existing concept can adequately capture the rule instance and exception sets as they arise from the theory revision activities of the system. We describe how the so-proposed aggregate is characterized by a set of (function-free) first-order Horn clauses and how these are evaluated according to structural criteria to decide about the introduction of the concept into the representation. We show how a structural criterion can be used to ensure that any new concept improves the structure of the knowledge base, and we empirically evaluate how the introduction of new concepts according to different criteria affects the classification accuracy of learned rules.     

Learning classification rules from database in the context ofknowledge acquisition and representation

A method for learning knowledge from a database is used to address the bottleneck of manual knowledge acquisition. An attempt is made to improve representation with the assistance of experts and from computer resident knowledge. The knowledge representation is described in the framework of a conceptual schema consisting of a semantic model and an event model. A concept classifies a domain into different subdomains. As a method of knowledge acquisition, inductive learning techniques are used for rule generation. The theory of rough sets is used in designing the learning algorithm. Examples of certain concepts are used to induce general specifications of the concepts called classification rules. The basic approach is to partition the information into equivalence classes and to derive conclusions based on equivalence relations. In a sense, what is involved is a data-reduction process, where the goal is to reduce a large database of information to a small number of rules describing the domain. This completely integrated approach includes user interface, semantics, constraints, representations of temporal events, induction, etc     

Evolutionary Multi-task Learning for Modular Knowledge Representation in Neural Networks

The brain can be viewed as a complex modular structure with features of information processing through knowledge storage and retrieval. Modularity ensures that the knowledge is stored in a manner where any complications in certain modules do not affect the overall functionality of the brain. Although artificial neural networks have been very promising in prediction and recognition tasks, they are limited in terms of learning algorithms that can provide modularity in knowledge representation that could be helpful in using knowledge modules when needed. Multi-task learning enables learning algorithms to feature knowledge in general representation from several related tasks. There has not been much work done that incorporates multi-task learning for modular knowledge representation in neural networks. In this paper, we present multi-task learning for modular knowledge representation in neural networks via modular network topologies. In the proposed method, each task is defined by the selected regions in a network topology (module). Modular knowledge representation would be effective even if some of the neurons and connections are disrupted or removed from selected modules in the network. We demonstrate the effectiveness of the method using single hidden layer feedforward networks to learn selected n-bit parity problems of varying levels of difficulty. Furthermore, we apply the method to benchmark pattern classification problems. The simulation and experimental results, in general, show that the proposed method retains performance quality although the knowledge is represented as modules.     

A Polynomial Approach to the Constructive Induction of Structural Knowledge

The representation formalism as well as the representation language is of great importance for the success of machine learning. The representation formalism should be expressive, efficient, useful, and applicable. First-order logic needs to be restricted in order to be efficient for inductive and deductive reasoning. In the field of knowledge representation, term subsumption formalisms have been developed which are efficient and expressive. In this article, a learning algorithm, KLUSTER, is described that represents concept definitions in this formalism. KLUSTER enhances the representation language if this is necessary for the discrimination of concepts. Hence, KLUSTER is a constructive induction program. KLUSTER builds the most specific generalization and a most general discrimination in polynomial time. It embeds these concept learning problems into the overall task of learning a hierarchy of concepts.     

一种基于改进向量投影距离的知识图谱表示方法

表示学习在知识图谱推理中有着重要的研究价值,将知识库中的实体和关系用连续低维向量进行表示,可实现知识的可计算。基于向量投影距离的知识表示学习模型在面对复杂关系时有较好的知识表达能力,但在处理一对一简单关系时容易受到无关信息的干扰,并且在一对多、多对一和多对多等复杂关系上存在性能提升空间。为此,文中提出了一个基于改进向量投影距离的知识表示学习模型SProjE,该模型引入自适应度量方法,降低了噪声信息的影响。在此基础上,通过进一步优化损失函数来提高复杂关系三元组的损失权重。该模型适用于大规模知识图谱的表示学习任务。最后,在标准知识图谱数据集WN18和FB15K上分析和验证了所提方法的有效性,基于链路预测任务的评测实验结果表明,相较于现有的模型和方法,SProjE在各项性能指标上均取得了明显的进步。     

A stock selection strategy using fuzzy neural networks

This paper describes, from a general system-design perspective, an artificial neural network (ANN) approach to a stock selection strategy. The paper suggests a concept of neural gates which are similar to the processing elements in ANN, but generalized into handling various types of information such as fuzzy logic, probabilistic and Boolean information together. Forecasting of stock market returns, assessing of country risk and rating of stocks based on fuzzy rules, probabilistic and Boolean data can be done using the proposed neural gates. Fuzzy logic is known to be useful for decision-making where there is a great deal of uncertainty as well as vague phenomena, but lacks the learning capability; on the other hand, neural networks are useful in constructing an adaptive system which can learn from historical data, but are not able to process ambiguous rules and probabilistic data sets. This paper describes how these problems can be solved using the proposed neural gates.     

Learning fuzzy rules for similarity assessment in case-based reasoning

Fundamental to case-based reasoning is the assumption that similar problems have similar solutions. The meaning of the concept of “similarity” can vary in different situations and remains an issue. This paper proposes a novel similarity model consisting of fuzzy rules to represent the semantics and evaluation criteria for similarity. We believe that fuzzy if-then rules present a more powerful and flexible means to capture domain knowledge for utility oriented similarity modeling than traditional similarity measures based on feature weighting. Fuzzy rule-based reasoning is utilized as a case matching mechanism to determine whether and to which extent a known case in the case library is similar to a given problem in query. Further, we explain that such fuzzy rules for similarity assessment can be learned from the case library using genetic algorithms. The key to this is pair-wise comparisons of cases with known solutions in the case library such that sufficient training samples can be derived for genetic-based fuzzy rule learning. The evaluations conducted have shown the superiority of the proposed method in similarity modeling over traditional schemes as well as the feasibility of learning fuzzy similarity rules from a rather small case base while still yielding competent system performance.     

On Z‐valuations using Zadeh's Z‐numbers

We first recall the concept of Z‐numbers introduced by Zadeh. These objects consist of an ordered pair (A, B) of fuzzy numbers. We then use these Z‐numbers to provide information about an uncertain variable V in the form of a Z‐valuation, which expresses the knowledge that the probability that V is A is equal to B. We show that these Z‐valuations essentially induce a possibility distribution over probability distributions associated with V. We provide a simple illustration of a Z‐valuation. We show how we can use this representation to make decisions and answer questions. We show how to manipulate and combine multiple Z‐valuations. We show the relationship between Z‐numbers and linguistic summaries. Finally, we provide for a representation of Z‐valuations in terms of Dempster–Shafer belief structures, which makes use of type‐2 fuzzy sets. © 2012 Wiley Periodicals, Inc.