A new upper bound for Shannon entropy. A novel approach in modeling of Big Data applications
Concurrency and Computation Practice and ExperiencePublished 11 December 2014
Pantelimon George Popescu, Emil Sluşanschi, Voichiţa Iancu, Florin Pop
Citations9
SJR quartileQ2
SJR score0.44
SNIP0.68
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A new upper bound for the classical Shannon's entropy is presented, derived from a refinement of a recent result from the literature, the inequality of S. S. Dragomir (2010).
Abstract
Summary Analyzing data type produced, stored, and aggregated in Big Data environments is a challenge in understanding data quality and represents a crucial support for decisionmaking. Big Data application modeling requires meta‐data modeling, interaction modeling, and execution modeling. Entropy, relative entropy, and mutual information play important roles in information theory. Our purpose within this paper is to present a new upper bound for the classical Shannon's entropy. The new bound is derived from a refinement of a recent result from the literature, the inequality of S. S. Dragomir (2010). The reasoning is based on splitting the considered interval into the mentioned inequality. The upper bound can be considered in understanding the potential information that each data type may have in a Big Data environment. Copyright © 2014 John Wiley & Sons, Ltd.
Keywords
Computer SciencePhysics and Astronomy
Acta MathematicaSur les fonctions convexes et les inégalités entre les valeurs moyennes
1,796 Citations1906J. L. W. V. Jensen
e-government based on cloud computing and service-oriented architecture
118 Citations2009Wojciech Cellary, Sergiusz Strykowski
Public sector should take advantage of improved conditions for development and deployment of e-government solutions through the adoption of new architectures such as cloud computing and service-oriented architecture, in the public sector.
Symposium on Discrete AlgorithmsSqueezing succinct data structures into entropy bounds
110 Citations2006Kunihiko Sadakane, Roberto Grossi
Concurrency and Computation Practice and ExperienceA distributed approach to network anomaly detection based on independent component analysis
85 Citations2013Francesco Palmieri, Ugo Fiore +1 more
A two‐stage anomaly detection strategy based on multiple distributed sensors located throughout the network, based on a binary classification scheme (detection is casted into an anomalous/normal classification problem) driven by machine learning‐inferred decision trees.
EntropyKernel Spectral Clustering for Big Data Networks
73 Citations2013Raghvendra Mall, Rocco Langone +1 more
The feasibility of utilizing the Kernel Spectral Clustering method for the purpose of community detection in big data networks, and a novel memory- and computationally efficient model selection procedure based on angular similarity in the eigenspace is shown.
Entropy of search logs
68 Citations2008Qiaozhu Mei, Kenneth Church
A new way to personalize search, personalization with backoff, using the first few bytes of the IP address to define classes, Ideally, classes would be defined by market segments, demographics and surrogate variables such as time and geography.
Applied Mathematics LettersSome bounds on entropy measures in information theory
62 Citations1997Sever S Dragomir, C.J. Goh
The Jensen Inequality is extended and applied to derive some useful lower bounds for various entropy measures of discrete random variables.
Mathematical and Computer ModellingA counterpart of Jensen's discrete inequality for differentiable convex mappings and applications in information theory
59 Citations1996Sever S Dragomir, C.J. Goh
Some meaningful bounds for entropy, conditional entropy, and mutual information arising from the theory of information are obtained.
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06Squeezing succinct data structures into entropy bounds
58 Citations2006Kunihiko Sadakane, Roberto Grossi
This work presents a technique for transforming succinct data structures (which do not change the binary content of S) into compressed data structures using just f (n) = o(log σ) extra bits, and improves the space complexity of some of the best known results on succinct data structure.
Survey on Classical Inequalities
56 Citations2000Themistocles M. Rassias
Mathematical and Computer ModellingA new refinement of Jensen’s inequality in linear spaces with applications
54 Citations2010Sever S Dragomir
A new refinement of Jensen's celebrated inequality for functions defined on convex sets in linear spaces is given and applications for norms, mean f-deviation and f-divergences are provided.
Applied Mathematics LettersJensen’s inequality and new entropy bounds
50 Citations2009Slavko Simić
New lower and upper bounds for Jensen's discrete inequality are established and new and more precise bounds for Shannon’s entropy are obtained.
EntropyDiscretization Based on Entropy and Multiple Scanning
46 Citations2013Jerzy W. Grzymala‐Busse
Results of the experiments show that the Multiple Scanning methodology is significantly better than both: Dominant Attribute and the better results of Globalized Equal Interval Width and Equal Frequency per Interval methods.
International Journal of Applied Mathematics and Computer ScienceA fuzzy approach to option pricing in a Levy process setting
31 Citations2013Piotr Nowak, Maciej Romaniuk
The proposed pricing method is based on stochastic analysis and the theory of fuzzy sets, and assumes that some parameters of the financial instrument cannot be precisely described and therefore they are introduced to the model as fuzzy numbers.
Applied Mathematics LettersA new entropy upper bound
26 Citations2012Nicolae Ţãpuş, Pantelimon George Popescu
A strong upper bound for the classical Shannon entropy is presented, refining recent results from the literature and improving the basic result of Simic through a stronger refinement of Jensen’s inequality.
Concurrency and Computation Practice and ExperienceDynamic group‐based fault tolerance technique for reliable resource management in mobile cloud computing
21 Citations2014Ji Su Park, Heonchang Yu +2 more
This work classifies mobile devices into groups according to the availability and the mobility in order to manage reliable mobile resource and provides dynamic group‐based mobile cloud computing that applies fault tolerance techniques using checkpoints or replication in each group.
EntropyFast Feature Selection in a GPU Cluster Using the Delta Test
14 Citations2014Alberto Guillén, M. G. Arenas +6 more
This paper presents an implementation of a genetic algorithm that has been parallelized using the classical island approach, but also considering graphic processing units to speed up the computation of the fitness function.
Concurrency and Computation Practice and ExperienceA methodology for assessing the predictable behaviour of mobile users in wireless networks
13 Citations2013Radu‐Corneliu Marin, Ciprian Dobre +1 more
It is proved that the human behaviour is predictable when the studied traced sets are convergent, complete and correct, and a surprising invariability in interacting with wireless access points is obtained, as it is able to pinpoint a wireless user to one of two locations at any specific hour.
International Journal of Applied Mathematics and Computer ScienceLocal Correlation and Entropy Maps as Tools for Detecting Defects in Industrial Images
13 Citations2008Ewa Skubalska-Rafajłowicz
The aim of this paper is to propose two methods of detecting defects in industrial products by an analysis of gray level images with low contrast between the defects and their background.
Journal of Applied PhysicsOn the sonic composites without/with defects
10 Citations2013Veturia Chiroiu, Cornel Brișan +3 more
EntropyInformation-Theoretic Data Discarding for Dynamic Trees on Data Streams
9 Citations2013Christoforos Anagnostopoulos, Robert B. Gramacy
This work takes steps to overcome challenges by porting information theoretic heuristics, such as exponential forgetting and active learning, into a fully Bayesian framework, by augmenting a modern non-parametric modeling framework, dynamic trees, and illustrating its performance on a number of practical examples.
Mathematical Problems in EngineeringNew Inequalities between Information Measures of Network Information Content
7 Citations2013Pantelimon-George Popescu, Florin Pop +2 more
A classical logarithmic inequality is refined using a discrete case of Bernoulli inequality and two information inequalities between information measures for graphs, based on information functionals, are refined.
EntropyStochasticity: A Feature for the Structuring of Large and Heterogeneous Image Databases
6 Citations2013Abdourrahmane M. Atto, Yannick Berthoumieu +1 more
The paper proposes semantic stochasticity templates upon wavelet packet sub-bands in order to provide high level classification and content-based image retrieval and the approach is shown to be relevant for texture images.
Concurrency and Computation Practice and ExperienceAdaptive method to support social‐based mobile networks using a pagerank approach
5 Citations2013Florin Pop, Radu‐Ioan Ciobanu +1 more
This work proposes a fundamental rethinking, where nodes and not paths are the observation focus, and presents an algorithm to compute and update the popularity of nodes using the probability of each node to be used as carrier for random messages traversing the network.
New Bounds of a Measure in Information Theory
1 Citations2014Mihaela Alexandra Popescu, Oana Slușanschi +2 more
The purpose of this paper is to present a new bound for the Shannon Entropy, a refinement of Jensen's inequality, for discrete-valued random variables.