The ultimate focus of the current essay is on methods of “creative abduction” that have some guarantees as reliable guides to the truth, and those that do not. Emphasizing work by Richard Englehart using data from the World Values Survey, Gerhard Schurz has analyzed literature surrounding Samuel Huntington’s well-known claims that civilization is divided into eight contending traditions, some of which resist “modernization” – democracy, civil rights, equality of rights of women and minorities, secularism. Schurz suggests an evolutionary model of (...) modernization and identifies opposing social forces. In a later essay, citing Englehart’s work as an example, Schurz identifies factor analysis as an example of “creative abduction”. The theories of Englehart and his collaborators are reviewed again in the current essay. Published simulations and standard statistical desiderata for causal inference show the methods Englehart used, factor analysis in particular, are not guides to truth for the kind of data Schurz recognizes as common in political science. Recent work in statistics, philosophy and computer science that makes advances towards such methods is briefly reviewed. (shrink)

In this paper I argue that constitutive relevance relations in mechanisms behave like a special kind of causal relation in at least one important respect: Under suitable circumstances constitutive relevance relations produce the Markov factorization. Based on this observation one may wonder whether standard methods for causal discovery could be fruitfully applied to uncover constitutive relevance relations. This paper is intended as a first step into this new area of philosophical research. I investigate to what extent the PC algorithm, originally (...) developed for causal search, can be used for constitutive relevance discovery. I also discuss possible objections and certain limitations of a constitutive relevance discovery procedure based on PC. (shrink)

This survey presents some of the main principles involved in discovering causal relations. They belong to a large array of possible assumptions and conditions about causal relations, whose various combinations limit the possibilities of acquiring causal knowledge in different ways. How much and in what detail the causal structure can be discovered from what kinds of data depends on the particular set of assumptions one is able to make. The assumptions considered here provide a starting point to explore further the (...) foundations of causal discovery procedures, and how they can be improved. (shrink)

The pivotal problem of comorbidity research lies in the psychometric foundation it rests on, that is, latent variable theory, in which a mental disorder is viewed as a latent variable that causes a constellation of symptoms. From this perspective, comorbidity is a (bi)directional relationship between multiple latent variables. We argue that such a latent variable perspective encounters serious problems in the study of comorbidity, and offer a radically different conceptualization in terms of a network approach, where comorbidity is hypothesized to (...) arise from direct relations between symptoms of multiple disorders. We propose a method to visualize comorbidity networks and, based on an empirical network for major depression and generalized anxiety, we argue that this approach generates realistic hypotheses about pathways to comorbidity, overlapping symptoms, and diagnostic boundaries, that are not naturally accommodated by latent variable models: Some pathways to comorbidity through the symptom space are more likely than others; those pathways generally have the same direction (i.e., from symptoms of one disorder to symptoms of the other); overlapping symptoms play an important role in comorbidity; and boundaries between diagnostic categories are necessarily fuzzy. (shrink)

Learning equivalence classes of acyclic models with latent and selection variables from multiple datasets with overlapping variables is discussed. The problem of inferring the presence of latent variables, their relation to the observables, and the relation among themselves, is considered. A different approach for identifying causal structures, one that results in much simpler equivalence classes, is provided. It is found that the computational cost is much higher than the procedure implemented, but if datasets are individually of modest dimensionality, it might (...) be doable in practice. From the point of view of search algorithms for optimizing structure, much of the machinery of combinatorial optimization could optimize the penalized composite likelihood score by enforcing constraints such that the independence models over different subsets of variables agree on the overlapping sets. (shrink)