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.     

Fragile promise: The role of justification in promise-breaking

People who consider themselves moral sometimes use self-serving justifications to rationalize their selfish behaviours. Previous studies have tested the role of ambiguity in justifying wrongdoings, but it remains unclear whether ambiguity also plays a role in justifying promise-breaking behaviour and whether heterogeneity exists. To investigate justification in promise-breaking, we introduced a new experimental paradigm called the card-guessing task and used hierarchical cluster analysis to classify participants based on their promise-breaking decisions in unambiguous and ambiguous conditions. Experiment 1 revealed three clusters of solutions: Cluster 1 always kept their promises (i.e., keepers); Cluster 2 only exploited the vague promises and broke their promises in the ambiguous condition (i.e., intermediates); Cluster 3 tended to take advantage of vague promises and broke their promises irrespective of ambiguity (i.e., breakers). Experiment 2 confirmed that participants in the three clusters differed in their norm-abiding preferences and social value orientations. Keepers were more altruistic and had a stronger sense of norm compliance than intermediates and breakers. In conclusion, our study demonstrates that self-serving justifications were more likely to be employed by people who are moderately sensitive to deviation from social norms, which has implications for strategic interventions and policy formulation concerning unethical behaviour.     

“均”与“寡”阶段性变动下中国居民公平感的变迁

利用中国综合社会调查和中国社会状况综合调查重复截面数据,通过年龄-时期-队列模型对居民公平感的时代变化进行分析。研究发现公平感在年龄上呈“J”型趋势;从时期效应看, 2008年公平感较高, 2010～2013年在低谷徘徊,2015年以后又开始回升;从队列视角看,建国前出生队列公平感偏低,建国后初期的队列相对较高,“50”后有所下滑,从“60”后开始公平感持续走低,到“80”后跌入低谷,但“90”后又开始升高。从1949年前后“寡且不均”到建国初期阶段的“寡且均”,再到改革开放40年快速经济增长下“不寡但不均”的社会变迁过程影响了居民的公平感。     

Empirical research on the identification of singular,multiple and subordinate argumentation

To examine to what degree argumentation skills are mastered by pupils who attend the vocational, general and academic streams in Dutch secondary education various subtests were constructed. The theoretical study of argumentation as exposed by Van Eemeren and Grootendorst was the basis for this test construction. In this article tests for the identification of singular, multiple and subordinate argumentation are described. Also an account is given of a pretest of these three subtests.     

Some properties of estimated scale invariant covariance structures

Scale invariance is a property shared by many covariance structure models employed in practice. An example is provided by the well-known LISREL model subject only to classical normalizations and zero constraints on the parameters. It is shown that scale invariance implies that the estimated covariannce matrix must satisfy certain equations, and the nature of these equations depends on the fitting function used. In this context, the paper considers two classes of fitting functions: weighted least squares and the class of functions proposed by Swain.Constructive comments by the referees are greatly appreciated. The author gratefully acknowledges Michael Browne's interest in his work.     

Finite mixtures in confirmatory factor-analysis models

In this paper, various types of finite mixtures of confirmatory factor-analysis models are proposed for handling data heterogeneity. Under the proposed mixture approach, observations are assumed to be drawn from mixtures of distinct confirmatory factor-analysis models. But each observation does not need to be identified to a particular model prior to model fitting. Several classes of mixture models are proposed. These models differ by their unique representations of data heterogeneity. Three different sampling schemes for these mixture models are distinguished. A mixed type of the these three sampling schemes is considered throughout this article. The proposed mixture approach reduces to regular multiple-group confirmatory factor-analysis under a restrictive sampling scheme, in which the structural equation model for each observation is assumed to be known. By assuming a mixture of multivariate normals for the data, maximum likelihood estimation using the EM (Expectation-Maximization) algorithm and the AS (Approximate-Scoring) method are developed, respectively. Some mixture models were fitted to a real data set for illustrating the application of the theory. Although the EM algorithm and the AS method gave similar sets of parameter estimates, the AS method was found computationally more efficient than the EM algorithm. Some comments on applying the mixture approach to structural equation modeling are made.Note: This paper is one of the Psychometric Society's 1995 Dissertation Award papers.—EditorThis article is based on the dissertation of the author. The author would like to thank Peter Bentler, who was the dissertation chair, for guidance and encouragement of this work. Eric Holman, Robert Jennrich, Bengt Muthén, and Thomas Wickens, who served as the committee members for the dissertation, had been very supportive and helpful. Michael Browne is appreciated for discussing some important points about the use of the approximate information in the dissertation. Thanks also go to an anonymous associate editor, whose comments were very useful for the revision of an earlier version of this article.     

