Search results for "Conditional"
showing 10 items of 294 documents
Functional connectivity inference from fMRI data using multivariate information measures
2022
Abstract Shannon’s entropy or an extension of Shannon’s entropy can be used to quantify information transmission between or among variables. Mutual information is the pair-wise information that captures nonlinear relationships between variables. It is more robust than linear correlation methods. Beyond mutual information, two generalizations are defined for multivariate distributions: interaction information or co-information and total correlation or multi-mutual information. In comparison to mutual information, interaction information and total correlation are underutilized and poorly studied in applied neuroscience research. Quantifying information flow between brain regions is not explic…
Path integral solution for non-linear system enforced by Poisson White Noise
2008
Abstract In this paper the response in terms of probability density function of non-linear systems under Poisson White Noise is considered. The problem is handled via path integral (PI) solution that may be considered as a step-by-step solution technique in terms of probability density function. First the extension of the PI to the case of Poisson White Noise is derived, then it is shown that at the limit when the time step becomes an infinitesimal quantity the Kolmogorov–Feller (K–F) equation is fully restored enforcing the validity of the approximations made in obtaining the conditional probability appearing in the Chapman Kolmogorov equation (starting point of the PI). Spectral counterpa…
On finite products of groups and supersolubility
2010
Two subgroups X and Y of a group G are said to be conditionally permutable in G if X permutes with Y(g) for some element g E G. i.e., XY(g) is a subgroup of G. Using this permutability property new criteria for the product of finite supersoluble groups to be supersoluble are obtained and previous results are recovered. Also the behaviour of the supersoluble residual in products of finite groups is studied.
On conditional permutability and saturated formations
2011
Two subgroups A and B of a group G are said to be totally completely conditionally permutable (tcc-permutable) in G if X permutes with Yg for some g ¿ ¿X, Y¿ for all X ¿ A and Y ¿ B. We study the belonging of a finite product of tcc-permutable subgroups to a saturated formation of soluble groups containing all finite supersoluble groups. © 2011 Edinburgh Mathematical Society.
Iterated Conditionals and Characterization of P-Entailment
2021
In this paper we deepen, in the setting of coherence, some results obtained in recent papers on the notion of p-entailment of Adams and its relationship with conjoined and iterated conditionals. We recall that conjoined and iterated conditionals are suitably defined in the framework of conditional random quantities. Given a family \(\mathcal {F}\) of n conditional events \(\{E_{1}|H_{1},\ldots , E_{n}|H_{n}\}\) we denote by \(\mathcal {C}(\mathcal {F})=(E_{1}|H_{1})\wedge \cdots \wedge (E_{n}|H_{n})\) the conjunction of the conditional events in \(\mathcal F\). We introduce the iterated conditional \(\mathcal {C}(\mathcal {F}_{2})|\mathcal {C}(\mathcal {F}_{1})\), where \(\mathcal {F}_{1}\)…
Lower and Upper Probability Bounds for Some Conjunctions of Two Conditional Events
2018
In this paper we consider, in the framework of coherence, four different definitions of conjunction among conditional events. In each of these definitions the conjunction is still a conditional event. We first recall the different definitions of conjunction; then, given a coherent probability assessment (x, y) on a family of two conditional events \(\{A|H,B|K\}\), for each conjunction \((A|H) \wedge (B|K)\) we determine the (best) lower and upper bounds for the extension \(z=P[(A|H) \wedge (B|K)]\). We show that, in general, these lower and upper bounds differ from the classical Frechet-Hoeffding bounds. Moreover, we recall a notion of conjunction studied in recent papers, such that the res…
Procedural semantics, metarepresentation, and some particles in Behdini Kurdish
2012
Contemporary studies in the linguistic semantics of particles have been greatly influenced by two ideas: that these items trigger pragmatic processing procedures rather than provide purely conceptual content, and that the procedures that some of them trigger relate to the recovery of metarepresentations. Recent developments in the theory of procedural semantics have introduced some refinements, notably the claim that these procedures may not all relate primarily to comprehension per se but may also relate to the epistemic assessment of communicated claims. This paper discusses three particles in Behdini Kurdish in the light of these theoretical developments: the speech-act particle ka often…
Are nonlinear model-free conditional entropy approaches for the assessment of cardiac control complexity superior to the linear model-based one?
2016
Objective : We test the hypothesis that the linear model-based (MB) approach for the estimation of conditional entropy (CE) can be utilized to assess the complexity of the cardiac control in healthy individuals. Methods : An MB estimate of CE was tested in an experimental protocol (i.e., the graded head-up tilt) known to produce a gradual decrease of cardiac control complexity as a result of the progressive vagal withdrawal and concomitant sympathetic activation. The MB approach was compared with traditionally exploited nonlinear model-free (MF) techniques such as corrected approximate entropy, sample entropy, corrected CE, two k -nearest-neighbor CE procedures and permutation CE. Electroca…
Vectors of Pairwise Item Preferences
2019
Neural embedding has been widely applied as an effective category of vectorization methods in real-world recommender systems. However, its exploration of users’ explicit feedback on items, to create good quality user and item vectors is still limited. Existing neural embedding methods only consider the items that are accessed by the users, but neglect the scenario when a user gives high or low rating to a particular item. In this paper, we propose Pref2Vec, a method to generate vector representations of pairwise item preferences, users and items, which can be directly utilized for machine learning tasks. Specifically, Pref2Vec considers users’ pairwise item preferences as elementary units. …
Conditional Entropy-Based Evaluation of Information Dynamics in Physiological Systems
2014
We present a framework for quantifying the dynamics of information in coupled physiological systems based on the notion of conditional entropy (CondEn). First, we revisit some basic concepts of information dynamics, providing definitions of self entropy (SE), cross entropy (CE) and transfer entropy (TE) as measures of information storage and transfer in bivariate systems. We discuss also the generalization to multivariate systems, showing the importance of SE, CE and TE as relevant factors in the decomposition of the system predictive information. Then, we show how all these measures can be expressed in terms of CondEn, and devise accordingly a framework for their data-efficient estimation.…