Resolve
RDF Terms

Data based on @zazuko/vocabularies
Defined byquantitykind:
Click to Copy
quantitykind:InformationEntropy
Click to Copy
http://qudt.org/vocab/quantitykind/InformationEntropy

Recommended prefix

Copy 'PREFIX quantitykind: <http://qudt.org/vocab/quantitykind/>'

quantitykind:

rdf:type
qudt:QuantityKind
rdfs:label
lang:en
Information Entropy
rdfs:comment
lang:""
Applicable units are those of quantitykind:InformationEntropy
dcterms:description
lang:""
Information Entropy is a concept from information theory. It tells how much information there is in an event. In general, the more uncertain or random the event is, the more information it will contain. The concept of information entropy was created by a mathematician. He was named Claude Elwood Shannon. It has applications in many areas, including lossless data compression, statistical inference, cryptography and recently in other disciplines as biology, physics or machine learning.
qudt:applicableUnit
unit:BAN
unit:BIT
unit:BYTE
unit:ERLANG
unit:ExaBIT
unit:ExaBYTE
unit:ExbiBIT
unit:ExbiBYTE
unit:GibiBYTE
unit:GigaBYTE
unit:HART
unit:KibiBYTE
unit:KiloBYTE
unit:MebiBYTE
unit:MegaBYTE
unit:NAT
unit:PebiBIT
unit:PebiBYTE
unit:PetaBYTE
unit:SHANNON
unit:TebiBIT
unit:TebiBYTE
unit:TeraBYTE
qudt:hasDimensionVector
qkdv:A0E0L0I0M0H0T0D1
qudt:informativeReference
lang:""
http://simple.wikipedia.org/wiki/Information_entropy
qudt:plainTextDescription
lang:""
Information Entropy is a concept from information theory. It tells how much information there is in an event. In general, the more uncertain or random the event is, the more information it will contain. The concept of information entropy was created by a mathematician. He was named Claude Elwood Shannon. It has applications in many areas, including lossless data compression, statistical inference, cryptography and recently in other disciplines as biology, physics or machine learning.
rdfs:isDefinedBy
skos:broader
quantitykind:Dimensionless