Knowledge discovery and interactive data mining in bioinformatics-state-of-the-art, future challenges and research directions

A Holzinger, M Dehmer, I Jurisica - BMC bioinformatics, 2014 - Springer
Background The life sciences, biomedicine and health care are increasingly turning into a
data intensive science [2–4]. Particularly in bioinformatics and computational biology we …

Networks for systems biology: conceptual connection of data and function

F Emmert-Streib, M Dehmer - IET systems biology, 2011 - IET
The purpose of this study is to survey the use of networks and network-based methods in
systems biology. This study starts with an introduction to graph theory and basic measures …

A history of graph entropy measures

M Dehmer, A Mowshowitz - Information Sciences, 2011 - Elsevier
This survey seeks to describe methods for measuring the entropy of graphs and to
demonstrate the wide applicability of entropy measures. Setting the scene with a review of …

On structure-sensitivity of degree-based topological indices

B Furtula, I Gutman, M Dehmer - Applied Mathematics and Computation, 2013 - Elsevier
One of the general requirements for any topological index TI is that similar molecules have
near-lying TI-values, which is referred to as “smoothness”. Curiously, however, smoothness …

Entropy and the complexity of graphs revisited

A Mowshowitz, M Dehmer - Entropy, 2012 - mdpi.com
This paper presents a taxonomy and overview of approaches to the measurement of graph
and network complexity. The taxonomy distinguishes between deterministic (eg …

Topological complexity of crystal structures: quantitative approach

S Krivovichev - Acta Crystallographica Section A: Foundations of …, 2012 - journals.iucr.org
The topological complexity of a crystal structure can be quantitatively evaluated using
complexity measures of its quotient graph, which is defined as a projection of a periodic …

Extremality of degree-based graph entropies

S Cao, M Dehmer, Y Shi - Information Sciences, 2014 - Elsevier
Many graph invariants have been used for the construction of entropy-based measures to
characterize the structure of complex networks. Based on Shannon's entropy, we study …

A note on distance-based graph entropies

Z Chen, M Dehmer, Y Shi - Entropy, 2014 - mdpi.com
A variety of problems in, eg, discrete mathematics, computer science, information theory,
statistics, chemistry, biology, etc., deal with inferring and characterizing relational structures …

Comparing supervised and unsupervised approaches to emotion categorization in the human brain, body, and subjective experience

B Azari, C Westlin, AB Satpute, JB Hutchinson… - Scientific reports, 2020 - nature.com
Abstract Machine learning methods provide powerful tools to map physical measurements to
scientific categories. But are such methods suitable for discovering the ground truth about …

From the connectivity index to various Randić-type descriptors

Y Ma, Y Shi, I Gutman, B Furtula - MATCH Communications in …, 2018 - scidar.kg.ac.rs
The Randić index was proposed by Randić in 1975 and has been widely studied in different
areas. We briefly review the Randić index and various Randić-type descriptors from 1975 to …