71,842 research outputs found
Power Processes in Bargaining
This is a theoretical article that integrates and extends a particular program of work on power in bargaining relationships. Power is conceptualized as a structurally based capability, and power use as tactical action falling within either conciliatory or hostile categories. The core propositions are (1) the greater the total amount of power in a relationship, the greater the use of conciliatory tactics and the lower the use of hostile tactics; and (2) an unequal power relationship fosters more use of hostile tactics and less use of conciliatory tactics than an equal power relationship. Distinct research on power dependence and bilateral deterrence provides support for both propositions. Implications are discussed for power struggle in ongoing relationships
Dimension Reduction by Mutual Information Discriminant Analysis
In the past few decades, researchers have proposed many discriminant analysis
(DA) algorithms for the study of high-dimensional data in a variety of
problems. Most DA algorithms for feature extraction are based on
transformations that simultaneously maximize the between-class scatter and
minimize the withinclass scatter matrices. This paper presents a novel DA
algorithm for feature extraction using mutual information (MI). However, it is
not always easy to obtain an accurate estimation for high-dimensional MI. In
this paper, we propose an efficient method for feature extraction that is based
on one-dimensional MI estimations. We will refer to this algorithm as mutual
information discriminant analysis (MIDA). The performance of this proposed
method was evaluated using UCI databases. The results indicate that MIDA
provides robust performance over different data sets with different
characteristics and that MIDA always performs better than, or at least
comparable to, the best performing algorithms.Comment: 13pages, 3 tables, International Journal of Artificial Intelligence &
Application
Entanglement structures in qubit systems
Using measures of entanglement such as negativity and tangles we provide a
detailed analysis of entanglement structures in pure states of non-interacting
qubits. The motivation for this exercise primarily comes from holographic
considerations, where entanglement is inextricably linked with the emergence of
geometry. We use the qubit systems as toy models to probe the internal
structure, and introduce some useful measures involving entanglement negativity
to quantify general features of entanglement. In particular, our analysis
focuses on various constraints on the pattern of entanglement which are known
to be satisfied by holographic sates, such as the saturation of Araki-Lieb
inequality (in certain circumstances), and the monogamy of mutual information.
We argue that even systems as simple as few non-interacting qubits can be
useful laboratories to explore how the emergence of the bulk geometry may be
related to quantum information principles.Comment: 55 pages, 23 figures. v2: typos fixed. v3: minor clarifications.
published versio
Distribution of Mutual Information from Complete and Incomplete Data
Mutual information is widely used, in a descriptive way, to measure the
stochastic dependence of categorical random variables. In order to address
questions such as the reliability of the descriptive value, one must consider
sample-to-population inferential approaches. This paper deals with the
posterior distribution of mutual information, as obtained in a Bayesian
framework by a second-order Dirichlet prior distribution. The exact analytical
expression for the mean, and analytical approximations for the variance,
skewness and kurtosis are derived. These approximations have a guaranteed
accuracy level of the order O(1/n^3), where n is the sample size. Leading order
approximations for the mean and the variance are derived in the case of
incomplete samples. The derived analytical expressions allow the distribution
of mutual information to be approximated reliably and quickly. In fact, the
derived expressions can be computed with the same order of complexity needed
for descriptive mutual information. This makes the distribution of mutual
information become a concrete alternative to descriptive mutual information in
many applications which would benefit from moving to the inductive side. Some
of these prospective applications are discussed, and one of them, namely
feature selection, is shown to perform significantly better when inductive
mutual information is used.Comment: 26 pages, LaTeX, 5 figures, 4 table
- …