Matthias Dehmer - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

2010

2009

2008

Proceedings of the 2008 International Conference on Information Theory and Statistical Learning, ITSL 2008, Las Vegas, Nevada, USA, July 14-17, 2008Matthias Dehmer, Michael Drmota, Frank Emmert-Streib, editors, CSREA Press, 2008.

A Novel Method for Measuring the Structural Information Content of NetworksMatthias Dehmer. cas, 39(8):825-842, 2008. [doi]

Relations Between the Topological Complexities of Complex NetworksMatthias Dehmer. icai 2008: 855-859

Information-Theoretic Concepts for the Analysis of Complex NetworksMatthias Dehmer. aai, 22(7&8):684-706, 2008. [doi]

Information processing in complex networks: Graph entropy and information functionalsMatthias Dehmer. amc, 201(1-2):82-94, 2008. [doi]

Structural information content of networks: Graph entropy based on local vertex functionalsMatthias Dehmer, Frank Emmert-Streib. CANDC, 32(2):131-138, 2008. [doi]

A comparative analysis of multidimensional features of objects resembling sets of graphsMatthias Dehmer, Frank Emmert-Streib, Tanja Gesell. amc, 196(1):221-235, 2008. [doi]

2007

Proceedings of the 2007 International Conference on Machine Learning; Models, Technologies & Applications, MLMTA 2007, June 25-28, 2007, Las Vegas Nevada, USAHamid R. Arabnia, Matthias Dehmer, Frank Emmert-Streib, Mary Qu Yang, editors, CSREA Press, 2007.

A Graph Mining Technique for Automatic Classification of Web Genre DataMatthias Dehmer, Frank Emmert-Streib, Andreas Zulauf. mlmta 2007: 10-16

Graph-theoretical Characterizations of Generalized TreesMatthias Dehmer, Alexander Mehler, Frank Emmert-Streib. mlmta 2007: 113-117

Comparing large graphs efficiently by margins of feature vectorsMatthias Dehmer, Frank Emmert-Streib. amc, 188(2):1699-1710, 2007. [doi]

Structural similarity of directed universal hierarchical graphs: A low computational complexity approachMatthias Dehmer, Frank Emmert-Streib. amc, 194(1):7-20, 2007. [doi]

Optimization Procedure for Predicting Nonlinear Time Series Based on a Non-Gaussian Noise ModelFrank Emmert-Streib, Matthias Dehmer. micai 2007: 540-549 [doi]

Information theoretic measures of UHG graphs with low computational complexityFrank Emmert-Streib, Matthias Dehmer. amc, 190(2):1783-1794, 2007. [doi]

Topological mappings between graphs, trees and generalized treesFrank Emmert-Streib, Matthias Dehmer. amc, 186(2):1326-1333, 2007. [doi]

2006

A similarity measure for graphs with low computational complexityMatthias Dehmer, Frank Emmert-Streib, Jürgen Kilian. amc, 182(1):447-459, 2006. [doi]

Theoretical Bounds for the Number of Inferable Edges in Sparse Random NetworksFrank Emmert-Streib, Matthias Dehmer. psb 2006: 472-476

Influence of Prior Information on the Reconstruction of the Yeast Cell Cycle from Microarray DataFrank Emmert-Streib, Matthias Dehmer, Chris Seidel. psb 2006: 477-482

2005

Data Mining-Konzepte und graphentheoretische Methoden zur Analyse hypertextueller DatenMatthias Dehmer. ldvf, 20(1):113-141, 2005. [doi]

Classification of Large Graphs by a Local Tree DecompositionFrank Emmert-Streib, Matthias Dehmer, Jürgen Kilian. dmin 2005: 200-207

Towards Structure-sensitive Hypertext CategorizationAlexander Mehler, RÃ¼diger Gleim, Matthias Dehmer. gfkl 2006: 406-413 [doi]

2004

Aspekte der Kategorisierung von WebseitenMatthias Dehmer, Alexander Mehler, Rüdiger Gleim. gi 2004: 39-43

Towards Logical Hypertext StructureAlexander Mehler, Matthias Dehmer, Rüdiger Gleim. iics 2006: 136-150 [doi]