Results 71 to 80 of about 168,985 (282)
This chapter introduces pairwise Markov random fields (PMRFs), a class of models of which the parameters can be represented as an undirected network. In this undirected network nodes represent variables and edges represent the strength of association between two variables after conditioning on all other variables included in the model.
Epskamp, S. +3 more
openaire +3 more sources
The polymerase chain reaction (PCR).Perturbation Theory and Machine Learning framework integrates perturbation theory and machine learning to classify genetic sequences, distinguishing ancient DNA from modern controls and predicting tree health from soil metagenomic data.
Jose L. Rodriguez +19 more
wiley +1 more source
Submodular relaxation for inference in Markov random fields
In this paper we address the problem of finding the most probable state of a discrete Markov random field (MRF), also known as the MRF energy minimization problem. The task is known to be NP-hard in general and its practical importance motivates numerous
Osokin, Anton, Vetrov, Dmitry
core +3 more sources
gnSPADE integrates gene‐network structures into a probabilistic topic modeling framework to achieve reference‐free cell‐type deconvolution in spatial transcriptomics. By embedding gene connectivity within the generative process, gnSPADE enhances biological interpretability and accuracy across simulated and real datasets, revealing spatial organization ...
Aoqi Xie, Yuehua Cui
wiley +1 more source
Combinatorial Markov Random Fields [PDF]
A combinatorial random variable is a discrete random variable defined over a combinatorial set (e.g., a power set of a given set). In this paper we introduce combinatorial Markov random fields (Comrafs), which are Markov random fields where some of the nodes are combinatorial random variables.
Bekkerman, R +2 more
openaire +1 more source
Feature Disentangling and Combination Implemented by Spin–Orbit Torque Magnetic Tunnel Junctions
Spin–orbit torque magnetic tunnel junctions (SOT‐MTJs) enable efficient feature disentangling and integration in image data. A proposed algorithm leverages SOT‐MTJs as true random number generators to disentangle and recombine features in real time, with experimental validation on emoji and facial datasets.
Xiaohan Li +15 more
wiley +1 more source
This study introduces a data‐driven framework that combines deep reinforcement learning with classical path planning to achieve adaptive microrobot navigation. By training a surrogate neural network to emulate microrobot dynamics, the approach improves learning efficiency, reduces training time, and enables robust real‐time obstacle avoidance in ...
Amar Salehi +3 more
wiley +1 more source
This paper introduces a new supervised classification method for hyperspectral images that combines spectral and spatial information. A support vector machine (SVM) classifier, integrated with a subspace projection method to address the problems of mixed
Haoyang Yu +5 more
doaj +1 more source
Collaborative Multiagent Closed‐Loop Motion Planning for Multimanipulator Systems
This work presents a hierarchical multi‐manipulator planner, emphasizing highly overlapping space. The proposed method leverages an enhanced Dynamic Movement Primitive based planner along with an improvised Multi‐Agent Reinforcement Learning approach to ensure regulatory and mediatory control while ensuring low‐level autonomy. Experiments across varied
Tian Xu, Siddharth Singh, Qing Chang
wiley +1 more source
The stability of conditional Markov processes and Markov chains in random environments
We consider a discrete time hidden Markov model where the signal is a stationary Markov chain. When conditioned on the observations, the signal is a Markov chain in a random environment under the conditional measure.
van Handel, Ramon
core +1 more source

