Local structure learning of chain graphs with the false discovery rate control
Sign Up to like & getrecommendations! Published in 2018 at "Artificial Intelligence Review"
DOI: 10.1007/s10462-018-9669-4
Abstract: Chain graphs (CGs) containing both directed and undirected edges, offer an elegant generalisation of both Markov networks and Bayesian networks. In this paper, we propose an algorithm for local structure learning of CGs. It works… read more here.
Keywords: false discovery; chain graphs; control; structure ... See more keywords
On the Balaban Index of Chain Graphs
Sign Up to like & getrecommendations! Published in 2020 at "Bulletin of the Malaysian Mathematical Sciences Society"
DOI: 10.1007/s40840-020-01054-y
Abstract: The Balaban index and sum-Balaban index of a connected (molecular) graph G are defined as $$\begin{aligned} J(G)&=\frac{m}{\mu +1} \sum _{uv\in E(G)}\frac{1}{\sqrt{\sigma _{G}(u)\sigma _{G}(v)}}~ \text{ and }\\ SJ(G)&=\frac{m}{\mu +1} \sum _{uv\in E(G)}\frac{1}{\sqrt{\sigma _{G}(u)+\sigma _{G}(v)}}, \end{aligned}$$ respectively,… read more here.
Keywords: chain graphs; index; sum; balaban index ... See more keywords