Search results for "machine learning."
showing 10 items of 1455 documents
Combining Biophysical Modeling and Machine Learning to Predict Location of Atrial Ectopic Triggers
2018
The search for focal ectopic activity in the atria triggered from non-standard regions can be time consuming. The use of body surface potential maps to plan the intervention can be helpful, but require an advance processing of the data, that usually involves to solve an ill-posed inverse problem. In addition, changes in maps due to pathological substrate such as fibrosis might affect the expected electrical patterns. In this work, we use a machine learning approach to relate ectopic focus activity in different atrial regions with body surface potential maps, and consider the effects of fibrosis in various densities and distributions. Results show that as fibrosis increases over 15% the syst…
Class Noise and Supervised Learning in Medical Domains: The Effect of Feature Extraction
2006
Inductive learning systems have been successfully applied in a number of medical domains. It is generally accepted that the highest accuracy results that an inductive learning system can achieve depend on the quality of data and on the appropriate selection of a learning algorithm for the data. In this paper we analyze the effect of class noise on supervised learning in medical domains. We review the related work on learning from noisy data and propose to use feature extraction as a pre-processing step to diminish the effect of class noise on the learning process. Our experiments with 8 medical datasets show that feature extraction indeed helps to deal with class noise. It clearly results i…
Estimation and visualization of confusability matrices from adaptive measurement data
2010
Abstract We present a simple but effective method based on Luce’s choice axiom [Luce, R.D. (1959). Individual choice behavior: A theoretical analysis. New York: John Wiley & Sons] for consistent estimation of the pairwise confusabilities of items in a multiple-choice recognition task with arbitrarily chosen choice-sets. The method combines the exact (non-asymptotic) Bayesian way of assessing uncertainty with the unbiasedness emphasized in the classical frequentist approach. We apply the method to data collected using an adaptive computer game designed for prevention of reading disability. A player’s estimated confusability of phonemes (or more accurately, phoneme–grapheme connections) and l…
A Bayesian-optimal principle for learner-friendly adaptation in learning games
2010
Abstract Adaptive learning games should provide opportunities for the student to learn as well as motivate playing until goals have been reached. In this paper, we give a mathematically rigorous treatment of the problem in the framework of Bayesian decision theory. To quantify the opportunities for learning, we assume that the learning tasks that yield the most information about the current skills of the student, while being desirable for measurement in their own right, would also be among those that are efficient for learning. Indeed, optimization of the expected information gain appears to naturally avoid tasks that are exceedingly demanding or exceedingly easy as their results are predic…
Hidden Markov Model Based Machine Learning for mMTC Device Cell Association in 5G Networks
2019
Massive machine-type communication (mMTC) is expected to play a pivotal role in emerging 5G networks. Considering the dense deployment of small cells and the existence of heterogeneous cells, an MTC device can discover multiple cells for association. Under traditional cell association mechanisms, MTC devices are typically associated with an eNodeB with highest signal strength. However, the selected eNodeB may not be able to handle mMTC requests due to network congestion and overload. Therefore, reliable cell association would provide a smarter solution to facilitate mMTC connections. To enable such a solution, a hidden Markov model (HMM) based machine learning (ML) technique is proposed in …
Applications and Limitations of Robust Bayesian Bounds and Type II MLE
1994
Three applications of robust Bayesian analysis and three examples of its limitations are given. The applications that are reviewed are the development of an automatic Ockham’s Razor, outlier detection, and analysis of weighted distributions. Limitations of robust Bayesian bounds are highlighted through examples that include analysis of a paranormal experiment and a hierarchical model. This last example shows a disturbing difference between actual hierarchical Bayesian analysis and robust Bayesian bounds, a difference which also arises if, instead, a Type II MLE or empirical Bayes analysis is performed.
Bayesian Metanetwork for Context-Sensitive Feature Relevance
2006
Bayesian Networks are proven to be a comprehensive model to describe causal relationships among domain attributes with probabilistic measure of appropriate conditional dependency. However, depending on task and context, many attributes of the model might not be relevant. If a network has been learned across multiple contexts then all uncovered conditional dependencies are averaged over all contexts and cannot guarantee high predictive accuracy when applied to a concrete case. We are considering a context as a set of contextual attributes, which are not directly effect probability distribution of the target attributes, but they effect on a “relevance” of the predictive attributes towards tar…
Interpretable machine learning models for single-cell ChIP-seq imputation
2019
AbstractMotivationSingle-cell ChIP-seq (scChIP-seq) analysis is challenging due to data sparsity. High degree of data sparsity in biological high-throughput single-cell data is generally handled with imputation methods that complete the data, but specific methods for scChIP-seq are lacking. We present SIMPA, a scChIP-seq data imputation method leveraging predictive information within bulk data from ENCODE to impute missing protein-DNA interacting regions of target histone marks or transcription factors.ResultsImputations using machine learning models trained for each single cell, each target, and each genomic region accurately preserve cell type clustering and improve pathway-related gene i…
An evolutionary restricted neighborhood search clustering approach for PPI networks
2014
Protein-protein interaction networks have been broadly studied in the last few years, in order to understand the behavior of proteins inside the cell. Proteins interacting with each other often share common biological functions or they participate in the same biological process. Thus, discovering protein complexes made of a group of proteins strictly related can be useful to predict protein functions. Clustering techniques have been widely employed to detect significant biological complexes. In this paper, we integrate one of the most popular network clustering techniques, namely the Restricted Neighborhood Search Clustering (RNSC), with evolutionary computation. The two cost functions intr…
Proactive Handoff of Secondary User in Cognitive Radio Network Using Machine Learning Techniques
2021
Spectrum management always appears as an essential part of modern communication systems. Handoff is initiated when the signal strength of a current user deteriorates below a certain threshold. In cognitive radio network, the perception of handoff is different due to the presence of two categories of users: certified/primary user and uncertified/secondary user. The reason for the spectrum handoff arises when the primary user (PU) returns to one of its band used by the secondary user. The spectrum handoff is of two types: reactive handoff and proactive handoff. There are certain limitations in reactive handoff, such as it suffers from prolonged handoff latency and interference. In the proacti…