• Korean Journal of Logic
• /
• v.8 no.1
• /
• pp.47-67
• /
• 2005

Bayesian networks have been used in studying and simulating causal inferences by using the probability function distributed over the variables consisting of inquiry space. The focus of the debates concerning Bayesian networks is the causal Markov condition that constrains the probabilistic independence between all the variables which are not in the causal relations. Cartwright, a strong critic about the Bayesian network theory, argues that the causal Markov condition cannot hold in indeterministic systems, so it cannot be a valid principle for causal inferences. The purpose of the paper is to explore whether her argument on the causal Markov condition is valid. Mainly, I shall argue that it is possible for upholders of the causal Markov condition to respond properly the criticism of Cartwright through the continuous causal model that permits the infinite sequence of causal events.

• Science of Emotion and Sensibility
• /
• v.24 no.1
• /
• pp.59-72
• /
• 2021

Concepts and categories offer the basis for inference pertaining to unobserved features. Prior research on category-based induction that used blank properties has suggested that similarity between categories and features explains feature inference (Rips, 1975; Osherson et al., 1990). However, it was shown by later research that prior knowledge had a large influence on category-based inference and cases were reported where similarity effects completely disappeared. Thus, this study tested category-based feature inference when features are connected in a causal chain and proposed a feature inference model that predicts participants' inference ratings. Each participant learned a category with four features connected in a causal chain and then performed feature inference tasks for an unobserved feature in various exemplars of the category. The results revealed nonindependence, that is, the features not only linked directly to the target feature but also to those screened-off by other feature nodes and affected feature inference (a violation of the causal Markov condition). Feature inference model of causal model theory (Sloman, 2005) explained nonindependence by predicting the effects of directly linked features and indirectly related features. Indirect features equally affected participants' inference regardless of causal distance, and the model predicted smaller effects regarding causally distant features.

• Korean Journal of Cognitive Science
• /
• v.28 no.4
• /
• pp.329-347
• /
• 2017

Early research into category-based feature inference reported various phenomena in human thinking including typicality, diversity, similarity effects, etc. Later research discovered that participants' prior knowledge has an extensive influence on these sorts of reasoning. The current research tested the effects of causal knowledge on feature inference and conducted modeling on the results. Participants performed feature inference for categories consisted of four features where the features were connected either in common cause or common effect structure. The results showed typicality effects along with violations of causal Markov condition in common cause structure and causal discounting in common effect structure. To model the results, it was assumed that participants perform feature inference based on the difference between the probabilities of an exemplar with the target feature and an exemplar without the target feature (that is, $p(E_{F(X)}{\mid}Cat)-p(E_{F({\sim}X)}{\mid}Cat)$). Exemplar probabilities were computed based on causal model theory (Rehder, 2003) and applied to inference for target features. The results showed that the model predicts not only typicality effects but also violations of causal Markov condition and causal discounting observed in participants' data.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.8 no.8
• /
• pp.845-852
• /
• 2018

Mayer-Schönberger and Cukier(2013) explain why big data is important for our life, while showing many cases in which analysis of big data has great significance for our life and raising intriguing issues on the analysis of big data. The two authors claim that correlation is in many ways practically far more efficient and versatile in the analysis of big data than causality. Moreover, they claim that causality could be abandoned since analysis and prediction founded on correlation must prevail. I critically examine the two authors' accounts of causality and correlation. First, I criticize that corelation is sufficient for our analysis of data and our prediction founded on the analysis. I point out their misunderstanding of the distinction between correlation and causality. I show that spurious correlation misleads our decision while analyzing Simpson paradox. Second, I criticize not only that causality is more inefficient in the analysis of big data than correlation, but also that there is no mathematical theory for causality. I introduce the mathematical theories of causality founded on structural equation theory, and show that causality has great significance for the analysis of big data.