Sciweavers

CORR
2007
Springer
87views Education» more  CORR 2007»
13 years 11 months ago
Entropy of capacities on lattices and set systems
We propose a definition for the entropy of capacities defined on lattices. Classical capacities are monotone set functions and can be seen as a generalization of probability mea...
Aoi Honda, Michel Grabisch
IM
2006
13 years 11 months ago
Estimating Entropy and Entropy Norm on Data Streams
We consider the problem of computing information theoretic functions such as entropy on a data stream, using sublinear space. Our first result deals with a measure we call the &quo...
Amit Chakrabarti, Khanh Do Ba, S. Muthukrishnan
IJUFKS
2006
47views more  IJUFKS 2006»
13 years 11 months ago
Maximal orness Weights with a Fixed Variability for OWA Operators
When using the ordered weighted average operator, it can happen that one wants to optimize the variability (measured by the entropy (maximal) or by the variance (minimal)) of the ...
Thierry Marchant
CORR
2007
Springer
105views Education» more  CORR 2007»
13 years 11 months ago
A Simple Proof of the Entropy-Power Inequality via Properties of Mutual Information
— While most useful information theoretic inequalities can be deduced from the basic properties of entropy or mutual information, Shannon’s entropy power inequality (EPI) seems...
Olivier Rioul
CORR
2006
Springer
90views Education» more  CORR 2006»
13 years 12 months ago
On entropy for mixtures of discrete and continuous variables
Let X be a discrete random variable with support S and f : S S be a bijection. Then it is wellknown that the entropy of X is the same as the entropy of f(X). This entropy preserva...
Chandra Nair, Balaji Prabhakar, Devavrat Shah
CORR
2006
Springer
105views Education» more  CORR 2006»
13 years 12 months ago
Mixing and non-mixing local minima of the entropy contrast for blind source separation
In this paper, both non-mixing and mixing local minima of the entropy are analyzed from the viewpoint of blind source separation (BSS); they correspond respectively to acceptable a...
Frédéric Vrins, Dinh-Tuan Pham, Mich...
ECCC
2010
86views more  ECCC 2010»
13 years 12 months ago
On Approximating the Entropy of Polynomial Mappings
We investigate the complexity of the following computational problem: Polynomial Entropy Approximation (PEA): Given a low-degree polynomial mapping p : Fn Fm , where F is a finite...
Zeev Dvir, Dan Gutfreund, Guy N. Rothblum, Salil P...
CORR
2008
Springer
69views Education» more  CORR 2008»
13 years 12 months ago
Information In The Non-Stationary Case
Information estimates such as the "direct method" of Strong et al. (1998) sidestep the difficult problem of estimating the joint distribution of response and stimulus by...
Vincent Q. Vu, Bin Yu, Robert E. Kass
CORR
2010
Springer
154views Education» more  CORR 2010»
13 years 12 months ago
Algorithmic Thermodynamics
Algorithmic entropy can be seen as a special case of entropy as studied in statistical mechanics. This viewpoint allows us to apply many techniques developed for use in thermodyna...
John C. Baez, Mike Stay
CORR
2010
Springer
67views Education» more  CORR 2010»
13 years 12 months ago
Transfer Entropy on Rank Vectors
A number of measures have been proposed for the direction of the coupling between two time series, and transfer entropy (TE) has been found in recent studies to perform consistentl...
Dimitris Kugiumtzis