CHARACTERIZING CLASSES OF STRUCTURED OBJECTS BY MEANS OF INFORMATION INEQUALITIES
DOI10.1080/01969720902728369zbMATH Open1192.68165OpenAlexW2081311030MaRDI QIDQ3393530FDOQ3393530
Matthias Dehmer, Stephan Borgert
Publication date: 26 August 2009
Published in: Cybernetics and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01969720902728369
Recommendations
- POSSIBILISTIC INFORMATION METRICS AND DISTANCES: CHARACTERIZATIONS OF STRUCTURE
- A characterization of the information content of a classification
- scientific article; zbMATH DE number 4016761
- STRUCTURE OF POSSIBILISTIC INFORMATION METRICS AND DISTANCES: PROPERTIES
- An extension of the information inequality and related characterizations
- scientific article; zbMATH DE number 1122234
- Axiomatic characterizations of information measures
- On partial order characterizations of information structures
- An information-theoretic characterization of partitioned property spaces
Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) General topics in the theory of data (68P01)
Cites Work
- Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
- Entropy and the complexity of graphs: II. The information content of digraphs and infinite graphs
- Entropy and the complexity of graphs: III. Graphs with prescribed information content
- Entropy and the complexity of graphs: IV. Entropy measures and graphical structure
- Mining Graph Data
- Recursive density types and Nerode extensions of arithmetic
- A comparative analysis of multidimensional features of objects resembling sets of graphs
- Title not available (Why is that?)
- Topological mappings between graphs, trees and generalized trees
Cited In (3)
This page was built for publication: CHARACTERIZING CLASSES OF STRUCTURED OBJECTS BY MEANS OF INFORMATION INEQUALITIES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3393530)
