Results 21 to 30 of about 1,309,109 (281)
Explicit Formula of Koszul–Vinberg Characteristic Functions for a Wide Class of Regular Convex Cones
The Koszul–Vinberg characteristic function plays a fundamental role in the theory of convex cones. We give an explicit description of the function and related integral formulas for a new class of convex cones, including homogeneous cones and cones ...
Hideyuki Ishi
doaj +1 more source
Background Probabilistic graphical modelling (PGM) can be used to predict risk at the individual patient level and show multiple outcomes and exposures in a single model.Objective To develop PGM for the prediction of clinical outcome in patients with ...
Dong Ah Shin +6 more
doaj +1 more source
Graphical representations and cluster algorithms for critical points with fields [PDF]
A two-replica graphical representation and associated cluster algorithm is described that is applicable to ferromagnetic Ising systems with arbitrary fields.
A. Coniglio +19 more
core +1 more source
Detecting Community Evolution by Utilizing Individual Temporal Semantics in Social Networks
Social networks are becoming increasingly popular and significant. One of the most distinctive features of these networks is their dynamic nature, which means that they change over time.
Feng Wang, Dingbo Hou, Hao Yan
doaj +1 more source
MULTIAGENT EXPEDITION WITH GRAPHICAL MODELS [PDF]
We investigate a class of multiagent planning problems termed multiagent expedition, where agents move around an open, unknown, partially observable, stochastic, and physical environment, in pursuit of multiple and alternative goals of different utility. Optimal planning in multiagent expedition is highly intractable.
Xiang, Yang, Hanshar, Frank
openaire +2 more sources
Graph-based multivariate conditional autoregressive models
The conditional autoregressive model is a routinely used statistical model for areal data that arise from, for instances, epidemiological, socio-economic or ecological studies.
Ye Liang
doaj +1 more source
Partition-Merge: Distributed Inference and Modularity Optimization
This paper presents a novel meta-algorithm, Partition-Merge (PM), which takes existing centralized algorithms for graph computation and makes them distributed and faster. In a nutshell, PM divides the graph into small subgraphs using our novel randomized
Vincent Blondel +4 more
doaj +1 more source
Paired comparison data considered in this paper originate from the comparison of a large number N of individuals in couples. The dataset is a collection of results of contests between two individuals when each of them has faced n opponents, where n is ...
Corff, Sylvain Le +2 more
core +3 more sources
A Tighter Bound for Graphical Models [PDF]
We present a method to bound the partition function of a Boltzmann machine neural network with any odd-order polynomial. This is a direct extension of the mean-field bound, which is first order. We show that the third-order bound is strictly better than mean field.
Leisink, M.A.R., Kappen, H.J.
openaire +5 more sources
Evaluation of graphical control flow management approaches for Event-B modelling [PDF]
Integrating graphical representations with formal methods can help bridge the gap between requirements and formal modelling. In this paper, we compare and evaluate two graphical approaches aiming at describing control flows and refinement in Event-B, and
Butler, Michael +2 more
core +2 more sources

