We describe two modifications that parallelize and reorganize caching in the well-known Greedy Equivalence Search (GES) algorithm for discovering directed acyclic graphs on random variables from sample values. We apply one of these modifications, the Fast Greedy Search (FGS) assuming faithfulness, to an i.i.d. sample of 1,000 units to recover with high precision and good recall an average degree 2 directed acyclic graph (DAG) with one million Gaussian variables. We describe a modification of the algorithm to rapidly find the Markov Blanket of any variable in a high dimensional system. Using 51,000 voxels that parcellate an entire human cortex, we apply the FGS algorithm to Blood Oxygenation Level Dependent (BOLD) time series obtained from resting state fMRI.
Download full-text PDF |
Source |
|---|---|
| http://www.ncbi.nlm.nih.gov/pmc/articles/PMC5380925 | PMC |
| http://dx.doi.org/10.1007/s41060-016-0032-z | DOI Listing |
Publication Analysis
Top Keywords
Similar Publications
Development and experimental validation of an in-house treatment planning system with greedy energy layer optimization for fast IMPT.
ArXiv
November 2024
Department of Radiation Oncology, University of Kansas Medical Center, USA.
Background: Intensity-modulated proton therapy (IMPT) using pencil beam technique scans tumor in a layer by layer, then spot by spot manner. It can provide highly conformal dose to tumor targets and spare nearby organs-at-risk (OAR). Fast delivery of IMPT can improve patient comfort and reduce motion-induced uncertainties.
View Article and Find Full Text PDFArticle Synopsis
- Ultra-wideband systems enhance the capacity of existing fiber networks by transferring power between different wavelength channels using the principle of inelastic inter-channel stimulated Raman scattering.
- Effective management of launch power is crucial for optimizing data throughput, and while particle swarm optimization can solve this issue, it is computationally intensive and sensitive to changes in the objective value.
- The paper presents a fast, data-driven deep neural network approach that significantly speeds up processing time while maintaining high throughput, along with an iterative greedy algorithm that offers a near-optimal solution with much lower computational demands.
Seeking Optimal Montage for Single-Pair Transcranial Direct Current Stimulation Using Bayesian Optimization and Hyperband-A Feasibility Study.
Neuromodulation
January 2025
Department of Computer Science and Engineering, Gyeongsang National University, Jinju, South Korea. Electronic address:
Objectives: Transcranial direct current stimulation (tDCS) is an emerging neuromodulation technique. The effect of tDCS can vary significantly depending on electrode position and current intensity, making it crucial to find an optimized tDCS montage. However, because of the high computational load, most tDCS optimization approaches have been performed with a limited number of candidates for electrode positions, such as 10-10 or 10-20 international channel configurations.
View Article and Find Full Text PDFAll-to-all reconfigurability with sparse and higher-order Ising machines.
Nat Commun
October 2024
Department of Electrical and Computer Engineering, University of California, Santa Barbara, Santa Barbara, CA, 93106, USA.
Domain-specific hardware to solve computationally hard optimization problems has generated tremendous excitement. Here, we evaluate probabilistic bit (p-bit) based Ising Machines (IM) on the 3-Regular 3-Exclusive OR Satisfiability (3R3X), as a representative hard optimization problem. We first introduce a multiplexed architecture that emulates all-to-all network functionality while maintaining highly parallelized chromatic Gibbs sampling.
View Article and Find Full Text PDFIntelligent diagnosis of Kawasaki disease from real-world data using interpretable machine learning models.
Hellenic J Cardiol
August 2024
College of Medical Informatics, Chongqing Medical University, Chongqing 400016, PR China. Electronic address:
Article Synopsis
- The study aimed to create interpretable machine learning models using real-world electronic medical record data to diagnose Kawasaki disease and identify important risk factors.
- Conducted with data from 4087 pediatric patients, multiple machine learning models were tested, with the Explainable Boosting Machine (EBM) showing the best performance and interpretability for diagnosis.
- Key indicators like platelet distribution width and erythrocyte sedimentation rate were highlighted as significant predictors in diagnosing Kawasaki disease, showcasing the models' potential for improving early detection.
Want AI Summaries of new PubMed Abstracts delivered to your In-box?
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!