scholarly journals The Bethe approximation for solving the inverse Ising problem: a comparison with other inference methods

2012 ◽  
Vol 2012 (08) ◽  
pp. P08015 ◽  
Author(s):  
Federico Ricci-Tersenghi
Keyword(s):  
Bethe Approximation ◽  
Inference Methods

Discovery of New Genera Challenges the Subtribal Classification of Tok-Tok Beetles (Coleoptera: Tenebrionidae: Sepidiini)

2021 ◽  
Vol 5 (2) ◽  
Author(s):  
Olivia M Gearner ◽  
Marcin J Kamiński ◽  
Kojun Kanda ◽  
Kali Swichtenberg ◽  
Aaron D Smith
Keyword(s):  
Dna Sequences ◽  
Species Group ◽  
Phylogenetic Placement ◽  
Darkling Beetles ◽  
Species Groups ◽  
Taxonomic Groups ◽  
Inference Methods ◽  
A New Species ◽  
Coleoptera Tenebrionidae

Abstract Sepidiini is a speciose tribe of desert-inhabiting darkling beetles, which contains a number of poorly defined taxonomic groups and is in need of revision at all taxonomic levels. In this study, two previously unrecognized lineages were discovered, based on morphological traits, among the extremely speciose genera Psammodes Kirby, 1819 (164 species and subspecies) and Ocnodes Fåhraeus, 1870 (144 species and subspecies), namely the Psammodes spinosus species-group and Ocnodes humeralis species-group. In order to test their phylogenetic placement, a phylogeny of the tribe was reconstructed based on analyses of DNA sequences from six nonoverlapping genetic loci (CAD, wg, COI JP, COI BC, COII, and 28S) using Bayesian and maximum likelihood inference methods. The aforementioned, morphologically defined, species-groups were recovered as distinct and well-supported lineages within Molurina + Phanerotomeina and are interpreted as independent genera, respectively, Tibiocnodes Gearner & Kamiński gen. nov. and Tuberocnodes Gearner & Kamiński gen. nov. A new species, Tuberocnodes synhimboides Gearner & Kamiński sp. nov., is also described. Furthermore, as the recovered phylogenetic placement of Tibiocnodes and Tuberocnodes undermines the monophyly of Molurina and Phanerotomeina, an analysis of the available diagnostic characters for those subtribes is also performed. As a consequence, Phanerotomeina is considered as a synonym of the newly redefined Molurina sens. nov. Finally, spectrograms of vibrations produced by substrate tapping of two Molurina species, Toktokkus vialis (Burchell, 1822) and T. synhimboides, are presented.

scholarly journals ModularBoost: an efficient network inference algorithm based on module decomposition

2021 ◽  
Vol 22 (1) ◽  
Author(s):  
Xinyu Li ◽  
Wei Zhang ◽  
Jianming Zhang ◽  
Guang Li
Keyword(s):  
Network Inference ◽  
Detection Methods ◽  
Inference Problem ◽  
Topological Constraints ◽  
Inference Algorithms ◽  
Module Detection ◽  
Series Expression ◽  
Gene Modules ◽  
Inference Methods ◽  
Complicated Task

Abstract Background Given expression data, gene regulatory network(GRN) inference approaches try to determine regulatory relations. However, current inference methods ignore the inherent topological characters of GRN to some extent, leading to structures that lack clear biological explanation. To increase the biophysical meanings of inferred networks, this study performed data-driven module detection before network inference. Gene modules were identified by decomposition-based methods. Results ICA-decomposition based module detection methods have been used to detect functional modules directly from transcriptomic data. Experiments about time-series expression, curated and scRNA-seq datasets suggested that the advantages of the proposed ModularBoost method over established methods, especially in the efficiency and accuracy. For scRNA-seq datasets, the ModularBoost method outperformed other candidate inference algorithms. Conclusions As a complicated task, GRN inference can be decomposed into several tasks of reduced complexity. Using identified gene modules as topological constraints, the initial inference problem can be accomplished by inferring intra-modular and inter-modular interactions respectively. Experimental outcomes suggest that the proposed ModularBoost method can improve the accuracy and efficiency of inference algorithms by introducing topological constraints.

Ergonomics analysis based on intention inference

2021 ◽  
pp. 1-16
Author(s):  
First A. Wenbo Huang ◽  
Second B. Changyuan Wang ◽  
Third C. Hongbo Jia
Keyword(s):  
Eye Movement ◽  
Recognition Rate ◽  
Tactile Feedback ◽  
Movement Direction ◽  
Support Vector ◽  
Eeg Signals ◽  
Intention Recognition ◽  
Baseline Removal ◽  
Inference Methods ◽  
Intention Inference

