Group identification refers to the problem of classifying individuals into groups (e.g., racial or ethnic classification). We consider a multinary group identification model where memberships to three or more groups are simultaneously determined based on individual opinions on who belong to what groups. Our main axiom requires that membership to each group, say the group of J’s, should depend o...

The notion of epistemic independence naturally arises in the framework of reasoning under uncertainty and belief change. Most prominently, probabilistic conditional independence (between variables) plays a key role in Bayesian nets. Several authors [Delgrande and Pelletier, 1994; Benferhat et al., 1994; Dubois et al., 1994; Fariñas del Cerro and Herzig, 1995] have advocated the interest of qual...

Abtraks The problem raised in this paper is the social setting of two religious-national figures. One represents religion, and other nationalists. ideas movements figures became an in-depth broad discussion study. research method qualitative with a type literature research. object study form primary document that examines many between karno Kh. Hasyim Asy'ari. Then grouping analysis carried out...

We present a graphical criterion for reading dependencies from the minimal directed independence map G of a graphoid p, under the assumption that G is a polytree and p satisfies weak transitivity. We prove that the criterion is sound and complete. We argue that assuming weak transitivity is not too restrictive.

This paper examines nine independence concepts for ordinal and expected utilities: utility and preference independence, weak separability (a uniqueness of nonstrict conditional preferences), as well as generalizations that allow for complete indifference or reversal of preferences. Some of these conditions are closed under set-theoretic operations, which simplifies the verification of such assu...

In this paper, we study the notions related to the tree property 1 (=TP1) or equivalently, SOP2. Among others, we supply a type-counting criterion for TP1 and show the equivalence of TP1 and k-TP1. Then we introduce the notions of weak k-TP1 for k ≥ 2, and also supply type-counting criteria for those. We do not know whether weak k-TP1 implies TP1, but at least we prove that each weak k-TP1 impl...

We present a graphical criterion for reading dependencies from the minimal directed independence map G of a graphoid p when G is a polytree and p satisfies composition and weak transitivity. We prove that the criterion is sound and complete. We argue that assuming composition and weak transitivity is not too restrictive.

The decrease of charitable contributions and the greatly increased cost of the whole conduct of hospitals has compelled managers to require payment, directly or indirectly, from the great majority of patients. It is to the credit of the working-man of today that he has that spirit of independence which makes him unwilling to receive this benefit as a charity. He resents the inquiries of the alm...

Editor's note: At this year's Catholic Health Assembly in San Diego, two highly regarded professionals who are deeply committed to fostering holistic approaches to health and health care are scheduled to take the stage. Rose Shandrow, system director of Spiritual Care Services at Franciscan Health System in Tacoma, Wash., is being honored by CHA this year with a mid-career award for outstanding...

We explore the conditional probabilistic independences of systems of random variables (I; JjK), to read \I is conditionally independent of J given K", which are ascending (I; JjK)) (I; JjK L) or descending (I; JjK L)) (I; JjK). The resulting abstract independence structures can be equivalently described by weak families of connected sets. Using, in addition, probabilistic representations of mat...