Exploring the set-theoretical structure of objects by additive trees

Arrangements of feature sets that have been proposed to represent qualitative and quantitative variation among objects are shown to generate identical sets of set-symmetric distances. The set-symmetric distances for these feature arrangements can be represented by path lengths in an additive linear tree. Imperfect versions of these feature arrangements are proposed, which also are indistinguishable by the set-symmetric distance model. The distances for the imperfect versions can be represented by path lengths in an additive imperfectly linear tree. When dissimilarities are defined by the more general contrast model and a constant may be added to proximity data, then for both the perfect and imperfect arrangements an additive tree analysis obtains a perfect fit with an imperfectly linear tree. However, in the case of the contrast model also the distinction between the perfect and imperfect arrangements disappears in that also for the perfect arrangements the resulting tree need no longer be linear.The author is grateful to Mathieu Koppen for detailed comments on an earlier version of this article.     

Generalized Rough Sets (Preclusivity Fuzzy-Intuitionistic (BZ) Lattices)

The standard Pawlak approach to rough set theory, as an approximation space consisting of a universe U and an equivalence (indiscernibility) relation R U x U, can be equivalently described by the induced preclusivity ("discernibility") relation U x U \ R, which is irreflexive and symmetric.We generalize the notion of approximation space as a pair consisting of a universe U and a discernibility or preclusivity (irreflexive and symmetric) relation, not necessarily induced from an equivalence relation. In this case the "elementary" sets are not mutually disjoint, but all the theory of generalized rough sets can be developed in analogy with the standard Pawlak approach. On the power set of the universe, the algebraic structure of the quasi fuzzy-intuitionistic "classical" (BZ) lattice is introduced and the sets of all "closed" and of all "open" definable sets with the associated complete (in general nondistributive) ortholattice structures are singled out.The rough approximation of any fixed subset of the universe is the pair consisting of the best "open" approximation from the bottom and the best "closed" approximation from the top. The properties of this generalized rough approximation mapping are studied in the context of quasi-BZ lattice structures of "closed-open" ordered pairs (the "algebraic logic" of generalized rough set theory), comparing the results with the standard Pawlak approach. A particular weak form of rough representation is also studied.     

Comparative evaluation of two superior stopping rules for hierarchical cluster analysis

A split-sample replication stopping rule for hierarchical cluster analysis is compared with the internal criterion previously found superior by Milligan and Cooper (1985) in their comparison of 30 different procedures. The number and extent of overlap of the latent population distributions was systematically varied in the present evaluation of stopping-rule validity. Equal and unequal population base rates were also considered. Both stopping rules correctly identified the actual number of populations when there was essentially no overlap and clusters occupied visually distinct regions of the measurement space. The replication criterion, which is evaluated by clustering of cluster means from preliminary analyses that are accomplished on random partitions of an original data set, was superior as the degree of overlap in population distributions increased. Neither method performed adequately when overlap obliterated visually discernible density nodes.This research was supported in part by NIMH grant 5R01 MH 32457 14.     

A note on the investigation of local and global identifiability

In general, nonlinear models such as those commonly employed for the analysis of covariance structures, are not globally identifiable. Any investigation of local identifiability must either yield a mapping of identifiability onto the entire parameter space, which will rarely be feasible in any applications of interest, or confine itself to the neighbourhood of such points of special interest as the maximum likelihood point.The author would like to thank J. Jack McArdle and Colin Fraser for their comments on this paper.