Covert behavior may also be strong behavior which cannot be overtly emitted because the proper circumstances are lacking. When we are strongly inclined to go skiing, although there is no snow, we say I would like to go skiing. It is not very  ...

Previous neural network models of concept learning were mainly implemented with supervised learning schemes. However, studies of human conceptual memory have shown that concepts may be learned without a teacher who provides the category name to associate with exemplars. A modular neural network architecture that realizes concept acquisition through two functionally distinct operations, categorizing and naming, is proposed as an alternative. An unsupervised algorithm realizes the categorizing module by constructing representations of categories compatible with prototype theory. The naming module associates (...) category names to the output of the categorizing module in a supervised mode. In such a modular architecture, the interface between the modules can be conceived of as an “information relay” that encodes, constrains, and propagates important information. Five experiments were conducted to analyze the relationships among internal conceptual codes and simple conceptual and lexical development. The first two experiments show a prototype effect and illustrate some basic characteristics of the system. The third experiment presents a bottom‐up model of the narrowing down of children's early lexical categories that honors mutual exclusivity. The fourth experiment introduces top‐down constraints on conceptual coding. The fifth experiment exhibits how hierarchical relationships between concepts are learned by the architecture, and also demonstrates how a spectrum of conceptual expertise may gradually emerge as a consequence of experiencing more with certain categories than with others. (shrink)

A computational theory of induction must be able to identify the projectible predicates, that is to distinguish between which predicates can be used in inductive inferences and which cannot. The problems of projectibility are introduced by reviewing some of the stumbling blocks for the theory of induction that was developed by the logical empiricists. My diagnosis of these problems is that the traditional theory of induction, which started from a given (observational) language in relation to which all inductive rules are (...) formulated, does not go deep enough in representing the kind of information used in inductive inferences. As an interlude, I argue that the problem of induction, like so many other problems within AI, is a problem of knowledge representation. To the extent that AI-systems are based on linguistic representations of knowledge, these systems will face basically the same problems as did the logical empiricists over induction. In a more constructive mode, I then outline a non-linguistic knowledge representation based on conceptual spaces. The fundamental units of these spaces are "quality dimensions". In relation to such a representation it is possible to define "natural" properties which can be used for inductive projections. I argue that this approach evades most of the traditional problems. (shrink)

A new algorithm for clustering is presented --- the Distributed Clustering Algorithm. It is designed to be incremental and to work in a real-time situation, thus making it suitable for robotics and in models of concept formation. The DCA starts with one cluster, successively adding prototypes and distributing them according to data density until a certain criteria is fulfilled. This criteria is that new prototypes do not add enough extra precision in the representation of the data. A local measure called (...) emph{roundness} is used to predict how much extra precision a new prototype will add. (shrink)