Results 1 to 10 of about 45,003 (116)
Sub-graph entropy based network approaches for classifying adolescent obsessive-compulsive disorder from resting-state functional MRI [PDF]
This paper presents a novel approach for classifying obsessive-compulsive disorder (OCD) in adolescents from resting-state fMRI data. Currently, the state-of-the-art for diagnosing OCD in youth involves interviews with adolescent patients and their ...
Bhaskar Sen +4 more
doaj +2 more sources
Relating Vertex and Global Graph Entropy in Randomly Generated Graphs [PDF]
Combinatoric measures of entropy capture the complexity of a graph but rely upon the calculation of its independent sets, or collections of non-adjacent vertices. This decomposition of the vertex set is a known NP-Complete problem and for most real world
Philip Tee +3 more
doaj +2 more sources
Some New Properties for Degree-Based Graph Entropies
The graph entropies inspired by Shannon’s entropy concept become the information-theoretic quantities for measuring the structural information of graphs and complex networks.
Guoxiang Lu, Bingqing Li, Lijia Wang
doaj +3 more sources
Degree-Based Graph Entropy in Structure–Property Modeling [PDF]
Sourav Mondal, Kinkar Chandra Das
exaly +2 more sources
Functional modules can be predicted using genome-wide protein–protein interactions (PPIs) from a systematic perspective. Various graph clustering algorithms have been applied to PPI networks for this task.
Hoyeon Jeong +4 more
doaj +1 more source
Graph Entropy Based on Strong Coloring of Uniform Hypergraphs
The classical graph entropy based on the vertex coloring proposed by Mowshowitz depends on a graph. In fact, a hypergraph, as a generalization of a graph, can express complex and high-order relations such that it is often used to model complex systems ...
Lusheng Fang +3 more
doaj +1 more source
On Entropy of Some Fractal Structures
Shannon entropy, also known as information entropy or entropy, measures the uncertainty or randomness of probability distribution. Entropy is measured in bits, quantifying the average amount of information required to identify an event from the ...
Haleemah Ghazwani +3 more
doaj +1 more source
Recent developments in quantitative graph theory: information inequalities for networks. [PDF]
In this article, we tackle a challenging problem in quantitative graph theory. We establish relations between graph entropy measures representing the structural information content of networks.
Matthias Dehmer, Lavanya Sivakumar
doaj +1 more source
Domain Concept Clustering Method Based on Graph Entropy Extreme Value Theory [PDF]
In domain ontology learning,in order to implement optimal clustering of concepts of the same domain without concept overlapping,this paper introduces the graph entropy extreme value theory and proposes a domain concept clustering method.According to the ...
AN Jingmin, LI Guanyu
doaj +1 more source
Entropy bounds for hierarchical molecular networks. [PDF]
In this paper we derive entropy bounds for hierarchical networks. More precisely, starting from a recently introduced measure to determine the topological entropy of non-hierarchical networks, we provide bounds for estimating the entropy of hierarchical ...
Matthias Dehmer +2 more
doaj +1 more source

