Results 21 to 30 of about 422,581 (268)
Graphic Models of Nicknames in the German-Speaking Internet-Space
The object of the study is a specific anthroponymic element of the onomastic system in German – the network name (nickname) and its representation in the German section of the Internet.
Viktoriya Viktorovna Kazyaba
doaj +1 more source
Projective Latent Dependency Forest Models
Latent dependence forest models (LDFM) are a new type of probabilistic models with the advantage of not requiring the difficult procedure of structure learning in model learning.
Yong Jiang, Yang Zhou, Kewei Tu
doaj +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
High-throughput microbial sequencing techniques, such as targeted amplicon-based and metagenomic profiling, provide low-cost genomic survey data of microbial communities in their natural environment, ranging from marine ecosystems to host-associated ...
Grace Yoon +2 more
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
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
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
DragDL:An Easy-to-Use Graphical DL Model Construction System [PDF]
Deep learning has broad applications in various fields.However,users still need to face problems from two aspects when applying deep learning.First,deep learning has a complex theoretical background,non-professional users lack background knowledge in ...
TANG Shi-zheng, ZHANG Yan-feng
doaj +1 more source
Lifted graphical models: a survey [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kimmig, Angelika +2 more
openaire +4 more sources
Undirected Structural Markov Property for Bayesian Model Determination
This paper generalizes the structural Markov properties for undirected decomposable graphs to arbitrary ones. This helps us to exploit the conditional independence properties of joint prior laws to analyze and compare multiple graphical structures, while
Xiong Kang, Yingying Hu, Yi Sun
doaj +1 more source

