The Creativity Matrix: Spotlights and Blind Spots in Our Understanding of the Phenomenon

In this paper, we organize past and present theories and models of creativity by using a new conceptual framework—the creativity matrix—with the aim of highlighting the dimensions of creativity we know a lot about and those we tend to either ignore or find difficult to study. This matrix is formed by bringing together a developmental model of creativity (the 4 C's) and a structural one (the 5 A's). We start by briefly describing these two conceptual frameworks, and then, we proceed to exploring the matrix itself by describing how the 5 A's are dynamically organized at each “level” of the 4 C's. Importantly, our overview of the matrix is informed by existing models and concepts that address one of more of the C's and the A's. This gives us a unique opportunity to take stock of what has been studied so far and, toward the end, consider new avenues for the development of theory and research agendas within creativity studies.     

Who uses community mental health centres? A study of one health district

A caseload analysis was undertaken to investigate those clients seen by five community mental health centre teams within one healthcare district. The 985 clients are described in terms of demographic and clinical features and questions relating to service provision are discussed.     

Typical delay determines waiting time on periodic-food schedules: Static and dynamic tests

Pigeons and other animals soon learn to wait (pause) after food delivery on periodic-food schedules before resuming the food-rewarded response. Under most conditions the steady-state duration of the average waiting time, t, is a linear function of the typical interfood interval. We describe three experiments designed to explore the limits of this process. In all experiments, t was associated with one key color and the subsequent food delay, T, with another. In the first experiment, we compared the relation between t (waiting time) and T (food delay) under two conditions: when T was held constant, and when T was an inverse function of t. The pigeons could maximize the rate of food delivery under the first condition by setting t to a consistently short value; optimal behavior under the second condition required a linear relation with unit slope between t and T. Despite this difference in optimal policy, the pigeons in both cases showed the same linear relation, with slope less than one, between t and T. This result was confirmed in a second parametric experiment that added a third condition, in which T + t was held constant. Linear waiting appears to be an obligatory rule for pigeons. In a third experiment we arranged for a multiplicative relation between t and T (positive feedback), and produced either very short or very long waiting times as predicted by a quasi-dynamic model in which waiting time is strongly determined by the just-preceding food delay.     

A general model for the analysis of multilevel data

A general model is developed for the analysis of multivariate multilevel data structures. Special cases of the model include repeated measures designs, multiple matrix samples, multilevel latent variable models, multiple time series, and variance and covariance component models.We would like to acknowledge the helpful comments of Ruth Silver. We also wish to thank the referees for helping to clarify the paper. This work was partly carried out with research funds provided by the Economic and Social Research Council (U.K.).     

Test theory without an answer key

A general model is presented for homogeneous, dichotomous items when the answer key is not known a priori. The model is structurally related to the two-class latent structure model with the roles of respondents and items interchanged. For very small sets of respondents, iterative maximum likelihood estimates of the parameters can be obtained by existing methods. For other situations, new estimation methods are developed and assessed with Monte Carlo data. The answer key can be accurately reconstructed with relatively small sets of respondents. The model is useful when a researcher wants to study objectively the knowledge possessed by members of a culturally coherent group that the researcher is not a member of.This research was supported by NSF Grant No. SES-8320173 to the authors. We gratefully acknowledge comments and suggestions from John Boyd, Tarow Indow, and Kathy Maher as well as the editor and several anonymous referees.     

Hierarchical classes: Model and data analysis

A discrete, categorical model and a corresponding data-analysis method are presented for two-way two-mode (objects × attributes) data arrays with 0, 1 entries. The model contains the following two basic components: a set-theoretical formulation of the relations among objects and attributes; a Boolean decomposition of the matrix. The set-theoretical formulation defines a subset of the possible decompositions as consistent with it. A general method for graphically representing the set-theoretical decomposition is described. The data-analysis algorithm, dubbed HICLAS, aims at recovering the underlying structure in a data matrix by minimizing the discrepancies between the data and the recovered structure. HICLAS is evaluated with a simulation study and two empirical applications.This research was supported in part by a grant from the Belgian NSF (NFWO) to Paul De Boeck and in part by NSF Grant BNS-83-01027 to Seymour Rosenberg. We thank Iven Van Mechelen for clarifying several aspects of the Boolean algebraic formulation of the model and Phipps Arabie for his comments on an earlier draft.     

Computational behavior dynamics: an alternative description of Nevin (1969).

A computational processing behavior-dynamic model was instantiated in the form of a computer program that "behaved" on the task developed by Nevin (1969). In this classic discrete-trials experiment, the relative frequency of choosing a response alternative matched the relative frequency of reinforcement for that alternative, the local structure of responding was opposite that predicted by momentary maximizing (i.e., the probability of a changeover decreased with run length), and absolute and relative response rates varied independently. The behavior-dynamic model developed here qualitatively reproduced these three results (but not in quantitative and specific detail) and also generated some interesting, as-yet-untested predictions about performance in Nevin's task. The model was discussed as an example of a stochastic behavior-dynamic alternative to algebraic behavior theory.     

Reciprocal peer management: Improving staff instruction in a vocational training program

To test the feasibility and utility of involving peers as sources of feedback, 6 subjects, instructors in a vocational program for adults with mental retardation, participated in a staff training and management program. Subjects' teaching interactions were assessed during baseline, in-service training (on effective teaching), return-to-baseline, peer management, and follow-up phases. Peer management was introduced in multiple baseline fashion across pairs of subjects. Members of each pair were trained to monitor peer teaching, to record and graph data, to provide feedback, and to set goals with the peer. Each pair then performed these procedures on the job for several weeks, during which time 4 of the 6 subjects increased their use of effective teaching methods (over baseline). However, inconsistencies in the magnitude and durability of these increases require that the study be viewed as inconclusive, although it has heuristic value as a promising model for involving co-workers in staff management programs.     

Constructing the exact significance level for a person fit statistic

This paper uses an extension of the network algorithm originally introduced by Mehta and Patel to construct exact tail probabilities for testing the general hypothesis that item responses are distributed according to the Rasch model. By assuming that item difficulties are known, the algorithm is applicable to the statistical tests either given the maximum likelihood ability estimate or conditioned on the total score. A simulation study indicates that the network algorithm is an efficient tool for computing the significance level of a person fit statistic based on test lengths of 30 items or less.