Hidden Patterns in Combined and Adaptive Knowledge Networks

Hidden Patterns in Combined and Adaptive Knowledge Networks (1988)

Cached

Download Links

[sipi.usc.edu]

Other Repositories/Bibliography

DBLP

by Bart Kosko

Venue:	International Journal of Approximate Reasoning
Citations:	27 - 2 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	Hidden Patterns in Combined and Adaptive Knowledge Networks	SVM HeaderParse 0.2
AUTHOR NAME	Bart Kosko	SVM HeaderParse 0.2
AUTHOR AFFIL	; University of Southern California; Signal and Information Processing Institute, University of Southern California	SVM HeaderParse 0.2
AUTHOR ADDR	; 52 Vanderbilt Ave., New York, NY 10017 0888-613X/88/$3.50 377378 Bart Kosko	SVM HeaderParse 0.2
ABSTRACT	Uncertain causal knowledge is stored in fuzzy cognitive maps (FCMs). FCMs are fuzzy signed digraphs with feedback. The sign (+ or-) of FCM edges indicates causal increase or causal decrease. The fuzzy degree of causality is indicated by a number in [- 1, 1]. FCMs learn by modifying their causal connections in sign and magnitude, structurally analogous to the way in which neural networks learn. An appropriate causal learning law for inductively inferring FCMs from time-series data is the differential Hebbian law, which modifies causal connections by correlating time derivatives of FCM node outputs. The differential Hebbian law contrasts with Hebbian output-correlation learning laws of adaptive neural networks. FCM nodes represent variable phenomena or fuzzy sets. An FCM node nonlinearly transforms weighted summed inputs into numerical output, again in analogy to a model neuron. Unlike expert systems, which are feedforward search trees, FCMs are nonlinear dynamical systems. FCM resonant states are limit cycles, or time-varying patterns. An FCM limit cycle or hidden pattern is an FCM inference. Experts construct FCMs by drawing causal pictures or digraphs. The corresponding connection matrices are used for inferencing. By additively combining augmented connection matrices, any number of FCMs can be naturally combined into a single knowledge network. The credibility wi in [0, 1] of the ith expert is included in this learning process by multiplying the ith expert's augmented FCM connection matrix by w i. Combining connection matrices is a simple type of adaptive inference. In general, connection matrices are modified by an unsupervised learning law, such as the	SVM HeaderParse 0.2
YEAR	1988	INFERENCE
VENUE	International Journal of Approximate Reasoning	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	377--393	INFERENCE
CITATIONS	14 found	ParsCit 1.0