Traditional intention inference methods rely solely on EEG, eye movement or tactile feedback, and the recognition rate is low. To improve the accuracy of a pilot’s intention recognition, a human-computer interaction intention inference method is proposed in this paper with the fusion of EEG, eye movement and tactile feedback. Firstly, EEG signals are collected near the frontal lobe of the human brain to extract features, which includes eight channels, i.e., AF7, F7, FT7, T7, AF8, F8, FT8, and T8. Secondly, the signal datas are preprocessed by baseline removal, normalization, and least-squares noise reduction. Thirdly, the support vector machine (SVM) is applied to carry out multiple binary classifications of the eye movement direction. Finally, the 8-direction recognition of the eye movement direction is realized through data fusion. Experimental results have shown that the accuracy of classification with the proposed method can reach 75.77%, 76.7%, 83.38%, 83.64%, 60.49%,60.93%, 66.03% and 64.49%, respectively. Compared with traditional methods, the classification accuracy and the realization process of the proposed algorithm are higher and simpler. The feasibility and effectiveness of EEG signals are further verified to identify eye movement directions for intention recognition.

A Survey on Causal Inference

2021 ◽  
Vol 15 (5) ◽  
pp. 1-46
Author(s):  
Liuyi Yao ◽  
Zhixuan Chu ◽  
Sheng Li ◽  
Yaliang Li ◽  
Jing Gao ◽  
...  
Keyword(s):  
Machine Learning ◽  
Causal Inference ◽  
Observational Data ◽  
Causal Effect ◽  
Research Direction ◽  
Estimation Methods ◽  
Potential Outcome ◽  
Outcome Framework ◽  
Benchmark Datasets ◽  
Inference Methods

Causal inference is a critical research topic across many domains, such as statistics, computer science, education, public policy, and economics, for decades. Nowadays, estimating causal effect from observational data has become an appealing research direction owing to the large amount of available data and low budget requirement, compared with randomized controlled trials. Embraced with the rapidly developed machine learning area, various causal effect estimation methods for observational data have sprung up. In this survey, we provide a comprehensive review of causal inference methods under the potential outcome framework, one of the well-known causal inference frameworks. The methods are divided into two categories depending on whether they require all three assumptions of the potential outcome framework or not. For each category, both the traditional statistical methods and the recent machine learning enhanced methods are discussed and compared. The plausible applications of these methods are also presented, including the applications in advertising, recommendation, medicine, and so on. Moreover, the commonly used benchmark datasets as well as the open-source codes are also summarized, which facilitate researchers and practitioners to explore, evaluate and apply the causal inference methods.

Drug–target prediction utilizing heterogeneous bio-linked network embeddings

2019 ◽  
Author(s):  
Nansu Zong ◽  
Rachael Sze Nga Wong ◽  
Yue Yu ◽  
Andrew Wen ◽  
Ming Huang ◽  
...  
Keyword(s):  
Drug Target ◽  
Target Prediction ◽  
Machine Learning Algorithms ◽  
Association Mining ◽  
Drug Target Prediction ◽  
Specific Prediction ◽  
Series Of Experiments ◽  
Inference Methods ◽  
Novel Drug ◽  
Prediction Strategy

Abstract To enable modularization for network-based prediction, we conducted a review of known methods conducting the various subtasks corresponding to the creation of a drug–target prediction framework and associated benchmarking to determine the highest-performing approaches. Accordingly, our contributions are as follows: (i) from a network perspective, we benchmarked the association-mining performance of 32 distinct subnetwork permutations, arranging based on a comprehensive heterogeneous biomedical network derived from 12 repositories; (ii) from a methodological perspective, we identified the best prediction strategy based on a review of combinations of the components with off-the-shelf classification, inference methods and graph embedding methods. Our benchmarking strategy consisted of two series of experiments, totaling six distinct tasks from the two perspectives, to determine the best prediction. We demonstrated that the proposed method outperformed the existing network-based methods as well as how combinatorial networks and methodologies can influence the prediction. In addition, we conducted disease-specific prediction tasks for 20 distinct diseases and showed the reliability of the strategy in predicting 75 novel drug–target associations as shown by a validation utilizing DrugBank 5.1.0. In particular, we revealed a connection of the network topology with the biological explanations for predicting the diseases, ‘Asthma’ ‘Hypertension’, and ‘Dementia’. The results of our benchmarking produced knowledge on a network-based prediction framework with the modularization of the feature selection and association prediction, which can be easily adapted and extended to other feature sources or machine learning algorithms as well as a performed baseline to comprehensively evaluate the utility of incorporating varying data sources.

Sign in / Sign up

Export Citation Format

Share Document